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_product11.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:10:22,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:10:22,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:10:23,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:10:23,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:10:23,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:10:23,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:10:23,006 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:10:23,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:10:23,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:10:23,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:10:23,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:10:23,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:10:23,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:10:23,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:10:23,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:10:23,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:10:23,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:10:23,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:10:23,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:10:23,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:10:23,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:10:23,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:10:23,024 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:10:23,027 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:10:23,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:10:23,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:10:23,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:10:23,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:10:23,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:10:23,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:10:23,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:10:23,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:10:23,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:10:23,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:10:23,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:10:23,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:10:23,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:10:23,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:10:23,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:10:23,035 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:10:23,036 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:23,050 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:10:23,050 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:10:23,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:10:23,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:10:23,052 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:10:23,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:10:23,052 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:10:23,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:10:23,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:10:23,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:10:23,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:10:23,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:10:23,053 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:10:23,054 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:10:23,054 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:10:23,054 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:10:23,054 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:10:23,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:10:23,055 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:10:23,055 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:10:23,055 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:10:23,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:10:23,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:10:23,056 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:10:23,056 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:10:23,056 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:10:23,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:10:23,057 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:10:23,057 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:23,362 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:10:23,376 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:10:23,379 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:10:23,381 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:10:23,381 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:10:23,382 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product11.cil.c [2019-10-13 21:10:23,459 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/177b56e57/4a0caed4b7a8451a8275712e4153b1fc/FLAG6274afe83 [2019-10-13 21:10:24,206 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:10:24,207 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product11.cil.c [2019-10-13 21:10:24,241 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/177b56e57/4a0caed4b7a8451a8275712e4153b1fc/FLAG6274afe83 [2019-10-13 21:10:24,352 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/177b56e57/4a0caed4b7a8451a8275712e4153b1fc [2019-10-13 21:10:24,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:10:24,363 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:10:24,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:10:24,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:10:24,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:10:24,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:24" (1/1) ... [2019-10-13 21:10:24,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ae0ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:24, skipping insertion in model container [2019-10-13 21:10:24,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:24" (1/1) ... [2019-10-13 21:10:24,381 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:10:24,466 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:10:25,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:10:25,209 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:10:25,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:10:25,520 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:10:25,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:25 WrapperNode [2019-10-13 21:10:25,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:10:25,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:10:25,522 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:10:25,524 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:10:25,537 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:25" (1/1) ... [2019-10-13 21:10:25,537 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:25" (1/1) ... [2019-10-13 21:10:25,571 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:25" (1/1) ... [2019-10-13 21:10:25,571 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:25" (1/1) ... [2019-10-13 21:10:25,657 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:25" (1/1) ... [2019-10-13 21:10:25,680 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:25" (1/1) ... [2019-10-13 21:10:25,699 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:25" (1/1) ... [2019-10-13 21:10:25,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:10:25,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:10:25,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:10:25,736 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:10:25,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:25" (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:25,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:10:25,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:10:25,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:10:25,826 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:10:25,826 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:10:25,826 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:10:25,826 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:10:25,827 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:10:25,827 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:10:25,828 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:10:25,828 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:10:25,828 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:10:25,828 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:10:25,829 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:10:25,830 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:10:25,830 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:10:25,830 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:10:25,831 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:10:25,831 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:10:25,831 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:10:25,831 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:10:25,832 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:10:25,832 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:10:25,833 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:10:25,833 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:10:25,833 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:10:25,833 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:10:25,833 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:10:25,833 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:10:25,834 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:10:25,834 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:10:25,834 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:10:25,834 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:10:25,834 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:10:25,834 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:10:25,835 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:10:25,835 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:10:25,835 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:10:25,836 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:10:25,836 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:10:25,836 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:10:25,836 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:10:25,836 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:10:25,837 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:10:25,837 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:10:25,837 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-13 21:10:25,837 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:10:25,837 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:10:25,838 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:10:25,838 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-13 21:10:25,839 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:10:25,839 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:10:25,839 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:10:25,840 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:10:25,840 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:10:25,840 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:10:25,840 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-13 21:10:25,840 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-13 21:10:25,840 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:10:25,841 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:10:25,841 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:10:25,841 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:10:25,842 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:10:25,842 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:10:25,842 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:10:25,842 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:10:25,842 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:10:25,843 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:10:25,843 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:10:25,843 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:10:25,843 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:10:25,843 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:10:25,844 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:10:25,844 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:10:25,845 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:10:25,845 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:10:25,845 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:10:25,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:10:25,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:10:25,846 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:10:25,847 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:10:25,847 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:10:25,847 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:10:25,848 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:10:25,848 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:10:25,848 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:10:25,849 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:10:25,849 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:10:25,849 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:10:25,849 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:10:25,849 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:10:25,850 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:10:25,850 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:10:25,850 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:10:25,850 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:10:25,850 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:10:25,850 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:10:25,851 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:10:25,851 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:10:25,851 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:10:25,851 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:10:25,851 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:10:25,852 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:10:25,852 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:10:25,852 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:10:25,852 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:10:25,852 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:10:25,853 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:10:25,853 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:10:25,853 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:10:25,853 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:10:25,853 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:10:25,854 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:10:25,854 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:10:25,855 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:10:25,856 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:10:25,856 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:10:25,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:10:25,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:10:25,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:10:25,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:10:25,857 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:10:25,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:10:25,858 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:10:25,858 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:10:25,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:10:25,859 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:10:25,859 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:10:25,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:10:25,859 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:10:25,859 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:10:25,860 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:10:25,860 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:10:25,860 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:10:25,860 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:10:25,861 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:10:25,861 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:10:25,864 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:10:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:10:25,865 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:10:25,866 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:10:25,867 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:10:25,867 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:10:25,867 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:10:25,873 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-13 21:10:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-13 21:10:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:10:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:10:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:10:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:10:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:10:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:10:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:10:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-13 21:10:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:10:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:10:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-13 21:10:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:10:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:10:25,876 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:10:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:10:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:10:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:10:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:10:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:10:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:10:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:10:25,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:10:25,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:10:28,250 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:10:28,250 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:10:28,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:10:28 BoogieIcfgContainer [2019-10-13 21:10:28,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:10:28,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:10:28,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:10:28,256 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:10:28,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:10:24" (1/3) ... [2019-10-13 21:10:28,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766983e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:10:28, skipping insertion in model container [2019-10-13 21:10:28,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:25" (2/3) ... [2019-10-13 21:10:28,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@766983e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:10:28, skipping insertion in model container [2019-10-13 21:10:28,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:10:28" (3/3) ... [2019-10-13 21:10:28,259 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product11.cil.c [2019-10-13 21:10:28,269 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:10:28,277 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:10:28,288 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:10:28,317 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:10:28,317 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:10:28,317 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:10:28,317 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:10:28,317 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:10:28,318 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:10:28,318 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:10:28,318 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:10:28,358 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states. [2019-10-13 21:10:28,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-13 21:10:28,390 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:28,391 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:28,394 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:28,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:28,400 INFO L82 PathProgramCache]: Analyzing trace with hash -353986784, now seen corresponding path program 1 times [2019-10-13 21:10:28,411 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:28,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505943111] [2019-10-13 21:10:28,411 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:28,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:28,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:29,030 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:29,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505943111] [2019-10-13 21:10:29,032 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:29,032 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:29,033 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703336052] [2019-10-13 21:10:29,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:29,039 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:29,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:29,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:29,057 INFO L87 Difference]: Start difference. First operand 765 states. Second operand 4 states. [2019-10-13 21:10:29,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:29,250 INFO L93 Difference]: Finished difference Result 1193 states and 1933 transitions. [2019-10-13 21:10:29,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:29,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-10-13 21:10:29,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:29,277 INFO L225 Difference]: With dead ends: 1193 [2019-10-13 21:10:29,277 INFO L226 Difference]: Without dead ends: 605 [2019-10-13 21:10:29,287 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:29,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-13 21:10:29,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-13 21:10:29,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-13 21:10:29,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 968 transitions. [2019-10-13 21:10:29,389 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 968 transitions. Word has length 133 [2019-10-13 21:10:29,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:29,389 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 968 transitions. [2019-10-13 21:10:29,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:29,390 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 968 transitions. [2019-10-13 21:10:29,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-13 21:10:29,397 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:29,397 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:29,397 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:29,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:29,398 INFO L82 PathProgramCache]: Analyzing trace with hash 253416708, now seen corresponding path program 1 times [2019-10-13 21:10:29,398 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:29,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982419901] [2019-10-13 21:10:29,399 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:29,399 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:29,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:29,581 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:29,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982419901] [2019-10-13 21:10:29,582 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:29,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:29,583 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298787386] [2019-10-13 21:10:29,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:29,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:29,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:29,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:29,586 INFO L87 Difference]: Start difference. First operand 605 states and 968 transitions. Second operand 4 states. [2019-10-13 21:10:29,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:29,703 INFO L93 Difference]: Finished difference Result 1173 states and 1894 transitions. [2019-10-13 21:10:29,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:29,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-13 21:10:29,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:29,713 INFO L225 Difference]: With dead ends: 1173 [2019-10-13 21:10:29,713 INFO L226 Difference]: Without dead ends: 605 [2019-10-13 21:10:29,731 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:29,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-13 21:10:29,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-13 21:10:29,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-13 21:10:29,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 967 transitions. [2019-10-13 21:10:29,791 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 967 transitions. Word has length 136 [2019-10-13 21:10:29,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:29,793 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 967 transitions. [2019-10-13 21:10:29,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:29,793 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 967 transitions. [2019-10-13 21:10:29,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-13 21:10:29,803 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:29,804 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:29,804 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:29,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:29,805 INFO L82 PathProgramCache]: Analyzing trace with hash -602392881, now seen corresponding path program 1 times [2019-10-13 21:10:29,805 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:29,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914242478] [2019-10-13 21:10:29,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:29,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:29,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:29,995 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:29,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914242478] [2019-10-13 21:10:29,995 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:29,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:29,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559638359] [2019-10-13 21:10:29,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:30,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:30,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:30,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:30,000 INFO L87 Difference]: Start difference. First operand 605 states and 967 transitions. Second operand 4 states. [2019-10-13 21:10:30,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:30,078 INFO L93 Difference]: Finished difference Result 1173 states and 1893 transitions. [2019-10-13 21:10:30,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:30,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-13 21:10:30,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:30,085 INFO L225 Difference]: With dead ends: 1173 [2019-10-13 21:10:30,085 INFO L226 Difference]: Without dead ends: 605 [2019-10-13 21:10:30,088 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:30,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-13 21:10:30,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-13 21:10:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-13 21:10:30,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 966 transitions. [2019-10-13 21:10:30,127 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 966 transitions. Word has length 137 [2019-10-13 21:10:30,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:30,127 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 966 transitions. [2019-10-13 21:10:30,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:30,127 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 966 transitions. [2019-10-13 21:10:30,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-13 21:10:30,135 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:30,135 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:30,135 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:30,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:30,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1415901664, now seen corresponding path program 1 times [2019-10-13 21:10:30,137 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:30,137 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88984451] [2019-10-13 21:10:30,137 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:30,137 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:30,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:30,332 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:30,333 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88984451] [2019-10-13 21:10:30,333 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:30,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:30,334 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745053727] [2019-10-13 21:10:30,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:30,335 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:30,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:30,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:30,336 INFO L87 Difference]: Start difference. First operand 605 states and 966 transitions. Second operand 4 states. [2019-10-13 21:10:30,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:30,411 INFO L93 Difference]: Finished difference Result 1173 states and 1892 transitions. [2019-10-13 21:10:30,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:30,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-13 21:10:30,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:30,420 INFO L225 Difference]: With dead ends: 1173 [2019-10-13 21:10:30,421 INFO L226 Difference]: Without dead ends: 605 [2019-10-13 21:10:30,424 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:30,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-13 21:10:30,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-13 21:10:30,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-13 21:10:30,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 965 transitions. [2019-10-13 21:10:30,456 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 965 transitions. Word has length 138 [2019-10-13 21:10:30,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:30,457 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 965 transitions. [2019-10-13 21:10:30,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:30,457 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 965 transitions. [2019-10-13 21:10:30,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-13 21:10:30,462 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:30,463 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:30,463 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:30,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:30,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1957856149, now seen corresponding path program 1 times [2019-10-13 21:10:30,463 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:30,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265535309] [2019-10-13 21:10:30,464 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:30,465 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:30,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:30,624 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:30,625 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265535309] [2019-10-13 21:10:30,625 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:30,625 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:30,626 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453176912] [2019-10-13 21:10:30,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:30,626 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:30,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:30,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:30,628 INFO L87 Difference]: Start difference. First operand 605 states and 965 transitions. Second operand 4 states. [2019-10-13 21:10:30,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:30,736 INFO L93 Difference]: Finished difference Result 1173 states and 1891 transitions. [2019-10-13 21:10:30,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:30,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-13 21:10:30,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:30,744 INFO L225 Difference]: With dead ends: 1173 [2019-10-13 21:10:30,744 INFO L226 Difference]: Without dead ends: 605 [2019-10-13 21:10:30,747 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:30,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-13 21:10:30,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-10-13 21:10:30,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-13 21:10:30,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 964 transitions. [2019-10-13 21:10:30,770 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 964 transitions. Word has length 139 [2019-10-13 21:10:30,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:30,771 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 964 transitions. [2019-10-13 21:10:30,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:30,771 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 964 transitions. [2019-10-13 21:10:30,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:10:30,775 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:30,775 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:30,775 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:30,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:30,776 INFO L82 PathProgramCache]: Analyzing trace with hash -686545220, now seen corresponding path program 1 times [2019-10-13 21:10:30,776 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:30,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464362051] [2019-10-13 21:10:30,779 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:30,779 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:30,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:30,988 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:30,989 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464362051] [2019-10-13 21:10:30,990 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:30,990 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:10:30,990 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198075280] [2019-10-13 21:10:30,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:10:30,991 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:30,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:10:30,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:10:30,992 INFO L87 Difference]: Start difference. First operand 605 states and 964 transitions. Second operand 10 states. [2019-10-13 21:10:31,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:31,175 INFO L93 Difference]: Finished difference Result 1131 states and 1811 transitions. [2019-10-13 21:10:31,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:10:31,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-13 21:10:31,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:31,181 INFO L225 Difference]: With dead ends: 1131 [2019-10-13 21:10:31,181 INFO L226 Difference]: Without dead ends: 614 [2019-10-13 21:10:31,183 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:31,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-13 21:10:31,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 612. [2019-10-13 21:10:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-13 21:10:31,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 973 transitions. [2019-10-13 21:10:31,207 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 973 transitions. Word has length 140 [2019-10-13 21:10:31,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:31,208 INFO L462 AbstractCegarLoop]: Abstraction has 612 states and 973 transitions. [2019-10-13 21:10:31,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:10:31,208 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 973 transitions. [2019-10-13 21:10:31,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:10:31,213 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:31,213 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:31,213 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:31,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:31,214 INFO L82 PathProgramCache]: Analyzing trace with hash 8101787, now seen corresponding path program 1 times [2019-10-13 21:10:31,214 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:31,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901828070] [2019-10-13 21:10:31,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:31,334 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:31,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901828070] [2019-10-13 21:10:31,335 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:31,335 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:31,335 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170653713] [2019-10-13 21:10:31,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:31,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:31,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:31,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:31,337 INFO L87 Difference]: Start difference. First operand 612 states and 973 transitions. Second operand 4 states. [2019-10-13 21:10:31,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:31,397 INFO L93 Difference]: Finished difference Result 1179 states and 1897 transitions. [2019-10-13 21:10:31,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:31,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-13 21:10:31,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:31,403 INFO L225 Difference]: With dead ends: 1179 [2019-10-13 21:10:31,403 INFO L226 Difference]: Without dead ends: 599 [2019-10-13 21:10:31,407 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:31,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-13 21:10:31,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-13 21:10:31,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-13 21:10:31,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 950 transitions. [2019-10-13 21:10:31,430 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 950 transitions. Word has length 140 [2019-10-13 21:10:31,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:31,430 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 950 transitions. [2019-10-13 21:10:31,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:31,430 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 950 transitions. [2019-10-13 21:10:31,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 21:10:31,435 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:31,435 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:31,435 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:31,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:31,436 INFO L82 PathProgramCache]: Analyzing trace with hash 590106207, now seen corresponding path program 1 times [2019-10-13 21:10:31,436 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:31,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590085812] [2019-10-13 21:10:31,437 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,437 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:31,633 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:31,633 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590085812] [2019-10-13 21:10:31,634 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:31,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:31,634 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514665726] [2019-10-13 21:10:31,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:31,635 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:31,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:31,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:31,636 INFO L87 Difference]: Start difference. First operand 599 states and 950 transitions. Second operand 6 states. [2019-10-13 21:10:31,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:31,858 INFO L93 Difference]: Finished difference Result 1119 states and 1789 transitions. [2019-10-13 21:10:31,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:31,859 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-13 21:10:31,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:31,865 INFO L225 Difference]: With dead ends: 1119 [2019-10-13 21:10:31,865 INFO L226 Difference]: Without dead ends: 599 [2019-10-13 21:10:31,870 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:31,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-13 21:10:31,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-13 21:10:31,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-13 21:10:31,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 946 transitions. [2019-10-13 21:10:31,894 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 946 transitions. Word has length 141 [2019-10-13 21:10:31,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:31,896 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 946 transitions. [2019-10-13 21:10:31,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:31,896 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 946 transitions. [2019-10-13 21:10:31,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:10:31,902 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:31,903 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:31,903 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:31,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:31,903 INFO L82 PathProgramCache]: Analyzing trace with hash 871479167, now seen corresponding path program 1 times [2019-10-13 21:10:31,903 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:31,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140528899] [2019-10-13 21:10:31,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:32,048 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:32,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140528899] [2019-10-13 21:10:32,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:32,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:32,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248295404] [2019-10-13 21:10:32,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:32,050 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:32,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:32,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:32,051 INFO L87 Difference]: Start difference. First operand 599 states and 946 transitions. Second operand 6 states. [2019-10-13 21:10:32,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:32,259 INFO L93 Difference]: Finished difference Result 1119 states and 1785 transitions. [2019-10-13 21:10:32,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:32,260 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-13 21:10:32,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:32,267 INFO L225 Difference]: With dead ends: 1119 [2019-10-13 21:10:32,267 INFO L226 Difference]: Without dead ends: 599 [2019-10-13 21:10:32,271 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:32,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-13 21:10:32,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-13 21:10:32,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-13 21:10:32,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 942 transitions. [2019-10-13 21:10:32,303 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 942 transitions. Word has length 142 [2019-10-13 21:10:32,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:32,304 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 942 transitions. [2019-10-13 21:10:32,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:32,304 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 942 transitions. [2019-10-13 21:10:32,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:10:32,308 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:32,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] [2019-10-13 21:10:32,309 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:32,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:32,309 INFO L82 PathProgramCache]: Analyzing trace with hash 711816804, now seen corresponding path program 1 times [2019-10-13 21:10:32,310 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:32,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994348083] [2019-10-13 21:10:32,310 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:32,311 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:32,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:32,534 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:32,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994348083] [2019-10-13 21:10:32,535 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:32,536 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:32,536 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482976977] [2019-10-13 21:10:32,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:32,537 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:32,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:32,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:32,537 INFO L87 Difference]: Start difference. First operand 599 states and 942 transitions. Second operand 6 states. [2019-10-13 21:10:32,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:32,720 INFO L93 Difference]: Finished difference Result 1119 states and 1781 transitions. [2019-10-13 21:10:32,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:32,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-13 21:10:32,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:32,726 INFO L225 Difference]: With dead ends: 1119 [2019-10-13 21:10:32,726 INFO L226 Difference]: Without dead ends: 599 [2019-10-13 21:10:32,733 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:32,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-13 21:10:32,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-13 21:10:32,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-13 21:10:32,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 938 transitions. [2019-10-13 21:10:32,756 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 938 transitions. Word has length 143 [2019-10-13 21:10:32,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:32,756 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 938 transitions. [2019-10-13 21:10:32,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:32,757 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 938 transitions. [2019-10-13 21:10:32,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:10:32,762 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:32,762 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:32,762 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:32,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:32,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1766290148, now seen corresponding path program 1 times [2019-10-13 21:10:32,763 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:32,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104614928] [2019-10-13 21:10:32,763 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:32,763 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:32,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:32,905 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:32,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104614928] [2019-10-13 21:10:32,906 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:32,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:10:32,907 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892808418] [2019-10-13 21:10:32,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:10:32,908 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:32,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:10:32,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:10:32,909 INFO L87 Difference]: Start difference. First operand 599 states and 938 transitions. Second operand 7 states. [2019-10-13 21:10:32,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:32,996 INFO L93 Difference]: Finished difference Result 1119 states and 1777 transitions. [2019-10-13 21:10:32,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:10:32,997 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-13 21:10:32,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:33,002 INFO L225 Difference]: With dead ends: 1119 [2019-10-13 21:10:33,002 INFO L226 Difference]: Without dead ends: 578 [2019-10-13 21:10:33,005 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:33,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-10-13 21:10:33,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2019-10-13 21:10:33,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-10-13 21:10:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 904 transitions. [2019-10-13 21:10:33,026 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 904 transitions. Word has length 143 [2019-10-13 21:10:33,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:33,027 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 904 transitions. [2019-10-13 21:10:33,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:10:33,027 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 904 transitions. [2019-10-13 21:10:33,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 21:10:33,032 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:33,032 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:33,033 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:33,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:33,033 INFO L82 PathProgramCache]: Analyzing trace with hash -235038684, now seen corresponding path program 1 times [2019-10-13 21:10:33,033 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:33,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247512397] [2019-10-13 21:10:33,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:33,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:33,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:33,165 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:33,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247512397] [2019-10-13 21:10:33,166 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:33,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:33,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459368861] [2019-10-13 21:10:33,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:33,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:33,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:33,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:33,168 INFO L87 Difference]: Start difference. First operand 578 states and 904 transitions. Second operand 6 states. [2019-10-13 21:10:33,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:33,266 INFO L93 Difference]: Finished difference Result 1098 states and 1743 transitions. [2019-10-13 21:10:33,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:33,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-13 21:10:33,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:33,271 INFO L225 Difference]: With dead ends: 1098 [2019-10-13 21:10:33,271 INFO L226 Difference]: Without dead ends: 578 [2019-10-13 21:10:33,274 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:33,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-10-13 21:10:33,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2019-10-13 21:10:33,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-10-13 21:10:33,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 903 transitions. [2019-10-13 21:10:33,300 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 903 transitions. Word has length 144 [2019-10-13 21:10:33,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:33,302 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 903 transitions. [2019-10-13 21:10:33,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:33,302 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 903 transitions. [2019-10-13 21:10:33,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:10:33,307 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:33,308 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:33,308 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:33,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:33,308 INFO L82 PathProgramCache]: Analyzing trace with hash 184922729, now seen corresponding path program 1 times [2019-10-13 21:10:33,309 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:33,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171400233] [2019-10-13 21:10:33,309 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:33,309 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:33,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:33,481 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:33,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171400233] [2019-10-13 21:10:33,481 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:33,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:33,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631813577] [2019-10-13 21:10:33,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:33,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:33,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:33,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:33,483 INFO L87 Difference]: Start difference. First operand 578 states and 903 transitions. Second operand 6 states. [2019-10-13 21:10:33,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:33,578 INFO L93 Difference]: Finished difference Result 1098 states and 1742 transitions. [2019-10-13 21:10:33,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:33,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-13 21:10:33,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:33,584 INFO L225 Difference]: With dead ends: 1098 [2019-10-13 21:10:33,584 INFO L226 Difference]: Without dead ends: 578 [2019-10-13 21:10:33,587 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:33,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-10-13 21:10:33,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2019-10-13 21:10:33,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-10-13 21:10:33,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 902 transitions. [2019-10-13 21:10:33,607 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 902 transitions. Word has length 145 [2019-10-13 21:10:33,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:33,607 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 902 transitions. [2019-10-13 21:10:33,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:33,607 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 902 transitions. [2019-10-13 21:10:33,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-13 21:10:33,611 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:33,612 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:33,612 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:33,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:33,612 INFO L82 PathProgramCache]: Analyzing trace with hash 26535113, now seen corresponding path program 1 times [2019-10-13 21:10:33,613 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:33,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414868548] [2019-10-13 21:10:33,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:33,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:33,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:33,839 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:33,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414868548] [2019-10-13 21:10:33,840 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:33,840 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:10:33,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227410595] [2019-10-13 21:10:33,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:10:33,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:33,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:10:33,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:10:33,842 INFO L87 Difference]: Start difference. First operand 578 states and 902 transitions. Second operand 12 states. [2019-10-13 21:10:34,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:34,064 INFO L93 Difference]: Finished difference Result 1099 states and 1741 transitions. [2019-10-13 21:10:34,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:10:34,064 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-13 21:10:34,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:34,069 INFO L225 Difference]: With dead ends: 1099 [2019-10-13 21:10:34,069 INFO L226 Difference]: Without dead ends: 578 [2019-10-13 21:10:34,072 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:34,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-10-13 21:10:34,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2019-10-13 21:10:34,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-10-13 21:10:34,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 901 transitions. [2019-10-13 21:10:34,097 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 901 transitions. Word has length 146 [2019-10-13 21:10:34,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:34,098 INFO L462 AbstractCegarLoop]: Abstraction has 578 states and 901 transitions. [2019-10-13 21:10:34,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:10:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 901 transitions. [2019-10-13 21:10:34,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:10:34,104 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:34,105 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:34,105 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:34,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:34,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1759527944, now seen corresponding path program 1 times [2019-10-13 21:10:34,106 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:34,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136296309] [2019-10-13 21:10:34,106 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:34,106 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:34,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:34,255 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:34,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136296309] [2019-10-13 21:10:34,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533418480] [2019-10-13 21:10:34,256 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:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:34,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 2739 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:10:35,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:10:35,164 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:35,165 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:10:35,972 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:35,973 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:10:35,973 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-13 21:10:35,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755541794] [2019-10-13 21:10:35,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:10:35,974 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:35,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:10:35,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:10:35,975 INFO L87 Difference]: Start difference. First operand 578 states and 901 transitions. Second operand 5 states. [2019-10-13 21:10:36,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:36,947 INFO L93 Difference]: Finished difference Result 1098 states and 1766 transitions. [2019-10-13 21:10:36,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:36,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-13 21:10:36,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:36,954 INFO L225 Difference]: With dead ends: 1098 [2019-10-13 21:10:36,955 INFO L226 Difference]: Without dead ends: 586 [2019-10-13 21:10:36,968 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 281 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:10:36,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-13 21:10:37,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-10-13 21:10:37,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-10-13 21:10:37,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 914 transitions. [2019-10-13 21:10:37,009 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 914 transitions. Word has length 147 [2019-10-13 21:10:37,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:37,010 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 914 transitions. [2019-10-13 21:10:37,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:10:37,010 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 914 transitions. [2019-10-13 21:10:37,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-13 21:10:37,014 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:37,015 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:37,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:37,224 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:37,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:37,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1319088752, now seen corresponding path program 1 times [2019-10-13 21:10:37,225 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:37,226 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865037570] [2019-10-13 21:10:37,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:37,226 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:37,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:37,497 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:10:37,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865037570] [2019-10-13 21:10:37,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354185720] [2019-10-13 21:10:37,498 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:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:38,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 2741 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:10:38,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:10:38,124 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:38,125 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:10:38,863 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:10:38,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:10:38,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-13 21:10:38,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476383467] [2019-10-13 21:10:38,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:10:38,866 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:38,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:10:38,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:10:38,867 INFO L87 Difference]: Start difference. First operand 586 states and 914 transitions. Second operand 5 states. [2019-10-13 21:10:39,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:39,916 INFO L93 Difference]: Finished difference Result 1114 states and 1789 transitions. [2019-10-13 21:10:39,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:39,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2019-10-13 21:10:39,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:39,924 INFO L225 Difference]: With dead ends: 1114 [2019-10-13 21:10:39,924 INFO L226 Difference]: Without dead ends: 594 [2019-10-13 21:10:39,929 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 285 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:10:39,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-10-13 21:10:39,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2019-10-13 21:10:39,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-10-13 21:10:39,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 927 transitions. [2019-10-13 21:10:39,961 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 927 transitions. Word has length 149 [2019-10-13 21:10:39,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:39,962 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 927 transitions. [2019-10-13 21:10:39,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:10:39,962 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 927 transitions. [2019-10-13 21:10:39,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-13 21:10:39,968 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:39,969 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:40,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:40,179 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:40,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:40,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1445266504, now seen corresponding path program 1 times [2019-10-13 21:10:40,180 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:40,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558613712] [2019-10-13 21:10:40,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,181 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:40,317 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:40,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558613712] [2019-10-13 21:10:40,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983213766] [2019-10-13 21:10:40,318 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:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:40,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 2743 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:10:40,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:10:40,946 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:40,946 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:10:41,665 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:41,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:10:41,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-13 21:10:41,666 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644471712] [2019-10-13 21:10:41,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:10:41,667 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:41,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:10:41,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:10:41,668 INFO L87 Difference]: Start difference. First operand 594 states and 927 transitions. Second operand 5 states. [2019-10-13 21:10:42,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:42,640 INFO L93 Difference]: Finished difference Result 1130 states and 1812 transitions. [2019-10-13 21:10:42,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:42,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-10-13 21:10:42,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:42,645 INFO L225 Difference]: With dead ends: 1130 [2019-10-13 21:10:42,645 INFO L226 Difference]: Without dead ends: 602 [2019-10-13 21:10:42,649 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 289 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:10:42,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-13 21:10:42,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-13 21:10:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-13 21:10:42,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 940 transitions. [2019-10-13 21:10:42,671 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 940 transitions. Word has length 151 [2019-10-13 21:10:42,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:42,671 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 940 transitions. [2019-10-13 21:10:42,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:10:42,672 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 940 transitions. [2019-10-13 21:10:42,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:10:42,676 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:42,676 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:42,892 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:42,893 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:42,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:42,893 INFO L82 PathProgramCache]: Analyzing trace with hash 617582120, now seen corresponding path program 1 times [2019-10-13 21:10:42,893 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:42,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101169195] [2019-10-13 21:10:42,894 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:42,894 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:42,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:43,083 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:43,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101169195] [2019-10-13 21:10:43,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348279326] [2019-10-13 21:10:43,084 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:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:43,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 2745 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:10:43,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:10:43,719 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:43,719 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:10:44,499 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:44,501 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:10:44,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 12 [2019-10-13 21:10:44,501 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991461763] [2019-10-13 21:10:44,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:10:44,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:44,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:10:44,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:10:44,503 INFO L87 Difference]: Start difference. First operand 602 states and 940 transitions. Second operand 5 states. [2019-10-13 21:10:45,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:45,261 INFO L93 Difference]: Finished difference Result 1146 states and 1835 transitions. [2019-10-13 21:10:45,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:45,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-10-13 21:10:45,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:45,268 INFO L225 Difference]: With dead ends: 1146 [2019-10-13 21:10:45,269 INFO L226 Difference]: Without dead ends: 610 [2019-10-13 21:10:45,272 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 293 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:10:45,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-10-13 21:10:45,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2019-10-13 21:10:45,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-13 21:10:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 953 transitions. [2019-10-13 21:10:45,295 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 953 transitions. Word has length 153 [2019-10-13 21:10:45,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:45,296 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 953 transitions. [2019-10-13 21:10:45,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:10:45,296 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 953 transitions. [2019-10-13 21:10:45,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-13 21:10:45,301 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:45,301 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:45,508 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:45,509 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:45,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:45,509 INFO L82 PathProgramCache]: Analyzing trace with hash 522371720, now seen corresponding path program 1 times [2019-10-13 21:10:45,509 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:45,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815783741] [2019-10-13 21:10:45,510 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:45,510 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:45,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:45,689 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:45,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815783741] [2019-10-13 21:10:45,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470835622] [2019-10-13 21:10:45,690 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:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:46,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 2747 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:10:46,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:10:46,508 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:46,508 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:10:46,870 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:46,872 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:10:46,872 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 6] imperfect sequences [11] total 18 [2019-10-13 21:10:46,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104177103] [2019-10-13 21:10:46,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:10:46,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:46,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:10:46,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:10:46,877 INFO L87 Difference]: Start difference. First operand 610 states and 953 transitions. Second operand 9 states. [2019-10-13 21:10:48,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:48,189 INFO L93 Difference]: Finished difference Result 655 states and 1013 transitions. [2019-10-13 21:10:48,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:10:48,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 155 [2019-10-13 21:10:48,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:48,196 INFO L225 Difference]: With dead ends: 655 [2019-10-13 21:10:48,197 INFO L226 Difference]: Without dead ends: 638 [2019-10-13 21:10:48,197 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:48,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-13 21:10:48,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 624. [2019-10-13 21:10:48,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-10-13 21:10:48,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 972 transitions. [2019-10-13 21:10:48,222 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 972 transitions. Word has length 155 [2019-10-13 21:10:48,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:48,223 INFO L462 AbstractCegarLoop]: Abstraction has 624 states and 972 transitions. [2019-10-13 21:10:48,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:10:48,223 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 972 transitions. [2019-10-13 21:10:48,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:10:48,228 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:48,228 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:48,435 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:48,435 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:48,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:48,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1028213635, now seen corresponding path program 1 times [2019-10-13 21:10:48,436 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:48,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528071131] [2019-10-13 21:10:48,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:48,436 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:48,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:48,639 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:48,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528071131] [2019-10-13 21:10:48,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159344174] [2019-10-13 21:10:48,640 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:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:49,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 2763 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 21:10:49,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:10:49,479 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:49,480 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:10:49,768 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:49,768 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:10:49,769 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [11] total 14 [2019-10-13 21:10:49,769 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948135340] [2019-10-13 21:10:49,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:10:49,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:49,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:10:49,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:10:49,772 INFO L87 Difference]: Start difference. First operand 624 states and 972 transitions. Second operand 5 states. [2019-10-13 21:10:49,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:49,815 INFO L93 Difference]: Finished difference Result 641 states and 992 transitions. [2019-10-13 21:10:49,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:49,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-10-13 21:10:49,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:49,821 INFO L225 Difference]: With dead ends: 641 [2019-10-13 21:10:49,821 INFO L226 Difference]: Without dead ends: 624 [2019-10-13 21:10:49,822 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:49,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-10-13 21:10:49,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2019-10-13 21:10:49,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-10-13 21:10:49,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 970 transitions. [2019-10-13 21:10:49,885 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 970 transitions. Word has length 161 [2019-10-13 21:10:49,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:49,885 INFO L462 AbstractCegarLoop]: Abstraction has 624 states and 970 transitions. [2019-10-13 21:10:49,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:10:49,885 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 970 transitions. [2019-10-13 21:10:49,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-13 21:10:49,890 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:49,890 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:50,098 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:10:50,106 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:50,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:50,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1459009375, now seen corresponding path program 1 times [2019-10-13 21:10:50,107 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:50,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479677871] [2019-10-13 21:10:50,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:50,107 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:50,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:50,292 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:50,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479677871] [2019-10-13 21:10:50,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502330104] [2019-10-13 21:10:50,293 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:10:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:50,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 2813 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 21:10:50,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:10:51,033 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:51,033 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:10:51,482 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:51,483 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:10:51,483 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [11] total 18 [2019-10-13 21:10:51,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047322986] [2019-10-13 21:10:51,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:10:51,485 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:51,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:10:51,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:10:51,485 INFO L87 Difference]: Start difference. First operand 624 states and 970 transitions. Second operand 9 states.