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_product19.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:39:24,194 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:39:24,196 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:39:24,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:39:24,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:39:24,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:39:24,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:39:24,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:39:24,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:39:24,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:39:24,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:39:24,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:39:24,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:39:24,227 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:39:24,232 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:39:24,234 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:39:24,235 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:39:24,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:39:24,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:39:24,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:39:24,248 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:39:24,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:39:24,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:39:24,256 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:39:24,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:39:24,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:39:24,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:39:24,263 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:39:24,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:39:24,267 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:39:24,267 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:39:24,268 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:39:24,269 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:39:24,271 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:39:24,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:39:24,277 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:39:24,277 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:39:24,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:39:24,278 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:39:24,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:39:24,282 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:39:24,283 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:24,314 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:39:24,315 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:39:24,316 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:39:24,317 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:39:24,317 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:39:24,318 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:39:24,318 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:39:24,318 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:39:24,318 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:39:24,319 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:39:24,321 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:39:24,322 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:39:24,322 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:39:24,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:39:24,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:39:24,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:39:24,323 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:39:24,324 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:39:24,324 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:39:24,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:39:24,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:39:24,325 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:39:24,325 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:39:24,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:39:24,326 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:39:24,326 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:39:24,326 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:39:24,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:39:24,326 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:39:24,327 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:39:24,389 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:39:24,407 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:39:24,411 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:39:24,413 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:39:24,413 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:39:24,414 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product19.cil.c [2019-10-03 02:39:24,487 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26eae3006/8a715899023f4f45a3643f80d7577ba5/FLAG428bc36bf [2019-10-03 02:39:25,198 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:39:25,199 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product19.cil.c [2019-10-03 02:39:25,218 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26eae3006/8a715899023f4f45a3643f80d7577ba5/FLAG428bc36bf [2019-10-03 02:39:25,359 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26eae3006/8a715899023f4f45a3643f80d7577ba5 [2019-10-03 02:39:25,368 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:39:25,370 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:39:25,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:39:25,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:39:25,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:39:25,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:39:25" (1/1) ... [2019-10-03 02:39:25,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52d5ae8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:25, skipping insertion in model container [2019-10-03 02:39:25,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:39:25" (1/1) ... [2019-10-03 02:39:25,388 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:39:25,465 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:39:26,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:39:26,177 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:39:26,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:39:26,422 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:39:26,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:26 WrapperNode [2019-10-03 02:39:26,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:39:26,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:39:26,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:39:26,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:39:26,440 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:26" (1/1) ... [2019-10-03 02:39:26,442 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:26" (1/1) ... [2019-10-03 02:39:26,500 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:26" (1/1) ... [2019-10-03 02:39:26,501 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:26" (1/1) ... [2019-10-03 02:39:26,584 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:26" (1/1) ... [2019-10-03 02:39:26,621 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:26" (1/1) ... [2019-10-03 02:39:26,637 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:26" (1/1) ... [2019-10-03 02:39:26,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:39:26,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:39:26,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:39:26,659 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:39:26,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:39:26,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:39:26,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:39:26,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:39:26,722 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-03 02:39:26,722 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-03 02:39:26,722 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-03 02:39:26,722 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-03 02:39:26,722 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-03 02:39:26,722 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-03 02:39:26,723 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-03 02:39:26,723 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-03 02:39:26,723 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-03 02:39:26,724 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-03 02:39:26,725 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-03 02:39:26,725 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-03 02:39:26,726 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-03 02:39:26,726 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-03 02:39:26,726 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-03 02:39:26,726 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-03 02:39:26,726 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-03 02:39:26,726 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-03 02:39:26,727 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-03 02:39:26,727 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-03 02:39:26,727 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-03 02:39:26,728 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-03 02:39:26,728 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-03 02:39:26,728 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-03 02:39:26,728 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-03 02:39:26,729 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-03 02:39:26,729 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-03 02:39:26,729 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-03 02:39:26,729 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-03 02:39:26,730 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-03 02:39:26,730 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-03 02:39:26,730 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-10-03 02:39:26,730 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:39:26,730 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:39:26,730 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:39:26,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:39:26,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:39:26,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:39:26,731 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:39:26,731 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:39:26,731 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:39:26,732 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:39:26,732 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:39:26,732 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-03 02:39:26,732 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-03 02:39:26,733 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-03 02:39:26,733 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:39:26,733 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-03 02:39:26,733 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-03 02:39:26,733 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-03 02:39:26,733 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-03 02:39:26,734 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-03 02:39:26,734 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-03 02:39:26,734 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-03 02:39:26,734 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-03 02:39:26,734 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-03 02:39:26,735 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-03 02:39:26,735 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-03 02:39:26,735 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-03 02:39:26,735 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-03 02:39:26,735 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-03 02:39:26,736 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:39:26,736 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-03 02:39:26,736 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:39:26,736 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-03 02:39:26,737 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-03 02:39:26,737 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-03 02:39:26,737 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-03 02:39:26,737 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-03 02:39:26,737 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-03 02:39:26,738 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-03 02:39:26,738 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-03 02:39:26,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:39:26,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:39:26,739 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:39:26,739 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-03 02:39:26,740 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-03 02:39:26,740 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-03 02:39:26,740 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-03 02:39:26,740 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-03 02:39:26,741 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-03 02:39:26,741 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-03 02:39:26,742 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-03 02:39:26,743 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-03 02:39:26,743 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-03 02:39:26,743 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-03 02:39:26,743 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-03 02:39:26,743 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-03 02:39:26,743 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-03 02:39:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-03 02:39:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-03 02:39:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-03 02:39:26,744 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-03 02:39:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-03 02:39:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-03 02:39:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-03 02:39:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-03 02:39:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-03 02:39:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-03 02:39:26,746 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-03 02:39:26,746 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-03 02:39:26,746 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-03 02:39:26,746 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-03 02:39:26,746 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-03 02:39:26,746 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-03 02:39:26,747 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-03 02:39:26,747 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-03 02:39:26,747 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-03 02:39:26,747 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-03 02:39:26,747 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-03 02:39:26,747 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-03 02:39:26,748 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-10-03 02:39:26,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:39:26,749 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-03 02:39:26,749 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-03 02:39:26,749 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-03 02:39:26,750 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-03 02:39:26,750 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-03 02:39:26,750 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:39:26,751 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-03 02:39:26,752 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-03 02:39:26,752 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-03 02:39:26,752 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-03 02:39:26,752 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:39:26,752 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:39:26,752 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:39:26,753 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:39:26,753 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:39:26,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:39:26,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:39:26,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:39:26,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:39:26,754 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:39:26,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:39:26,754 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:39:26,755 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:39:26,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:39:26,759 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:39:26,759 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:39:26,759 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:39:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:39:26,766 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:39:26,767 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:39:26,767 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:39:26,767 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-03 02:39:26,767 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-03 02:39:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-03 02:39:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-03 02:39:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-03 02:39:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-03 02:39:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-03 02:39:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-03 02:39:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-03 02:39:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-03 02:39:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-03 02:39:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:39:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-03 02:39:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:39:26,770 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-03 02:39:26,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:39:26,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:39:26,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:39:29,081 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:39:29,081 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-03 02:39:29,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:39:29 BoogieIcfgContainer [2019-10-03 02:39:29,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:39:29,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:39:29,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:39:29,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:39:29,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:39:25" (1/3) ... [2019-10-03 02:39:29,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b61cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:39:29, skipping insertion in model container [2019-10-03 02:39:29,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:39:26" (2/3) ... [2019-10-03 02:39:29,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b61cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:39:29, skipping insertion in model container [2019-10-03 02:39:29,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:39:29" (3/3) ... [2019-10-03 02:39:29,092 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product19.cil.c [2019-10-03 02:39:29,103 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:39:29,114 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:39:29,136 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:39:29,174 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:39:29,174 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:39:29,174 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:39:29,174 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:39:29,174 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:39:29,175 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:39:29,175 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:39:29,175 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:39:29,221 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states. [2019-10-03 02:39:29,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-03 02:39:29,272 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:29,274 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:29,277 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:29,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:29,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1411507135, now seen corresponding path program 1 times [2019-10-03 02:39:29,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:29,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:29,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:29,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:29,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:30,000 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:30,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:30,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:30,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:30,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:30,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:30,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:30,033 INFO L87 Difference]: Start difference. First operand 735 states. Second operand 4 states. [2019-10-03 02:39:30,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:30,282 INFO L93 Difference]: Finished difference Result 598 states and 942 transitions. [2019-10-03 02:39:30,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:39:30,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-03 02:39:30,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:30,309 INFO L225 Difference]: With dead ends: 598 [2019-10-03 02:39:30,310 INFO L226 Difference]: Without dead ends: 587 [2019-10-03 02:39:30,312 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:30,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-03 02:39:30,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-03 02:39:30,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-03 02:39:30,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 928 transitions. [2019-10-03 02:39:30,415 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 928 transitions. Word has length 135 [2019-10-03 02:39:30,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:30,415 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 928 transitions. [2019-10-03 02:39:30,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:30,416 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 928 transitions. [2019-10-03 02:39:30,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-03 02:39:30,422 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:30,422 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:30,423 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:30,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:30,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1349279833, now seen corresponding path program 1 times [2019-10-03 02:39:30,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:30,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:30,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:30,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:30,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:30,641 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:30,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:30,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:30,642 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:30,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:30,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:30,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:30,647 INFO L87 Difference]: Start difference. First operand 587 states and 928 transitions. Second operand 4 states. [2019-10-03 02:39:30,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:30,742 INFO L93 Difference]: Finished difference Result 589 states and 929 transitions. [2019-10-03 02:39:30,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:39:30,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-03 02:39:30,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:30,751 INFO L225 Difference]: With dead ends: 589 [2019-10-03 02:39:30,751 INFO L226 Difference]: Without dead ends: 587 [2019-10-03 02:39:30,752 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:30,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-03 02:39:30,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-03 02:39:30,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-03 02:39:30,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 927 transitions. [2019-10-03 02:39:30,808 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 927 transitions. Word has length 136 [2019-10-03 02:39:30,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:30,808 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 927 transitions. [2019-10-03 02:39:30,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:30,808 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 927 transitions. [2019-10-03 02:39:30,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-03 02:39:30,814 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:30,814 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:30,814 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:30,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:30,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1382966461, now seen corresponding path program 1 times [2019-10-03 02:39:30,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:30,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:30,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:30,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:30,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:30,959 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:30,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:30,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:30,960 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:30,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:30,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:30,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:30,961 INFO L87 Difference]: Start difference. First operand 587 states and 927 transitions. Second operand 4 states. [2019-10-03 02:39:31,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:31,034 INFO L93 Difference]: Finished difference Result 589 states and 928 transitions. [2019-10-03 02:39:31,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:39:31,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-03 02:39:31,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:31,041 INFO L225 Difference]: With dead ends: 589 [2019-10-03 02:39:31,043 INFO L226 Difference]: Without dead ends: 587 [2019-10-03 02:39:31,044 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:31,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-03 02:39:31,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-03 02:39:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-03 02:39:31,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 926 transitions. [2019-10-03 02:39:31,086 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 926 transitions. Word has length 137 [2019-10-03 02:39:31,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:31,088 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 926 transitions. [2019-10-03 02:39:31,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:31,088 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 926 transitions. [2019-10-03 02:39:31,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-03 02:39:31,099 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:31,099 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:31,099 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:31,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:31,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1519078827, now seen corresponding path program 1 times [2019-10-03 02:39:31,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:31,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:31,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:31,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:31,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:31,323 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:31,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:31,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:31,324 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:31,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:31,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:31,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:31,326 INFO L87 Difference]: Start difference. First operand 587 states and 926 transitions. Second operand 4 states. [2019-10-03 02:39:31,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:31,401 INFO L93 Difference]: Finished difference Result 589 states and 927 transitions. [2019-10-03 02:39:31,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:39:31,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-03 02:39:31,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:31,408 INFO L225 Difference]: With dead ends: 589 [2019-10-03 02:39:31,408 INFO L226 Difference]: Without dead ends: 587 [2019-10-03 02:39:31,409 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:31,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-03 02:39:31,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-03 02:39:31,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-03 02:39:31,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 925 transitions. [2019-10-03 02:39:31,440 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 925 transitions. Word has length 138 [2019-10-03 02:39:31,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:31,441 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 925 transitions. [2019-10-03 02:39:31,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 925 transitions. [2019-10-03 02:39:31,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-03 02:39:31,447 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:31,447 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:31,448 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:31,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:31,448 INFO L82 PathProgramCache]: Analyzing trace with hash -939532999, now seen corresponding path program 1 times [2019-10-03 02:39:31,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:31,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:31,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:31,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:31,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:31,605 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:31,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:31,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:31,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:31,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:31,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:31,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:31,607 INFO L87 Difference]: Start difference. First operand 587 states and 925 transitions. Second operand 4 states. [2019-10-03 02:39:31,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:31,663 INFO L93 Difference]: Finished difference Result 589 states and 926 transitions. [2019-10-03 02:39:31,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 02:39:31,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-03 02:39:31,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:31,670 INFO L225 Difference]: With dead ends: 589 [2019-10-03 02:39:31,670 INFO L226 Difference]: Without dead ends: 587 [2019-10-03 02:39:31,671 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:31,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-03 02:39:31,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-03 02:39:31,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-03 02:39:31,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 924 transitions. [2019-10-03 02:39:31,692 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 924 transitions. Word has length 139 [2019-10-03 02:39:31,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:31,693 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 924 transitions. [2019-10-03 02:39:31,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:31,693 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 924 transitions. [2019-10-03 02:39:31,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 02:39:31,697 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:31,698 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:31,698 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:31,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:31,698 INFO L82 PathProgramCache]: Analyzing trace with hash 195155025, now seen corresponding path program 1 times [2019-10-03 02:39:31,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:31,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:31,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:31,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:31,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:31,907 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:31,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:31,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:39:31,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:31,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:39:31,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:39:31,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:39:31,911 INFO L87 Difference]: Start difference. First operand 587 states and 924 transitions. Second operand 10 states. [2019-10-03 02:39:32,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:32,181 INFO L93 Difference]: Finished difference Result 596 states and 936 transitions. [2019-10-03 02:39:32,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:39:32,183 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-03 02:39:32,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:32,194 INFO L225 Difference]: With dead ends: 596 [2019-10-03 02:39:32,194 INFO L226 Difference]: Without dead ends: 596 [2019-10-03 02:39:32,196 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:32,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-03 02:39:32,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 594. [2019-10-03 02:39:32,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-10-03 02:39:32,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 934 transitions. [2019-10-03 02:39:32,310 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 934 transitions. Word has length 140 [2019-10-03 02:39:32,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:32,312 INFO L475 AbstractCegarLoop]: Abstraction has 594 states and 934 transitions. [2019-10-03 02:39:32,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:39:32,313 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 934 transitions. [2019-10-03 02:39:32,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 02:39:32,317 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:32,318 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:32,318 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:32,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:32,318 INFO L82 PathProgramCache]: Analyzing trace with hash -791427664, now seen corresponding path program 1 times [2019-10-03 02:39:32,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:32,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:32,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:32,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:32,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:32,434 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:32,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:32,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 02:39:32,435 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:32,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 02:39:32,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 02:39:32,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 02:39:32,436 INFO L87 Difference]: Start difference. First operand 594 states and 934 transitions. Second operand 4 states. [2019-10-03 02:39:32,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:32,506 INFO L93 Difference]: Finished difference Result 592 states and 929 transitions. [2019-10-03 02:39:32,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:39:32,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-03 02:39:32,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:32,512 INFO L225 Difference]: With dead ends: 592 [2019-10-03 02:39:32,513 INFO L226 Difference]: Without dead ends: 590 [2019-10-03 02:39:32,513 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:32,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-03 02:39:32,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-03 02:39:32,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-03 02:39:32,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 927 transitions. [2019-10-03 02:39:32,537 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 927 transitions. Word has length 140 [2019-10-03 02:39:32,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:32,537 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 927 transitions. [2019-10-03 02:39:32,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 02:39:32,538 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 927 transitions. [2019-10-03 02:39:32,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-03 02:39:32,542 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:32,542 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:32,542 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:32,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:32,543 INFO L82 PathProgramCache]: Analyzing trace with hash -306965809, now seen corresponding path program 1 times [2019-10-03 02:39:32,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:32,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:32,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:32,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:32,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:32,694 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:32,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:32,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:32,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:32,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:32,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:32,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:32,698 INFO L87 Difference]: Start difference. First operand 590 states and 927 transitions. Second operand 6 states. [2019-10-03 02:39:32,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:32,987 INFO L93 Difference]: Finished difference Result 607 states and 948 transitions. [2019-10-03 02:39:32,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:39:32,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-03 02:39:32,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:32,993 INFO L225 Difference]: With dead ends: 607 [2019-10-03 02:39:32,993 INFO L226 Difference]: Without dead ends: 598 [2019-10-03 02:39:32,994 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:32,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-03 02:39:33,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 595. [2019-10-03 02:39:33,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-03 02:39:33,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 928 transitions. [2019-10-03 02:39:33,023 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 928 transitions. Word has length 141 [2019-10-03 02:39:33,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:33,024 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 928 transitions. [2019-10-03 02:39:33,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:33,024 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 928 transitions. [2019-10-03 02:39:33,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-03 02:39:33,028 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:33,033 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:33,034 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:33,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:33,034 INFO L82 PathProgramCache]: Analyzing trace with hash 394745588, now seen corresponding path program 1 times [2019-10-03 02:39:33,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:33,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:33,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:33,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:33,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:33,210 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:33,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:33,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:33,210 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:33,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:33,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:33,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:33,212 INFO L87 Difference]: Start difference. First operand 595 states and 928 transitions. Second operand 6 states. [2019-10-03 02:39:33,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:33,487 INFO L93 Difference]: Finished difference Result 598 states and 931 transitions. [2019-10-03 02:39:33,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:33,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-03 02:39:33,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:33,496 INFO L225 Difference]: With dead ends: 598 [2019-10-03 02:39:33,496 INFO L226 Difference]: Without dead ends: 595 [2019-10-03 02:39:33,496 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:33,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-10-03 02:39:33,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-10-03 02:39:33,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-03 02:39:33,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 924 transitions. [2019-10-03 02:39:33,521 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 924 transitions. Word has length 142 [2019-10-03 02:39:33,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:33,522 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 924 transitions. [2019-10-03 02:39:33,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:33,522 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 924 transitions. [2019-10-03 02:39:33,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:39:33,529 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:33,529 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:33,530 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:33,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:33,530 INFO L82 PathProgramCache]: Analyzing trace with hash -447409932, now seen corresponding path program 1 times [2019-10-03 02:39:33,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:33,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:33,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:33,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:33,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:33,678 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:33,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:33,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:33,679 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:33,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:33,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:33,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:33,680 INFO L87 Difference]: Start difference. First operand 595 states and 924 transitions. Second operand 6 states. [2019-10-03 02:39:33,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:33,901 INFO L93 Difference]: Finished difference Result 598 states and 927 transitions. [2019-10-03 02:39:33,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:33,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-03 02:39:33,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:33,906 INFO L225 Difference]: With dead ends: 598 [2019-10-03 02:39:33,907 INFO L226 Difference]: Without dead ends: 595 [2019-10-03 02:39:33,907 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:33,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-10-03 02:39:33,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-10-03 02:39:33,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-03 02:39:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 920 transitions. [2019-10-03 02:39:33,928 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 920 transitions. Word has length 143 [2019-10-03 02:39:33,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:33,928 INFO L475 AbstractCegarLoop]: Abstraction has 595 states and 920 transitions. [2019-10-03 02:39:33,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:33,928 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 920 transitions. [2019-10-03 02:39:33,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 02:39:33,932 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:33,933 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:33,933 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:33,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:33,933 INFO L82 PathProgramCache]: Analyzing trace with hash -170078860, now seen corresponding path program 1 times [2019-10-03 02:39:33,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:33,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:33,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:33,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:33,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:34,067 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:34,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:34,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:39:34,067 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:34,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:39:34,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:39:34,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:39:34,069 INFO L87 Difference]: Start difference. First operand 595 states and 920 transitions. Second operand 7 states. [2019-10-03 02:39:34,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:34,201 INFO L93 Difference]: Finished difference Result 601 states and 927 transitions. [2019-10-03 02:39:34,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:39:34,202 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-03 02:39:34,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:34,209 INFO L225 Difference]: With dead ends: 601 [2019-10-03 02:39:34,209 INFO L226 Difference]: Without dead ends: 577 [2019-10-03 02:39:34,211 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:34,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-03 02:39:34,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 574. [2019-10-03 02:39:34,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-03 02:39:34,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 883 transitions. [2019-10-03 02:39:34,240 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 883 transitions. Word has length 143 [2019-10-03 02:39:34,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:34,241 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 883 transitions. [2019-10-03 02:39:34,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:39:34,241 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 883 transitions. [2019-10-03 02:39:34,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-03 02:39:34,248 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:34,249 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:34,249 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:34,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:34,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1904799623, now seen corresponding path program 1 times [2019-10-03 02:39:34,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:34,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:34,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:34,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:34,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:34,409 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:34,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:34,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:34,410 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:34,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:34,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:34,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:34,413 INFO L87 Difference]: Start difference. First operand 574 states and 883 transitions. Second operand 6 states. [2019-10-03 02:39:34,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:34,575 INFO L93 Difference]: Finished difference Result 577 states and 886 transitions. [2019-10-03 02:39:34,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:34,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-03 02:39:34,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:34,580 INFO L225 Difference]: With dead ends: 577 [2019-10-03 02:39:34,580 INFO L226 Difference]: Without dead ends: 574 [2019-10-03 02:39:34,581 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:34,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-03 02:39:34,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-10-03 02:39:34,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-03 02:39:34,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 882 transitions. [2019-10-03 02:39:34,604 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 882 transitions. Word has length 144 [2019-10-03 02:39:34,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:34,604 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 882 transitions. [2019-10-03 02:39:34,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:34,604 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 882 transitions. [2019-10-03 02:39:34,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-03 02:39:34,608 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:34,608 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:34,608 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:34,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:34,609 INFO L82 PathProgramCache]: Analyzing trace with hash -959612135, now seen corresponding path program 1 times [2019-10-03 02:39:34,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:34,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:34,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:34,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:34,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:34,735 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:34,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:34,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:39:34,736 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:34,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:39:34,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:39:34,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:39:34,739 INFO L87 Difference]: Start difference. First operand 574 states and 882 transitions. Second operand 6 states. [2019-10-03 02:39:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:34,886 INFO L93 Difference]: Finished difference Result 577 states and 885 transitions. [2019-10-03 02:39:34,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 02:39:34,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-03 02:39:34,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:34,892 INFO L225 Difference]: With dead ends: 577 [2019-10-03 02:39:34,893 INFO L226 Difference]: Without dead ends: 574 [2019-10-03 02:39:34,893 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:34,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-03 02:39:34,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-10-03 02:39:34,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-03 02:39:34,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 881 transitions. [2019-10-03 02:39:34,917 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 881 transitions. Word has length 145 [2019-10-03 02:39:34,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:34,918 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 881 transitions. [2019-10-03 02:39:34,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:39:34,919 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 881 transitions. [2019-10-03 02:39:34,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-03 02:39:34,923 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:34,924 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:34,924 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:34,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:34,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1451023870, now seen corresponding path program 1 times [2019-10-03 02:39:34,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:34,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:34,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:34,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:34,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:35,113 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:35,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:39:35,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-03 02:39:35,114 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:35,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:39:35,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:39:35,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-03 02:39:35,116 INFO L87 Difference]: Start difference. First operand 574 states and 881 transitions. Second operand 12 states. [2019-10-03 02:39:35,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:35,388 INFO L93 Difference]: Finished difference Result 583 states and 891 transitions. [2019-10-03 02:39:35,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:39:35,389 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-03 02:39:35,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:35,394 INFO L225 Difference]: With dead ends: 583 [2019-10-03 02:39:35,394 INFO L226 Difference]: Without dead ends: 581 [2019-10-03 02:39:35,395 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:35,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-10-03 02:39:35,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 579. [2019-10-03 02:39:35,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-03 02:39:35,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 887 transitions. [2019-10-03 02:39:35,418 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 887 transitions. Word has length 146 [2019-10-03 02:39:35,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:35,418 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 887 transitions. [2019-10-03 02:39:35,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:39:35,418 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 887 transitions. [2019-10-03 02:39:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-03 02:39:35,422 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:39:35,423 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:35,423 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:39:35,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:35,423 INFO L82 PathProgramCache]: Analyzing trace with hash 457980586, now seen corresponding path program 1 times [2019-10-03 02:39:35,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:39:35,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:35,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:39:35,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:39:35,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:39:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:39:35,660 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:35,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:39:35,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:39:35,664 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 148 with the following transitions: [2019-10-03 02:39:35,668 INFO L207 CegarAbsIntRunner]: [57], [58], [315], [319], [322], [338], [340], [342], [393], [394], [396], [397], [398], [400], [403], [405], [409], [537], [539], [636], [641], [644], [647], [711], [712], [713], [718], [751], [752], [818], [820], [823], [825], [831], [835], [838], [874], [877], [882], [887], [892], [897], [902], [905], [1021], [1024], [1025], [1074], [1079], [1082], [1101], [1286], [1290], [1294], [1298], [1302], [1306], [1309], [1311], [1312], [1325], [1328], [1334], [1338], [1354], [1356], [1359], [1361], [1363], [1368], [1370], [1373], [1479], [1480], [2163], [2167], [2170], [2188], [2357], [2358], [2359], [2360], [2361], [2362], [2363], [2364], [2365], [2375], [2376], [2377], [2378], [2403], [2404], [2405], [2406], [2407], [2408], [2415], [2416], [2417], [2445], [2446], [2475], [2476], [2477], [2478], [2489], [2509], [2510], [2511], [2512], [2517], [2518], [2519], [2545], [2551], [2552], [2553], [2554], [2555], [2556], [2557], [2558], [2559], [2611], [2612], [2613] [2019-10-03 02:39:35,738 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:39:35,738 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:39:35,840 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:39:35,842 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:35,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:39:35,847 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:39:35,908 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:39:35,909 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:39:35,913 INFO L420 sIntCurrentIteration]: We unified 146 AI predicates to 146 [2019-10-03 02:39:35,913 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:39:35,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:39:35,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [10] total 10 [2019-10-03 02:39:35,915 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:39:35,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:39:35,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:39:35,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:39:35,916 INFO L87 Difference]: Start difference. First operand 579 states and 887 transitions. Second operand 2 states. [2019-10-03 02:39:35,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:39:35,916 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:39:35,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:39:35,916 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 147 [2019-10-03 02:39:35,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:39:35,917 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:39:35,917 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:39:35,917 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:35,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:39:35,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:39:35,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:39:35,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:39:35,918 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 147 [2019-10-03 02:39:35,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:39:35,919 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:39:35,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:39:35,919 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:39:35,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:39:35,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:39:35 BoogieIcfgContainer [2019-10-03 02:39:35,925 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:39:35,927 INFO L168 Benchmark]: Toolchain (without parser) took 10556.84 ms. Allocated memory was 133.2 MB in the beginning and 483.9 MB in the end (delta: 350.7 MB). Free memory was 85.8 MB in the beginning and 403.9 MB in the end (delta: -318.2 MB). Peak memory consumption was 32.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:35,928 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 133.2 MB. Free memory was 107.3 MB in the beginning and 107.1 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:35,929 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1053.09 ms. Allocated memory was 133.2 MB in the beginning and 199.8 MB in the end (delta: 66.6 MB). Free memory was 85.6 MB in the beginning and 137.0 MB in the end (delta: -51.5 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:35,930 INFO L168 Benchmark]: Boogie Preprocessor took 234.56 ms. Allocated memory is still 199.8 MB. Free memory was 137.0 MB in the beginning and 127.7 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:35,931 INFO L168 Benchmark]: RCFGBuilder took 2424.47 ms. Allocated memory was 199.8 MB in the beginning and 264.8 MB in the end (delta: 65.0 MB). Free memory was 127.7 MB in the beginning and 151.5 MB in the end (delta: -23.8 MB). Peak memory consumption was 90.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:39:35,932 INFO L168 Benchmark]: TraceAbstraction took 6840.25 ms. Allocated memory was 264.8 MB in the beginning and 483.9 MB in the end (delta: 219.2 MB). Free memory was 151.5 MB in the beginning and 403.9 MB in the end (delta: -252.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-10-03 02:39:35,936 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.24 ms. Allocated memory is still 133.2 MB. Free memory was 107.3 MB in the beginning and 107.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1053.09 ms. Allocated memory was 133.2 MB in the beginning and 199.8 MB in the end (delta: 66.6 MB). Free memory was 85.6 MB in the beginning and 137.0 MB in the end (delta: -51.5 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 234.56 ms. Allocated memory is still 199.8 MB. Free memory was 137.0 MB in the beginning and 127.7 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2424.47 ms. Allocated memory was 199.8 MB in the beginning and 264.8 MB in the end (delta: 65.0 MB). Free memory was 127.7 MB in the beginning and 151.5 MB in the end (delta: -23.8 MB). Peak memory consumption was 90.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6840.25 ms. Allocated memory was 264.8 MB in the beginning and 483.9 MB in the end (delta: 219.2 MB). Free memory was 151.5 MB in the beginning and 403.9 MB in the end (delta: -252.4 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2257]: 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 75 procedures, 878 locations, 1 error locations. SAFE Result, 6.7s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 2.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12396 SDtfs, 538 SDslu, 47792 SDs, 0 SdLazy, 1689 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s 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=735occurred 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.6712328767123288 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 10 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.5s 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...