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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product19.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:10:31,317 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:10:31,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:10:31,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:10:31,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:10:31,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:10:31,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:10:31,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:10:31,361 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:10:31,364 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:10:31,365 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:10:31,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:10:31,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:10:31,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:10:31,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:10:31,373 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:10:31,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:10:31,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:10:31,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:10:31,382 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:10:31,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:10:31,391 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:10:31,393 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:10:31,394 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:10:31,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:10:31,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:10:31,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:10:31,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:10:31,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:10:31,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:10:31,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:10:31,402 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:10:31,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:10:31,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:10:31,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:10:31,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:10:31,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:10:31,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:10:31,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:10:31,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:10:31,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:10:31,410 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:10:31,447 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:10:31,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:10:31,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:10:31,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:10:31,452 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:10:31,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:10:31,452 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:10:31,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:10:31,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:10:31,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:10:31,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:10:31,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:10:31,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:10:31,454 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:10:31,454 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:10:31,456 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:10:31,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:10:31,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:10:31,457 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:10:31,457 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:10:31,457 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:10:31,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:10:31,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:10:31,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:10:31,458 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:10:31,458 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:10:31,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:10:31,458 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:10:31,459 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:10:31,773 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:10:31,794 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:10:31,797 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:10:31,799 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:10:31,799 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:10:31,800 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product19.cil.c [2019-10-13 21:10:31,879 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae2e5a57c/1dfb6c8a6adf40668c8d396d5a9ef37c/FLAGd4a2460cf [2019-10-13 21:10:32,631 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:10:32,632 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product19.cil.c [2019-10-13 21:10:32,656 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae2e5a57c/1dfb6c8a6adf40668c8d396d5a9ef37c/FLAGd4a2460cf [2019-10-13 21:10:32,774 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae2e5a57c/1dfb6c8a6adf40668c8d396d5a9ef37c [2019-10-13 21:10:32,785 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:10:32,787 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:10:32,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:10:32,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:10:32,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:10:32,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:32" (1/1) ... [2019-10-13 21:10:32,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c301fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:32, skipping insertion in model container [2019-10-13 21:10:32,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:32" (1/1) ... [2019-10-13 21:10:32,809 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:10:32,899 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:10:33,685 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:10:33,714 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:10:33,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:10:33,916 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:10:33,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:33 WrapperNode [2019-10-13 21:10:33,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:10:33,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:10:33,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:10:33,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:10:33,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:33" (1/1) ... [2019-10-13 21:10:33,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:33" (1/1) ... [2019-10-13 21:10:33,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:33" (1/1) ... [2019-10-13 21:10:33,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:33" (1/1) ... [2019-10-13 21:10:34,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:33" (1/1) ... [2019-10-13 21:10:34,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:33" (1/1) ... [2019-10-13 21:10:34,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:33" (1/1) ... [2019-10-13 21:10:34,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:10:34,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:10:34,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:10:34,122 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:10:34,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:33" (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-13 21:10:34,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:10:34,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:10:34,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:10:34,217 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:10:34,217 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:10:34,218 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:10:34,219 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-13 21:10:34,219 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:10:34,220 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:10:34,220 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:10:34,221 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:10:34,221 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:10:34,221 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:10:34,222 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:10:34,222 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:10:34,223 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:10:34,225 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:10:34,225 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:10:34,225 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:10:34,227 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-13 21:10:34,227 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:10:34,228 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:10:34,228 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:10:34,228 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-13 21:10:34,228 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:10:34,229 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:10:34,229 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:10:34,229 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:10:34,229 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:10:34,229 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:10:34,230 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-13 21:10:34,230 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-13 21:10:34,230 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:10:34,230 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:10:34,230 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:10:34,230 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:10:34,231 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:10:34,231 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:10:34,231 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:10:34,231 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:10:34,231 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:10:34,232 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:10:34,232 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:10:34,232 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:10:34,232 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:10:34,232 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:10:34,232 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:10:34,233 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:10:34,233 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:10:34,233 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:10:34,233 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:10:34,233 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:10:34,234 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:10:34,234 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:10:34,234 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:10:34,234 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:10:34,234 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:10:34,235 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:10:34,235 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:10:34,236 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:10:34,236 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:10:34,236 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:10:34,237 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:10:34,237 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:10:34,237 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:10:34,238 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:10:34,238 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:10:34,238 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:10:34,238 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:10:34,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:10:34,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:10:34,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:10:34,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:10:34,240 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:10:34,241 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:10:34,241 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:10:34,241 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:10:34,241 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:10:34,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:10:34,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:10:34,243 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:10:34,243 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:10:34,243 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:10:34,243 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:10:34,244 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:10:34,245 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:10:34,245 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:10:34,246 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:10:34,246 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:10:34,246 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:10:34,246 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:10:34,246 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:10:34,247 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:10:34,247 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:10:34,247 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:10:34,247 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:10:34,247 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:10:34,247 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:10:34,248 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:10:34,248 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:10:34,248 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:10:34,248 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-13 21:10:34,248 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-13 21:10:34,248 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-13 21:10:34,249 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:10:34,249 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:10:34,249 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:10:34,249 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:10:34,249 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:10:34,250 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:10:34,250 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:10:34,250 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-13 21:10:34,250 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:10:34,251 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:10:34,251 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-13 21:10:34,252 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:10:34,252 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:10:34,252 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:10:34,252 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:10:34,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:10:34,253 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:10:34,254 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:10:34,254 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:10:34,254 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:10:34,259 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:10:34,260 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:10:34,260 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:10:34,260 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:10:34,260 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:10:34,261 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:10:34,261 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:10:34,261 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:10:34,262 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:10:34,262 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:10:34,262 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:10:34,263 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:10:34,263 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:10:34,268 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:10:34,268 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:10:34,268 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:10:34,269 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:10:34,270 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:10:34,270 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:10:34,271 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:10:34,277 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:10:34,277 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:10:34,278 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:10:34,278 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:10:34,278 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:10:34,278 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:10:34,278 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:10:34,278 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:10:34,279 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:10:34,279 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:10:34,279 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:10:34,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:10:34,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:10:34,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:10:34,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:10:34,281 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:10:34,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:10:34,282 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:10:34,282 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:10:34,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:10:34,282 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:10:34,283 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:10:34,283 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:10:34,283 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:10:34,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:10:34,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:10:34,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:10:36,961 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:10:36,961 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:10:36,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:10:36 BoogieIcfgContainer [2019-10-13 21:10:36,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:10:36,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:10:36,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:10:36,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:10:36,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:10:32" (1/3) ... [2019-10-13 21:10:36,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b1213f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:10:36, skipping insertion in model container [2019-10-13 21:10:36,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:33" (2/3) ... [2019-10-13 21:10:36,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16b1213f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:10:36, skipping insertion in model container [2019-10-13 21:10:36,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:10:36" (3/3) ... [2019-10-13 21:10:36,974 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product19.cil.c [2019-10-13 21:10:36,985 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:10:36,996 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:10:37,009 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:10:37,060 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:10:37,060 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:10:37,061 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:10:37,061 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:10:37,061 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:10:37,061 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:10:37,061 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:10:37,061 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:10:37,110 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states. [2019-10-13 21:10:37,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-13 21:10:37,138 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:37,140 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:37,142 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:37,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:37,149 INFO L82 PathProgramCache]: Analyzing trace with hash 707688551, now seen corresponding path program 1 times [2019-10-13 21:10:37,159 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:37,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475234305] [2019-10-13 21:10:37,160 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:37,160 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:37,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:37,863 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:37,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475234305] [2019-10-13 21:10:37,865 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:37,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:37,866 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672783778] [2019-10-13 21:10:37,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:37,873 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:37,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:37,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:37,892 INFO L87 Difference]: Start difference. First operand 770 states. Second operand 4 states. [2019-10-13 21:10:38,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:38,125 INFO L93 Difference]: Finished difference Result 1203 states and 1943 transitions. [2019-10-13 21:10:38,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:38,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-10-13 21:10:38,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:38,152 INFO L225 Difference]: With dead ends: 1203 [2019-10-13 21:10:38,152 INFO L226 Difference]: Without dead ends: 610 [2019-10-13 21:10:38,163 INFO L600 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-13 21:10:38,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-10-13 21:10:38,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2019-10-13 21:10:38,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-13 21:10:38,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 973 transitions. [2019-10-13 21:10:38,267 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 973 transitions. Word has length 133 [2019-10-13 21:10:38,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:38,268 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 973 transitions. [2019-10-13 21:10:38,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:38,268 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 973 transitions. [2019-10-13 21:10:38,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-13 21:10:38,277 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:38,277 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:38,278 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:38,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:38,278 INFO L82 PathProgramCache]: Analyzing trace with hash -373174512, now seen corresponding path program 1 times [2019-10-13 21:10:38,278 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:38,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311010803] [2019-10-13 21:10:38,279 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:38,279 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:38,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:38,504 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311010803] [2019-10-13 21:10:38,505 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:38,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:38,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961311804] [2019-10-13 21:10:38,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:38,511 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:38,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:38,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:38,511 INFO L87 Difference]: Start difference. First operand 610 states and 973 transitions. Second operand 4 states. [2019-10-13 21:10:38,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:38,617 INFO L93 Difference]: Finished difference Result 1183 states and 1904 transitions. [2019-10-13 21:10:38,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:38,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-13 21:10:38,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:38,625 INFO L225 Difference]: With dead ends: 1183 [2019-10-13 21:10:38,626 INFO L226 Difference]: Without dead ends: 610 [2019-10-13 21:10:38,636 INFO L600 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-13 21:10:38,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-10-13 21:10:38,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2019-10-13 21:10:38,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-13 21:10:38,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 972 transitions. [2019-10-13 21:10:38,693 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 972 transitions. Word has length 136 [2019-10-13 21:10:38,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:38,695 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 972 transitions. [2019-10-13 21:10:38,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:38,698 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 972 transitions. [2019-10-13 21:10:38,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-13 21:10:38,709 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:38,709 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:38,709 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:38,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:38,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1239600746, now seen corresponding path program 1 times [2019-10-13 21:10:38,711 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:38,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806129188] [2019-10-13 21:10:38,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:38,712 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:38,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:38,976 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:38,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806129188] [2019-10-13 21:10:38,977 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:38,977 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:38,977 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224539189] [2019-10-13 21:10:38,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:38,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:38,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:38,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:38,981 INFO L87 Difference]: Start difference. First operand 610 states and 972 transitions. Second operand 4 states. [2019-10-13 21:10:39,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:39,040 INFO L93 Difference]: Finished difference Result 1183 states and 1903 transitions. [2019-10-13 21:10:39,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:39,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-13 21:10:39,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:39,045 INFO L225 Difference]: With dead ends: 1183 [2019-10-13 21:10:39,045 INFO L226 Difference]: Without dead ends: 610 [2019-10-13 21:10:39,048 INFO L600 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-13 21:10:39,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-10-13 21:10:39,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2019-10-13 21:10:39,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-13 21:10:39,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 971 transitions. [2019-10-13 21:10:39,075 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 971 transitions. Word has length 137 [2019-10-13 21:10:39,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:39,075 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 971 transitions. [2019-10-13 21:10:39,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:39,075 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 971 transitions. [2019-10-13 21:10:39,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-13 21:10:39,080 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:39,080 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:39,080 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:39,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:39,081 INFO L82 PathProgramCache]: Analyzing trace with hash 449577804, now seen corresponding path program 1 times [2019-10-13 21:10:39,081 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:39,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969905394] [2019-10-13 21:10:39,081 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:39,081 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:39,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:39,228 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:39,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969905394] [2019-10-13 21:10:39,229 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:39,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:39,229 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394768817] [2019-10-13 21:10:39,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:39,231 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:39,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:39,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:39,232 INFO L87 Difference]: Start difference. First operand 610 states and 971 transitions. Second operand 4 states. [2019-10-13 21:10:39,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:39,312 INFO L93 Difference]: Finished difference Result 1183 states and 1902 transitions. [2019-10-13 21:10:39,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:39,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-13 21:10:39,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:39,321 INFO L225 Difference]: With dead ends: 1183 [2019-10-13 21:10:39,321 INFO L226 Difference]: Without dead ends: 610 [2019-10-13 21:10:39,325 INFO L600 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-13 21:10:39,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-10-13 21:10:39,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2019-10-13 21:10:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-13 21:10:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 970 transitions. [2019-10-13 21:10:39,356 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 970 transitions. Word has length 138 [2019-10-13 21:10:39,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:39,357 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 970 transitions. [2019-10-13 21:10:39,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:39,358 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 970 transitions. [2019-10-13 21:10:39,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-13 21:10:39,364 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:39,364 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:39,364 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:39,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:39,365 INFO L82 PathProgramCache]: Analyzing trace with hash -241873966, now seen corresponding path program 1 times [2019-10-13 21:10:39,365 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:39,366 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020735598] [2019-10-13 21:10:39,366 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:39,366 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:39,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:39,517 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:39,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020735598] [2019-10-13 21:10:39,518 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:39,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:39,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104588514] [2019-10-13 21:10:39,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:39,570 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:39,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:39,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:39,573 INFO L87 Difference]: Start difference. First operand 610 states and 970 transitions. Second operand 4 states. [2019-10-13 21:10:39,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:39,645 INFO L93 Difference]: Finished difference Result 1183 states and 1901 transitions. [2019-10-13 21:10:39,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:39,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-13 21:10:39,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:39,657 INFO L225 Difference]: With dead ends: 1183 [2019-10-13 21:10:39,657 INFO L226 Difference]: Without dead ends: 610 [2019-10-13 21:10:39,662 INFO L600 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-13 21:10:39,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-10-13 21:10:39,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2019-10-13 21:10:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-13 21:10:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 969 transitions. [2019-10-13 21:10:39,693 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 969 transitions. Word has length 139 [2019-10-13 21:10:39,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:39,694 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 969 transitions. [2019-10-13 21:10:39,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:39,694 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 969 transitions. [2019-10-13 21:10:39,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:10:39,698 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:39,699 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:39,699 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:39,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:39,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1718421624, now seen corresponding path program 1 times [2019-10-13 21:10:39,701 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:39,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076544284] [2019-10-13 21:10:39,702 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:39,702 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:39,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:39,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076544284] [2019-10-13 21:10:39,933 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:39,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:10:39,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969150828] [2019-10-13 21:10:39,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:10:39,935 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:39,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:10:39,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:10:39,936 INFO L87 Difference]: Start difference. First operand 610 states and 969 transitions. Second operand 10 states. [2019-10-13 21:10:40,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:40,129 INFO L93 Difference]: Finished difference Result 1141 states and 1821 transitions. [2019-10-13 21:10:40,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:10:40,130 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-13 21:10:40,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:40,139 INFO L225 Difference]: With dead ends: 1141 [2019-10-13 21:10:40,139 INFO L226 Difference]: Without dead ends: 619 [2019-10-13 21:10:40,143 INFO L600 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-13 21:10:40,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-10-13 21:10:40,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 617. [2019-10-13 21:10:40,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-10-13 21:10:40,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 978 transitions. [2019-10-13 21:10:40,181 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 978 transitions. Word has length 140 [2019-10-13 21:10:40,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:40,182 INFO L462 AbstractCegarLoop]: Abstraction has 617 states and 978 transitions. [2019-10-13 21:10:40,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:10:40,182 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 978 transitions. [2019-10-13 21:10:40,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:10:40,186 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:40,187 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:40,187 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:40,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:40,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1023774617, now seen corresponding path program 1 times [2019-10-13 21:10:40,188 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:40,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765328739] [2019-10-13 21:10:40,188 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,188 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:40,316 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:40,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765328739] [2019-10-13 21:10:40,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:40,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:40,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16935379] [2019-10-13 21:10:40,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:40,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:40,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:40,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:40,319 INFO L87 Difference]: Start difference. First operand 617 states and 978 transitions. Second operand 4 states. [2019-10-13 21:10:40,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:40,380 INFO L93 Difference]: Finished difference Result 1189 states and 1907 transitions. [2019-10-13 21:10:40,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:40,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-13 21:10:40,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:40,387 INFO L225 Difference]: With dead ends: 1189 [2019-10-13 21:10:40,388 INFO L226 Difference]: Without dead ends: 604 [2019-10-13 21:10:40,393 INFO L600 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-13 21:10:40,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-10-13 21:10:40,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-10-13 21:10:40,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-10-13 21:10:40,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 955 transitions. [2019-10-13 21:10:40,484 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 955 transitions. Word has length 140 [2019-10-13 21:10:40,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:40,485 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 955 transitions. [2019-10-13 21:10:40,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:40,485 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 955 transitions. [2019-10-13 21:10:40,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 21:10:40,489 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:40,490 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:40,490 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:40,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:40,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1404962230, now seen corresponding path program 1 times [2019-10-13 21:10:40,491 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:40,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16503771] [2019-10-13 21:10:40,492 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,492 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:40,650 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:40,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16503771] [2019-10-13 21:10:40,650 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:40,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:40,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401960403] [2019-10-13 21:10:40,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:40,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:40,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:40,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:40,652 INFO L87 Difference]: Start difference. First operand 604 states and 955 transitions. Second operand 6 states. [2019-10-13 21:10:40,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:40,863 INFO L93 Difference]: Finished difference Result 1129 states and 1799 transitions. [2019-10-13 21:10:40,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:40,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-13 21:10:40,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:40,870 INFO L225 Difference]: With dead ends: 1129 [2019-10-13 21:10:40,870 INFO L226 Difference]: Without dead ends: 604 [2019-10-13 21:10:40,873 INFO L600 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-13 21:10:40,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-10-13 21:10:40,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-10-13 21:10:40,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-10-13 21:10:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 951 transitions. [2019-10-13 21:10:40,899 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 951 transitions. Word has length 141 [2019-10-13 21:10:40,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:40,899 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 951 transitions. [2019-10-13 21:10:40,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:40,899 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 951 transitions. [2019-10-13 21:10:40,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:10:40,904 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:40,904 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:40,904 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:40,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:40,905 INFO L82 PathProgramCache]: Analyzing trace with hash -917771221, now seen corresponding path program 1 times [2019-10-13 21:10:40,905 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:40,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748247737] [2019-10-13 21:10:40,905 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,905 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:41,057 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:41,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748247737] [2019-10-13 21:10:41,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:41,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:41,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329288308] [2019-10-13 21:10:41,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:41,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:41,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:41,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:41,059 INFO L87 Difference]: Start difference. First operand 604 states and 951 transitions. Second operand 6 states. [2019-10-13 21:10:41,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:41,281 INFO L93 Difference]: Finished difference Result 1129 states and 1795 transitions. [2019-10-13 21:10:41,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:41,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-13 21:10:41,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:41,286 INFO L225 Difference]: With dead ends: 1129 [2019-10-13 21:10:41,287 INFO L226 Difference]: Without dead ends: 604 [2019-10-13 21:10:41,290 INFO L600 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-13 21:10:41,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-10-13 21:10:41,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-10-13 21:10:41,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-10-13 21:10:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 947 transitions. [2019-10-13 21:10:41,327 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 947 transitions. Word has length 142 [2019-10-13 21:10:41,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:41,327 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 947 transitions. [2019-10-13 21:10:41,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:41,328 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 947 transitions. [2019-10-13 21:10:41,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:10:41,332 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:41,333 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:41,333 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:41,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:41,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1007958639, now seen corresponding path program 1 times [2019-10-13 21:10:41,334 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:41,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436541742] [2019-10-13 21:10:41,334 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:41,334 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:41,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:41,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436541742] [2019-10-13 21:10:41,535 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:41,536 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:41,536 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652901247] [2019-10-13 21:10:41,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:41,537 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:41,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:41,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:41,537 INFO L87 Difference]: Start difference. First operand 604 states and 947 transitions. Second operand 6 states. [2019-10-13 21:10:41,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:41,731 INFO L93 Difference]: Finished difference Result 1129 states and 1791 transitions. [2019-10-13 21:10:41,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:41,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-13 21:10:41,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:41,737 INFO L225 Difference]: With dead ends: 1129 [2019-10-13 21:10:41,737 INFO L226 Difference]: Without dead ends: 604 [2019-10-13 21:10:41,741 INFO L600 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-13 21:10:41,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-10-13 21:10:41,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-10-13 21:10:41,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-10-13 21:10:41,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 943 transitions. [2019-10-13 21:10:41,765 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 943 transitions. Word has length 143 [2019-10-13 21:10:41,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:41,766 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 943 transitions. [2019-10-13 21:10:41,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:41,766 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 943 transitions. [2019-10-13 21:10:41,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:10:41,770 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:41,771 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:41,771 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:41,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:41,771 INFO L82 PathProgramCache]: Analyzing trace with hash 2062431983, now seen corresponding path program 1 times [2019-10-13 21:10:41,772 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:41,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247718703] [2019-10-13 21:10:41,772 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:41,772 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:41,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:41,915 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:41,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247718703] [2019-10-13 21:10:41,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:41,916 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:10:41,916 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803428012] [2019-10-13 21:10:41,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:10:41,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:41,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:10:41,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:10:41,918 INFO L87 Difference]: Start difference. First operand 604 states and 943 transitions. Second operand 7 states. [2019-10-13 21:10:42,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:42,004 INFO L93 Difference]: Finished difference Result 1129 states and 1787 transitions. [2019-10-13 21:10:42,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:10:42,005 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-13 21:10:42,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:42,010 INFO L225 Difference]: With dead ends: 1129 [2019-10-13 21:10:42,010 INFO L226 Difference]: Without dead ends: 583 [2019-10-13 21:10:42,013 INFO L600 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-13 21:10:42,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-13 21:10:42,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-13 21:10:42,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-13 21:10:42,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 909 transitions. [2019-10-13 21:10:42,032 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 909 transitions. Word has length 143 [2019-10-13 21:10:42,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:42,033 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 909 transitions. [2019-10-13 21:10:42,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:10:42,033 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 909 transitions. [2019-10-13 21:10:42,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 21:10:42,037 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:42,037 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:42,038 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:42,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:42,038 INFO L82 PathProgramCache]: Analyzing trace with hash 283752624, now seen corresponding path program 1 times [2019-10-13 21:10:42,038 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:42,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272723493] [2019-10-13 21:10:42,039 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:42,039 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:42,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:42,172 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:42,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272723493] [2019-10-13 21:10:42,173 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:42,173 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:42,173 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473986153] [2019-10-13 21:10:42,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:42,174 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:42,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:42,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:42,175 INFO L87 Difference]: Start difference. First operand 583 states and 909 transitions. Second operand 6 states. [2019-10-13 21:10:42,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:42,277 INFO L93 Difference]: Finished difference Result 1108 states and 1753 transitions. [2019-10-13 21:10:42,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:42,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-13 21:10:42,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:42,282 INFO L225 Difference]: With dead ends: 1108 [2019-10-13 21:10:42,282 INFO L226 Difference]: Without dead ends: 583 [2019-10-13 21:10:42,285 INFO L600 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-13 21:10:42,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-13 21:10:42,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-13 21:10:42,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-13 21:10:42,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 908 transitions. [2019-10-13 21:10:42,304 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 908 transitions. Word has length 144 [2019-10-13 21:10:42,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:42,305 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 908 transitions. [2019-10-13 21:10:42,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:42,305 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 908 transitions. [2019-10-13 21:10:42,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:10:42,309 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:42,309 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:42,309 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:42,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:42,310 INFO L82 PathProgramCache]: Analyzing trace with hash -984086892, now seen corresponding path program 1 times [2019-10-13 21:10:42,310 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:42,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079181835] [2019-10-13 21:10:42,310 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:42,311 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:42,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:42,461 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:42,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079181835] [2019-10-13 21:10:42,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:42,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:42,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083074091] [2019-10-13 21:10:42,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:42,463 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:42,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:42,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:42,465 INFO L87 Difference]: Start difference. First operand 583 states and 908 transitions. Second operand 6 states. [2019-10-13 21:10:42,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:42,559 INFO L93 Difference]: Finished difference Result 1108 states and 1752 transitions. [2019-10-13 21:10:42,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:42,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-13 21:10:42,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:42,564 INFO L225 Difference]: With dead ends: 1108 [2019-10-13 21:10:42,565 INFO L226 Difference]: Without dead ends: 583 [2019-10-13 21:10:42,567 INFO L600 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-13 21:10:42,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-13 21:10:42,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-13 21:10:42,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-13 21:10:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 907 transitions. [2019-10-13 21:10:42,587 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 907 transitions. Word has length 145 [2019-10-13 21:10:42,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:42,587 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 907 transitions. [2019-10-13 21:10:42,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:42,588 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 907 transitions. [2019-10-13 21:10:42,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-13 21:10:42,592 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:42,592 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:42,592 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:42,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:42,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1924695755, now seen corresponding path program 1 times [2019-10-13 21:10:42,593 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:42,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668733503] [2019-10-13 21:10:42,593 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:42,594 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:42,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:42,806 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-13 21:10:42,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668733503] [2019-10-13 21:10:42,807 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:42,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:10:42,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80863889] [2019-10-13 21:10:42,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:10:42,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:42,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:10:42,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:10:42,810 INFO L87 Difference]: Start difference. First operand 583 states and 907 transitions. Second operand 12 states. [2019-10-13 21:10:43,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:43,055 INFO L93 Difference]: Finished difference Result 1109 states and 1751 transitions. [2019-10-13 21:10:43,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:10:43,055 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-13 21:10:43,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:43,061 INFO L225 Difference]: With dead ends: 1109 [2019-10-13 21:10:43,061 INFO L226 Difference]: Without dead ends: 583 [2019-10-13 21:10:43,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:10:43,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-13 21:10:43,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-13 21:10:43,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-13 21:10:43,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 906 transitions. [2019-10-13 21:10:43,093 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 906 transitions. Word has length 146 [2019-10-13 21:10:43,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:43,094 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 906 transitions. [2019-10-13 21:10:43,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:10:43,095 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 906 transitions. [2019-10-13 21:10:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:10:43,102 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:43,102 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:43,102 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:43,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:43,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1180012259, now seen corresponding path program 1 times [2019-10-13 21:10:43,103 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:43,104 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833304760] [2019-10-13 21:10:43,104 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:43,104 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:43,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:43,396 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-13 21:10:43,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833304760] [2019-10-13 21:10:43,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555867406] [2019-10-13 21:10:43,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:44,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 2771 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:10:44,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:10:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:10:44,156 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:10:44,961 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:10:44,962 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:10:44,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 6] total 18 [2019-10-13 21:10:44,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611379613] [2019-10-13 21:10:44,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:10:44,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:44,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:10:44,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:10:44,964 INFO L87 Difference]: Start difference. First operand 583 states and 906 transitions. Second operand 5 states. [2019-10-13 21:10:45,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:45,926 INFO L93 Difference]: Finished difference Result 1108 states and 1776 transitions. [2019-10-13 21:10:45,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:45,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-13 21:10:45,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:45,931 INFO L225 Difference]: With dead ends: 1108 [2019-10-13 21:10:45,931 INFO L226 Difference]: Without dead ends: 591 [2019-10-13 21:10:45,940 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 293 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:10:45,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-13 21:10:45,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-10-13 21:10:45,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-10-13 21:10:45,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 919 transitions. [2019-10-13 21:10:45,973 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 919 transitions. Word has length 147 [2019-10-13 21:10:45,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:45,973 INFO L462 AbstractCegarLoop]: Abstraction has 591 states and 919 transitions. [2019-10-13 21:10:45,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:10:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 919 transitions. [2019-10-13 21:10:45,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-13 21:10:45,978 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:45,979 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:46,194 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:46,195 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:46,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:46,195 INFO L82 PathProgramCache]: Analyzing trace with hash -407821049, now seen corresponding path program 1 times [2019-10-13 21:10:46,195 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:46,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792020347] [2019-10-13 21:10:46,195 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:46,196 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:46,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:46,417 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:10:46,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792020347] [2019-10-13 21:10:46,418 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:46,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:46,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316029307] [2019-10-13 21:10:46,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:46,419 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:46,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:46,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:46,420 INFO L87 Difference]: Start difference. First operand 591 states and 919 transitions. Second operand 6 states. [2019-10-13 21:10:47,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:47,154 INFO L93 Difference]: Finished difference Result 1123 states and 1800 transitions. [2019-10-13 21:10:47,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:47,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2019-10-13 21:10:47,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:47,160 INFO L225 Difference]: With dead ends: 1123 [2019-10-13 21:10:47,160 INFO L226 Difference]: Without dead ends: 596 [2019-10-13 21:10:47,163 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:10:47,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-13 21:10:47,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-13 21:10:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-13 21:10:47,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 923 transitions. [2019-10-13 21:10:47,192 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 923 transitions. Word has length 149 [2019-10-13 21:10:47,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:47,192 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 923 transitions. [2019-10-13 21:10:47,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:47,193 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 923 transitions. [2019-10-13 21:10:47,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-13 21:10:47,197 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:47,197 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:47,197 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:47,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:47,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1564587875, now seen corresponding path program 1 times [2019-10-13 21:10:47,198 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:47,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217729095] [2019-10-13 21:10:47,199 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:47,199 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:47,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:47,434 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 21:10:47,435 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217729095] [2019-10-13 21:10:47,435 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596841304] [2019-10-13 21:10:47,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:48,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 2775 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:10:48,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:10:48,301 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:10:48,301 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:10:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:10:48,980 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:10:48,981 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 6] total 18 [2019-10-13 21:10:48,981 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562263307] [2019-10-13 21:10:48,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:10:48,982 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:48,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:10:48,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:10:48,983 INFO L87 Difference]: Start difference. First operand 596 states and 923 transitions. Second operand 5 states. [2019-10-13 21:10:49,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:49,912 INFO L93 Difference]: Finished difference Result 1134 states and 1804 transitions. [2019-10-13 21:10:49,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:49,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-10-13 21:10:49,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:49,918 INFO L225 Difference]: With dead ends: 1134 [2019-10-13 21:10:49,918 INFO L226 Difference]: Without dead ends: 604 [2019-10-13 21:10:49,920 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 301 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:10:49,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-10-13 21:10:49,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-10-13 21:10:49,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-10-13 21:10:49,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 936 transitions. [2019-10-13 21:10:49,944 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 936 transitions. Word has length 151 [2019-10-13 21:10:49,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:49,944 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 936 transitions. [2019-10-13 21:10:49,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:10:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 936 transitions. [2019-10-13 21:10:49,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:10:49,950 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:49,950 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:50,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:50,159 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:50,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:50,160 INFO L82 PathProgramCache]: Analyzing trace with hash 915558911, now seen corresponding path program 1 times [2019-10-13 21:10:50,161 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:50,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201045138] [2019-10-13 21:10:50,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:50,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:50,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:50,341 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-13 21:10:50,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201045138] [2019-10-13 21:10:50,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661313926] [2019-10-13 21:10:50,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:50,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 2777 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:10:50,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:10:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:10:50,939 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:10:51,697 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:10:51,697 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:10:51,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 6] total 17 [2019-10-13 21:10:51,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340317461] [2019-10-13 21:10:51,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:10:51,698 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:51,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:10:51,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:10:51,699 INFO L87 Difference]: Start difference. First operand 604 states and 936 transitions. Second operand 5 states. [2019-10-13 21:10:52,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:52,555 INFO L93 Difference]: Finished difference Result 1150 states and 1827 transitions. [2019-10-13 21:10:52,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:52,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-10-13 21:10:52,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:52,560 INFO L225 Difference]: With dead ends: 1150 [2019-10-13 21:10:52,561 INFO L226 Difference]: Without dead ends: 612 [2019-10-13 21:10:52,564 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 305 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:10:52,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-10-13 21:10:52,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-10-13 21:10:52,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-13 21:10:52,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 949 transitions. [2019-10-13 21:10:52,593 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 949 transitions. Word has length 153 [2019-10-13 21:10:52,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:52,594 INFO L462 AbstractCegarLoop]: Abstraction has 612 states and 949 transitions. [2019-10-13 21:10:52,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:10:52,594 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 949 transitions. [2019-10-13 21:10:52,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-13 21:10:52,598 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:52,598 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:52,798 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:52,799 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:52,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:52,800 INFO L82 PathProgramCache]: Analyzing trace with hash -2063753757, now seen corresponding path program 1 times [2019-10-13 21:10:52,800 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:52,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441361523] [2019-10-13 21:10:52,801 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:52,801 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:52,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 21:10:53,003 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441361523] [2019-10-13 21:10:53,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289764221] [2019-10-13 21:10:53,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:53,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 2779 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:10:53,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:10:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:10:53,695 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:10:53,988 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:10:53,988 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:10:53,988 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 6] imperfect sequences [11] total 18 [2019-10-13 21:10:53,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594883371] [2019-10-13 21:10:53,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:10:53,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:53,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:10:53,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:10:53,990 INFO L87 Difference]: Start difference. First operand 612 states and 949 transitions. Second operand 9 states. [2019-10-13 21:10:55,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:55,318 INFO L93 Difference]: Finished difference Result 657 states and 1009 transitions. [2019-10-13 21:10:55,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:10:55,318 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 155 [2019-10-13 21:10:55,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:55,324 INFO L225 Difference]: With dead ends: 657 [2019-10-13 21:10:55,324 INFO L226 Difference]: Without dead ends: 640 [2019-10-13 21:10:55,324 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 313 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-10-13 21:10:55,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-10-13 21:10:55,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 626. [2019-10-13 21:10:55,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-13 21:10:55,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 968 transitions. [2019-10-13 21:10:55,350 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 968 transitions. Word has length 155 [2019-10-13 21:10:55,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:55,351 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 968 transitions. [2019-10-13 21:10:55,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:10:55,351 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 968 transitions. [2019-10-13 21:10:55,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:10:55,355 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:55,356 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:55,563 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:55,564 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:55,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:55,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1623669378, now seen corresponding path program 1 times [2019-10-13 21:10:55,565 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:55,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869763854] [2019-10-13 21:10:55,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:55,566 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:55,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:55,771 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-13 21:10:55,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869763854] [2019-10-13 21:10:55,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6646897] [2019-10-13 21:10:55,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:56,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 2795 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 21:10:56,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:10:56,450 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:10:56,450 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:10:56,716 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:10:56,717 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:10:56,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [11] total 14 [2019-10-13 21:10:56,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846032240] [2019-10-13 21:10:56,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:10:56,718 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:56,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:10:56,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:10:56,718 INFO L87 Difference]: Start difference. First operand 626 states and 968 transitions. Second operand 5 states. [2019-10-13 21:10:56,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:56,770 INFO L93 Difference]: Finished difference Result 643 states and 988 transitions. [2019-10-13 21:10:56,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:56,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-10-13 21:10:56,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:56,777 INFO L225 Difference]: With dead ends: 643 [2019-10-13 21:10:56,777 INFO L226 Difference]: Without dead ends: 626 [2019-10-13 21:10:56,778 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 329 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-13 21:10:56,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-13 21:10:56,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-13 21:10:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-13 21:10:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 966 transitions. [2019-10-13 21:10:56,806 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 966 transitions. Word has length 161 [2019-10-13 21:10:56,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:56,807 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 966 transitions. [2019-10-13 21:10:56,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:10:56,807 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 966 transitions. [2019-10-13 21:10:56,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-13 21:10:56,812 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:56,812 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:57,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:57,019 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:57,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:57,020 INFO L82 PathProgramCache]: Analyzing trace with hash 428135790, now seen corresponding path program 1 times [2019-10-13 21:10:57,020 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:57,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885947545] [2019-10-13 21:10:57,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:57,020 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:57,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:57,192 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-13 21:10:57,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885947545] [2019-10-13 21:10:57,193 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375860960] [2019-10-13 21:10:57,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:57,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 2845 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 21:10:57,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:10:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:10:58,104 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:10:58,533 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:10:58,533 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:10:58,533 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [11] total 18 [2019-10-13 21:10:58,534 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137952133] [2019-10-13 21:10:58,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:10:58,535 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:58,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:10:58,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:10:58,535 INFO L87 Difference]: Start difference. First operand 626 states and 966 transitions. Second operand 9 states. [2019-10-13 21:11:03,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:03,556 INFO L93 Difference]: Finished difference Result 1831 states and 2908 transitions. [2019-10-13 21:11:03,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 21:11:03,557 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 179 [2019-10-13 21:11:03,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:03,567 INFO L225 Difference]: With dead ends: 1831 [2019-10-13 21:11:03,567 INFO L226 Difference]: Without dead ends: 1271 [2019-10-13 21:11:03,571 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2019-10-13 21:11:03,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2019-10-13 21:11:03,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1228. [2019-10-13 21:11:03,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1228 states. [2019-10-13 21:11:03,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1939 transitions. [2019-10-13 21:11:03,643 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1939 transitions. Word has length 179 [2019-10-13 21:11:03,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:03,644 INFO L462 AbstractCegarLoop]: Abstraction has 1228 states and 1939 transitions. [2019-10-13 21:11:03,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:11:03,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1939 transitions. [2019-10-13 21:11:03,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-13 21:11:03,650 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:03,650 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:11:03,858 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:03,859 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:03,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:03,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1186257159, now seen corresponding path program 1 times [2019-10-13 21:11:03,860 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:03,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81892495] [2019-10-13 21:11:03,861 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:03,861 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:03,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:04,059 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-13 21:11:04,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81892495] [2019-10-13 21:11:04,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939753994] [2019-10-13 21:11:04,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:11:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:04,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 2861 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-13 21:11:04,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:11:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-13 21:11:04,848 INFO L321 TraceCheckSpWp]: Computing backward predicates...