/usr/bin/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_product20.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:41:54,132 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:41:54,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:41:54,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:41:54,152 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:41:54,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:41:54,155 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:41:54,157 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:41:54,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:41:54,159 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:41:54,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:41:54,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:41:54,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:41:54,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:41:54,164 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:41:54,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:41:54,166 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:41:54,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:41:54,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:41:54,170 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:41:54,171 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:41:54,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:41:54,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:41:54,174 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:41:54,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:41:54,177 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:41:54,177 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:41:54,178 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:41:54,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:41:54,179 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:41:54,179 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:41:54,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:41:54,181 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:41:54,181 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:41:54,182 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:41:54,182 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:41:54,183 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:41:54,183 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:41:54,183 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:41:54,184 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:41:54,185 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:41:54,186 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-11-07 00:41:54,204 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:41:54,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:41:54,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:41:54,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:41:54,206 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:41:54,207 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:41:54,207 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:41:54,207 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:41:54,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:41:54,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:41:54,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:41:54,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:41:54,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:41:54,208 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:41:54,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:41:54,208 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:41:54,209 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:41:54,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:41:54,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:41:54,209 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:41:54,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:41:54,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:41:54,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:41:54,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:41:54,210 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:41:54,210 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:41:54,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:41:54,211 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:41:54,211 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-11-07 00:41:54,506 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:41:54,527 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:41:54,530 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:41:54,532 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:41:54,532 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:41:54,533 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product20.cil.c [2019-11-07 00:41:54,609 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe727559/34b32237b6c5464b9d42865dcc156b29/FLAG7efd0ce8e [2019-11-07 00:41:55,259 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:41:55,260 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product20.cil.c [2019-11-07 00:41:55,285 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe727559/34b32237b6c5464b9d42865dcc156b29/FLAG7efd0ce8e [2019-11-07 00:41:55,452 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe727559/34b32237b6c5464b9d42865dcc156b29 [2019-11-07 00:41:55,461 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:41:55,462 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:41:55,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:41:55,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:41:55,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:41:55,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:41:55" (1/1) ... [2019-11-07 00:41:55,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71e6811d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:55, skipping insertion in model container [2019-11-07 00:41:55,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:41:55" (1/1) ... [2019-11-07 00:41:55,478 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:41:55,561 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:41:56,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:41:56,312 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:41:56,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:41:56,545 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:41:56,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:56 WrapperNode [2019-11-07 00:41:56,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:41:56,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:41:56,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:41:56,547 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:41:56,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:56" (1/1) ... [2019-11-07 00:41:56,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:56" (1/1) ... [2019-11-07 00:41:56,603 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:56" (1/1) ... [2019-11-07 00:41:56,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:56" (1/1) ... [2019-11-07 00:41:56,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:56" (1/1) ... [2019-11-07 00:41:56,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:56" (1/1) ... [2019-11-07 00:41:56,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:56" (1/1) ... [2019-11-07 00:41:56,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:41:56,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:41:56,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:41:56,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:41:56,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:56" (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-11-07 00:41:56,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:41:56,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:41:56,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-11-07 00:41:56,866 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-11-07 00:41:56,867 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-11-07 00:41:56,868 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-11-07 00:41:56,868 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-11-07 00:41:56,869 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-11-07 00:41:56,869 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-11-07 00:41:56,870 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-11-07 00:41:56,870 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-11-07 00:41:56,871 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-11-07 00:41:56,871 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-11-07 00:41:56,872 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-11-07 00:41:56,872 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-11-07 00:41:56,873 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-11-07 00:41:56,876 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-11-07 00:41:56,876 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-11-07 00:41:56,876 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-11-07 00:41:56,876 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-11-07 00:41:56,876 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-11-07 00:41:56,877 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-11-07 00:41:56,877 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-11-07 00:41:56,877 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-11-07 00:41:56,877 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-11-07 00:41:56,877 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-11-07 00:41:56,878 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-11-07 00:41:56,878 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-11-07 00:41:56,878 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-11-07 00:41:56,878 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-11-07 00:41:56,878 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-11-07 00:41:56,879 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-11-07 00:41:56,879 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-11-07 00:41:56,879 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-11-07 00:41:56,879 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-11-07 00:41:56,880 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-11-07 00:41:56,880 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-11-07 00:41:56,880 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-11-07 00:41:56,881 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-11-07 00:41:56,881 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-11-07 00:41:56,881 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-11-07 00:41:56,881 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-11-07 00:41:56,881 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-11-07 00:41:56,881 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-11-07 00:41:56,882 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-11-07 00:41:56,882 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-11-07 00:41:56,882 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-11-07 00:41:56,882 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-11-07 00:41:56,882 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-11-07 00:41:56,882 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-11-07 00:41:56,883 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-11-07 00:41:56,883 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-11-07 00:41:56,883 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-11-07 00:41:56,883 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-11-07 00:41:56,883 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-11-07 00:41:56,884 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-11-07 00:41:56,884 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-11-07 00:41:56,884 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-11-07 00:41:56,884 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-11-07 00:41:56,884 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-11-07 00:41:56,884 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-11-07 00:41:56,885 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-11-07 00:41:56,885 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-11-07 00:41:56,885 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-11-07 00:41:56,886 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-11-07 00:41:56,886 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-11-07 00:41:56,886 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-11-07 00:41:56,886 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-11-07 00:41:56,886 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-11-07 00:41:56,887 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-11-07 00:41:56,887 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-11-07 00:41:56,887 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-11-07 00:41:56,887 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-11-07 00:41:56,888 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-11-07 00:41:56,888 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-11-07 00:41:56,888 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-11-07 00:41:56,888 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:41:56,889 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-11-07 00:41:56,889 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-11-07 00:41:56,889 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-11-07 00:41:56,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:41:56,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 00:41:56,890 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-11-07 00:41:56,891 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-11-07 00:41:56,891 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-11-07 00:41:56,891 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-11-07 00:41:56,892 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-11-07 00:41:56,893 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-11-07 00:41:56,893 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-11-07 00:41:56,893 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-11-07 00:41:56,893 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-11-07 00:41:56,893 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-11-07 00:41:56,894 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-11-07 00:41:56,894 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-11-07 00:41:56,894 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-11-07 00:41:56,894 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-11-07 00:41:56,894 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-11-07 00:41:56,895 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-11-07 00:41:56,895 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-11-07 00:41:56,895 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-11-07 00:41:56,895 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-11-07 00:41:56,895 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-11-07 00:41:56,895 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-11-07 00:41:56,896 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-11-07 00:41:56,896 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-11-07 00:41:56,896 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-11-07 00:41:56,896 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-11-07 00:41:56,896 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-11-07 00:41:56,897 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-11-07 00:41:56,897 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-11-07 00:41:56,897 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-11-07 00:41:56,897 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-11-07 00:41:56,897 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-11-07 00:41:56,898 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-11-07 00:41:56,898 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-11-07 00:41:56,898 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-11-07 00:41:56,898 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-11-07 00:41:56,898 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-11-07 00:41:56,899 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-11-07 00:41:56,899 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-11-07 00:41:56,900 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-11-07 00:41:56,900 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-11-07 00:41:56,900 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-11-07 00:41:56,901 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-11-07 00:41:56,901 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-11-07 00:41:56,902 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-11-07 00:41:56,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-07 00:41:56,902 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-11-07 00:41:56,902 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-11-07 00:41:56,902 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-07 00:41:56,902 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-07 00:41:56,903 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-11-07 00:41:56,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-07 00:41:56,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-07 00:41:56,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-07 00:41:56,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-07 00:41:56,905 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-11-07 00:41:56,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-07 00:41:56,908 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-11-07 00:41:56,908 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-11-07 00:41:56,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-07 00:41:56,909 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-11-07 00:41:56,909 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-11-07 00:41:56,910 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-11-07 00:41:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-11-07 00:41:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-11-07 00:41:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-11-07 00:41:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-11-07 00:41:56,917 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-11-07 00:41:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-11-07 00:41:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-11-07 00:41:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-11-07 00:41:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-11-07 00:41:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-11-07 00:41:56,918 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-11-07 00:41:56,919 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-11-07 00:41:56,919 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-07 00:41:56,920 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-11-07 00:41:56,920 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-11-07 00:41:56,920 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-11-07 00:41:56,920 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-11-07 00:41:56,920 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-11-07 00:41:56,920 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-11-07 00:41:56,920 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-11-07 00:41:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-11-07 00:41:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-11-07 00:41:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-11-07 00:41:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-11-07 00:41:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-11-07 00:41:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-11-07 00:41:56,921 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-11-07 00:41:56,922 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:41:56,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:41:56,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-07 00:41:56,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:41:59,458 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:41:59,459 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-07 00:41:59,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:41:59 BoogieIcfgContainer [2019-11-07 00:41:59,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:41:59,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:41:59,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:41:59,467 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:41:59,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:41:55" (1/3) ... [2019-11-07 00:41:59,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a0ad867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:41:59, skipping insertion in model container [2019-11-07 00:41:59,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:41:56" (2/3) ... [2019-11-07 00:41:59,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a0ad867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:41:59, skipping insertion in model container [2019-11-07 00:41:59,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:41:59" (3/3) ... [2019-11-07 00:41:59,471 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product20.cil.c [2019-11-07 00:41:59,481 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:41:59,494 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 00:41:59,506 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 00:41:59,546 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:41:59,546 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:41:59,546 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:41:59,546 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:41:59,546 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:41:59,546 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:41:59,547 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:41:59,547 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:41:59,593 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states. [2019-11-07 00:41:59,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-07 00:41:59,605 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:41:59,606 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:41:59,608 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:41:59,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:41:59,613 INFO L82 PathProgramCache]: Analyzing trace with hash 64151631, now seen corresponding path program 1 times [2019-11-07 00:41:59,623 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:41:59,623 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701198527] [2019-11-07 00:41:59,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:41:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:00,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:00,241 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701198527] [2019-11-07 00:42:00,242 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:00,243 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:42:00,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135774988] [2019-11-07 00:42:00,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:42:00,251 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:00,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:42:00,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:42:00,269 INFO L87 Difference]: Start difference. First operand 786 states. Second operand 4 states. [2019-11-07 00:42:00,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:00,475 INFO L93 Difference]: Finished difference Result 1221 states and 1969 transitions. [2019-11-07 00:42:00,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:42:00,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-11-07 00:42:00,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:00,511 INFO L225 Difference]: With dead ends: 1221 [2019-11-07 00:42:00,511 INFO L226 Difference]: Without dead ends: 619 [2019-11-07 00:42:00,524 INFO L630 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-11-07 00:42:00,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-11-07 00:42:00,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2019-11-07 00:42:00,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-11-07 00:42:00,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 986 transitions. [2019-11-07 00:42:00,657 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 986 transitions. Word has length 85 [2019-11-07 00:42:00,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:00,658 INFO L462 AbstractCegarLoop]: Abstraction has 619 states and 986 transitions. [2019-11-07 00:42:00,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:42:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 986 transitions. [2019-11-07 00:42:00,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-07 00:42:00,664 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:00,664 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:00,664 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:00,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:00,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1001440901, now seen corresponding path program 1 times [2019-11-07 00:42:00,665 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:00,665 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015293826] [2019-11-07 00:42:00,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:00,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:00,872 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015293826] [2019-11-07 00:42:00,872 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:00,872 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:42:00,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321455940] [2019-11-07 00:42:00,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:42:00,878 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:00,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:42:00,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:42:00,879 INFO L87 Difference]: Start difference. First operand 619 states and 986 transitions. Second operand 4 states. [2019-11-07 00:42:00,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:00,991 INFO L93 Difference]: Finished difference Result 1201 states and 1930 transitions. [2019-11-07 00:42:00,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:42:00,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-07 00:42:00,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:01,003 INFO L225 Difference]: With dead ends: 1201 [2019-11-07 00:42:01,004 INFO L226 Difference]: Without dead ends: 619 [2019-11-07 00:42:01,010 INFO L630 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-11-07 00:42:01,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-11-07 00:42:01,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2019-11-07 00:42:01,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-11-07 00:42:01,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 985 transitions. [2019-11-07 00:42:01,054 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 985 transitions. Word has length 88 [2019-11-07 00:42:01,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:01,055 INFO L462 AbstractCegarLoop]: Abstraction has 619 states and 985 transitions. [2019-11-07 00:42:01,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:42:01,055 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 985 transitions. [2019-11-07 00:42:01,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-07 00:42:01,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:01,062 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:01,062 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:01,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:01,063 INFO L82 PathProgramCache]: Analyzing trace with hash 271669182, now seen corresponding path program 1 times [2019-11-07 00:42:01,063 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:01,063 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332713643] [2019-11-07 00:42:01,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:01,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:01,261 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332713643] [2019-11-07 00:42:01,261 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:01,261 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:42:01,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887821316] [2019-11-07 00:42:01,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:42:01,263 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:01,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:42:01,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:42:01,263 INFO L87 Difference]: Start difference. First operand 619 states and 985 transitions. Second operand 4 states. [2019-11-07 00:42:01,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:01,325 INFO L93 Difference]: Finished difference Result 1201 states and 1929 transitions. [2019-11-07 00:42:01,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:42:01,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-07 00:42:01,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:01,331 INFO L225 Difference]: With dead ends: 1201 [2019-11-07 00:42:01,331 INFO L226 Difference]: Without dead ends: 619 [2019-11-07 00:42:01,334 INFO L630 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-11-07 00:42:01,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-11-07 00:42:01,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2019-11-07 00:42:01,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-11-07 00:42:01,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 984 transitions. [2019-11-07 00:42:01,362 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 984 transitions. Word has length 89 [2019-11-07 00:42:01,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:01,363 INFO L462 AbstractCegarLoop]: Abstraction has 619 states and 984 transitions. [2019-11-07 00:42:01,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:42:01,363 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 984 transitions. [2019-11-07 00:42:01,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-07 00:42:01,365 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:01,365 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:01,366 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:01,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:01,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1164725591, now seen corresponding path program 1 times [2019-11-07 00:42:01,366 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:01,367 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93042750] [2019-11-07 00:42:01,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:01,490 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93042750] [2019-11-07 00:42:01,490 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:01,490 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:42:01,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066686980] [2019-11-07 00:42:01,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:42:01,491 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:01,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:42:01,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:42:01,492 INFO L87 Difference]: Start difference. First operand 619 states and 984 transitions. Second operand 4 states. [2019-11-07 00:42:01,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:01,550 INFO L93 Difference]: Finished difference Result 1201 states and 1928 transitions. [2019-11-07 00:42:01,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:42:01,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-07 00:42:01,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:01,556 INFO L225 Difference]: With dead ends: 1201 [2019-11-07 00:42:01,556 INFO L226 Difference]: Without dead ends: 619 [2019-11-07 00:42:01,559 INFO L630 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-11-07 00:42:01,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-11-07 00:42:01,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2019-11-07 00:42:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-11-07 00:42:01,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 983 transitions. [2019-11-07 00:42:01,585 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 983 transitions. Word has length 90 [2019-11-07 00:42:01,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:01,586 INFO L462 AbstractCegarLoop]: Abstraction has 619 states and 983 transitions. [2019-11-07 00:42:01,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:42:01,586 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 983 transitions. [2019-11-07 00:42:01,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-07 00:42:01,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:01,588 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:01,588 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:01,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:01,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1133947302, now seen corresponding path program 1 times [2019-11-07 00:42:01,589 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:01,589 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548240728] [2019-11-07 00:42:01,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:01,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:01,707 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548240728] [2019-11-07 00:42:01,707 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:01,708 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:42:01,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165271386] [2019-11-07 00:42:01,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:42:01,710 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:01,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:42:01,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:42:01,711 INFO L87 Difference]: Start difference. First operand 619 states and 983 transitions. Second operand 4 states. [2019-11-07 00:42:01,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:01,773 INFO L93 Difference]: Finished difference Result 1201 states and 1927 transitions. [2019-11-07 00:42:01,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:42:01,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-07 00:42:01,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:01,780 INFO L225 Difference]: With dead ends: 1201 [2019-11-07 00:42:01,780 INFO L226 Difference]: Without dead ends: 619 [2019-11-07 00:42:01,784 INFO L630 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-11-07 00:42:01,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-11-07 00:42:01,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2019-11-07 00:42:01,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-11-07 00:42:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 982 transitions. [2019-11-07 00:42:01,812 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 982 transitions. Word has length 91 [2019-11-07 00:42:01,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:01,813 INFO L462 AbstractCegarLoop]: Abstraction has 619 states and 982 transitions. [2019-11-07 00:42:01,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:42:01,813 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 982 transitions. [2019-11-07 00:42:01,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-07 00:42:01,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:01,815 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:01,815 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:01,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:01,815 INFO L82 PathProgramCache]: Analyzing trace with hash 702986547, now seen corresponding path program 1 times [2019-11-07 00:42:01,816 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:01,816 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375991329] [2019-11-07 00:42:01,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:02,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:02,065 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375991329] [2019-11-07 00:42:02,065 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:02,065 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-07 00:42:02,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664854199] [2019-11-07 00:42:02,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-07 00:42:02,066 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:02,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-07 00:42:02,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-07 00:42:02,067 INFO L87 Difference]: Start difference. First operand 619 states and 982 transitions. Second operand 10 states. [2019-11-07 00:42:02,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:02,214 INFO L93 Difference]: Finished difference Result 1159 states and 1847 transitions. [2019-11-07 00:42:02,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-07 00:42:02,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-11-07 00:42:02,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:02,220 INFO L225 Difference]: With dead ends: 1159 [2019-11-07 00:42:02,220 INFO L226 Difference]: Without dead ends: 628 [2019-11-07 00:42:02,223 INFO L630 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-11-07 00:42:02,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-11-07 00:42:02,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 626. [2019-11-07 00:42:02,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-11-07 00:42:02,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 991 transitions. [2019-11-07 00:42:02,251 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 991 transitions. Word has length 92 [2019-11-07 00:42:02,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:02,252 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 991 transitions. [2019-11-07 00:42:02,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-07 00:42:02,252 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 991 transitions. [2019-11-07 00:42:02,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-07 00:42:02,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:02,254 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:02,254 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:02,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:02,255 INFO L82 PathProgramCache]: Analyzing trace with hash 723323922, now seen corresponding path program 1 times [2019-11-07 00:42:02,255 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:02,255 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73768775] [2019-11-07 00:42:02,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:02,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:02,354 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73768775] [2019-11-07 00:42:02,355 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:02,355 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:42:02,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547736556] [2019-11-07 00:42:02,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:42:02,356 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:02,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:42:02,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:42:02,357 INFO L87 Difference]: Start difference. First operand 626 states and 991 transitions. Second operand 4 states. [2019-11-07 00:42:02,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:02,411 INFO L93 Difference]: Finished difference Result 1207 states and 1933 transitions. [2019-11-07 00:42:02,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:42:02,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-07 00:42:02,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:02,417 INFO L225 Difference]: With dead ends: 1207 [2019-11-07 00:42:02,417 INFO L226 Difference]: Without dead ends: 613 [2019-11-07 00:42:02,420 INFO L630 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-11-07 00:42:02,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-11-07 00:42:02,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-11-07 00:42:02,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-11-07 00:42:02,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 968 transitions. [2019-11-07 00:42:02,443 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 968 transitions. Word has length 92 [2019-11-07 00:42:02,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:02,444 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 968 transitions. [2019-11-07 00:42:02,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:42:02,444 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 968 transitions. [2019-11-07 00:42:02,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-07 00:42:02,446 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:02,446 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:02,446 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:02,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:02,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1512255588, now seen corresponding path program 1 times [2019-11-07 00:42:02,447 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:02,447 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675898131] [2019-11-07 00:42:02,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:02,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:02,562 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675898131] [2019-11-07 00:42:02,563 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:02,563 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:42:02,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149793078] [2019-11-07 00:42:02,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:42:02,563 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:02,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:42:02,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:42:02,564 INFO L87 Difference]: Start difference. First operand 613 states and 968 transitions. Second operand 6 states. [2019-11-07 00:42:02,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:02,977 INFO L93 Difference]: Finished difference Result 1147 states and 1825 transitions. [2019-11-07 00:42:02,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:42:02,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-11-07 00:42:02,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:02,982 INFO L225 Difference]: With dead ends: 1147 [2019-11-07 00:42:02,982 INFO L226 Difference]: Without dead ends: 613 [2019-11-07 00:42:02,985 INFO L630 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-11-07 00:42:02,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-11-07 00:42:03,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-11-07 00:42:03,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-11-07 00:42:03,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 964 transitions. [2019-11-07 00:42:03,009 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 964 transitions. Word has length 93 [2019-11-07 00:42:03,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:03,009 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 964 transitions. [2019-11-07 00:42:03,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:42:03,009 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 964 transitions. [2019-11-07 00:42:03,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-07 00:42:03,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:03,011 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:03,011 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:03,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:03,012 INFO L82 PathProgramCache]: Analyzing trace with hash 917220790, now seen corresponding path program 1 times [2019-11-07 00:42:03,012 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:03,012 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554308747] [2019-11-07 00:42:03,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:03,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:03,127 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554308747] [2019-11-07 00:42:03,128 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:03,128 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:42:03,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390206990] [2019-11-07 00:42:03,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:42:03,129 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:03,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:42:03,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:42:03,129 INFO L87 Difference]: Start difference. First operand 613 states and 964 transitions. Second operand 6 states. [2019-11-07 00:42:03,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:03,318 INFO L93 Difference]: Finished difference Result 1147 states and 1821 transitions. [2019-11-07 00:42:03,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:42:03,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-11-07 00:42:03,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:03,324 INFO L225 Difference]: With dead ends: 1147 [2019-11-07 00:42:03,324 INFO L226 Difference]: Without dead ends: 613 [2019-11-07 00:42:03,327 INFO L630 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-11-07 00:42:03,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-11-07 00:42:03,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-11-07 00:42:03,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-11-07 00:42:03,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 960 transitions. [2019-11-07 00:42:03,349 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 960 transitions. Word has length 94 [2019-11-07 00:42:03,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:03,349 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 960 transitions. [2019-11-07 00:42:03,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:42:03,350 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 960 transitions. [2019-11-07 00:42:03,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-07 00:42:03,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:03,353 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:03,354 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:03,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:03,354 INFO L82 PathProgramCache]: Analyzing trace with hash -387785559, now seen corresponding path program 1 times [2019-11-07 00:42:03,354 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:03,355 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927196206] [2019-11-07 00:42:03,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:03,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:03,474 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927196206] [2019-11-07 00:42:03,475 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:03,475 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:42:03,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075513788] [2019-11-07 00:42:03,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:42:03,476 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:03,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:42:03,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:42:03,476 INFO L87 Difference]: Start difference. First operand 613 states and 960 transitions. Second operand 6 states. [2019-11-07 00:42:03,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:03,673 INFO L93 Difference]: Finished difference Result 1147 states and 1817 transitions. [2019-11-07 00:42:03,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:42:03,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-07 00:42:03,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:03,678 INFO L225 Difference]: With dead ends: 1147 [2019-11-07 00:42:03,678 INFO L226 Difference]: Without dead ends: 613 [2019-11-07 00:42:03,681 INFO L630 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-11-07 00:42:03,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-11-07 00:42:03,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-11-07 00:42:03,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-11-07 00:42:03,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 956 transitions. [2019-11-07 00:42:03,701 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 956 transitions. Word has length 95 [2019-11-07 00:42:03,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:03,702 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 956 transitions. [2019-11-07 00:42:03,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:42:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 956 transitions. [2019-11-07 00:42:03,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-07 00:42:03,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:03,704 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:03,704 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:03,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:03,704 INFO L82 PathProgramCache]: Analyzing trace with hash 660068649, now seen corresponding path program 1 times [2019-11-07 00:42:03,704 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:03,705 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492586655] [2019-11-07 00:42:03,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:03,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:03,904 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492586655] [2019-11-07 00:42:03,905 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:03,905 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-07 00:42:03,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684342287] [2019-11-07 00:42:03,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-07 00:42:03,907 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:03,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-07 00:42:03,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:42:03,908 INFO L87 Difference]: Start difference. First operand 613 states and 956 transitions. Second operand 7 states. [2019-11-07 00:42:04,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:04,007 INFO L93 Difference]: Finished difference Result 1147 states and 1813 transitions. [2019-11-07 00:42:04,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-07 00:42:04,008 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-11-07 00:42:04,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:04,013 INFO L225 Difference]: With dead ends: 1147 [2019-11-07 00:42:04,013 INFO L226 Difference]: Without dead ends: 592 [2019-11-07 00:42:04,016 INFO L630 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-11-07 00:42:04,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-11-07 00:42:04,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-11-07 00:42:04,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-07 00:42:04,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 922 transitions. [2019-11-07 00:42:04,037 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 922 transitions. Word has length 95 [2019-11-07 00:42:04,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:04,037 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 922 transitions. [2019-11-07 00:42:04,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-07 00:42:04,038 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 922 transitions. [2019-11-07 00:42:04,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-07 00:42:04,039 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:04,040 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:04,040 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:04,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:04,040 INFO L82 PathProgramCache]: Analyzing trace with hash 2067893787, now seen corresponding path program 1 times [2019-11-07 00:42:04,040 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:04,041 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913998130] [2019-11-07 00:42:04,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:04,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:04,187 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913998130] [2019-11-07 00:42:04,187 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:04,187 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:42:04,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879450766] [2019-11-07 00:42:04,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:42:04,189 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:04,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:42:04,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:42:04,189 INFO L87 Difference]: Start difference. First operand 592 states and 922 transitions. Second operand 6 states. [2019-11-07 00:42:04,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:04,290 INFO L93 Difference]: Finished difference Result 1126 states and 1779 transitions. [2019-11-07 00:42:04,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:42:04,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-11-07 00:42:04,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:04,295 INFO L225 Difference]: With dead ends: 1126 [2019-11-07 00:42:04,296 INFO L226 Difference]: Without dead ends: 592 [2019-11-07 00:42:04,298 INFO L630 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-11-07 00:42:04,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-11-07 00:42:04,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-11-07 00:42:04,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-07 00:42:04,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 921 transitions. [2019-11-07 00:42:04,318 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 921 transitions. Word has length 96 [2019-11-07 00:42:04,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:04,318 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 921 transitions. [2019-11-07 00:42:04,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:42:04,319 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 921 transitions. [2019-11-07 00:42:04,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-07 00:42:04,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:04,320 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:04,320 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:04,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:04,321 INFO L82 PathProgramCache]: Analyzing trace with hash 845745390, now seen corresponding path program 1 times [2019-11-07 00:42:04,321 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:04,321 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44127119] [2019-11-07 00:42:04,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:04,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:04,439 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44127119] [2019-11-07 00:42:04,439 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:04,439 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:42:04,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583087175] [2019-11-07 00:42:04,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:42:04,440 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:04,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:42:04,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:42:04,441 INFO L87 Difference]: Start difference. First operand 592 states and 921 transitions. Second operand 6 states. [2019-11-07 00:42:04,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:04,545 INFO L93 Difference]: Finished difference Result 1126 states and 1778 transitions. [2019-11-07 00:42:04,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:42:04,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-11-07 00:42:04,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:04,550 INFO L225 Difference]: With dead ends: 1126 [2019-11-07 00:42:04,550 INFO L226 Difference]: Without dead ends: 592 [2019-11-07 00:42:04,553 INFO L630 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-11-07 00:42:04,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-11-07 00:42:04,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-11-07 00:42:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-07 00:42:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 920 transitions. [2019-11-07 00:42:04,571 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 920 transitions. Word has length 97 [2019-11-07 00:42:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:04,571 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 920 transitions. [2019-11-07 00:42:04,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:42:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 920 transitions. [2019-11-07 00:42:04,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-07 00:42:04,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:04,573 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:04,573 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:04,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:04,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1559535234, now seen corresponding path program 1 times [2019-11-07 00:42:04,574 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:04,574 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847342160] [2019-11-07 00:42:04,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:04,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:04,724 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847342160] [2019-11-07 00:42:04,724 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:04,724 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:42:04,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368963821] [2019-11-07 00:42:04,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:42:04,726 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:04,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:42:04,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:42:04,726 INFO L87 Difference]: Start difference. First operand 592 states and 920 transitions. Second operand 4 states. [2019-11-07 00:42:04,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:04,792 INFO L93 Difference]: Finished difference Result 1126 states and 1777 transitions. [2019-11-07 00:42:04,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:42:04,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-07 00:42:04,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:04,799 INFO L225 Difference]: With dead ends: 1126 [2019-11-07 00:42:04,800 INFO L226 Difference]: Without dead ends: 592 [2019-11-07 00:42:04,804 INFO L630 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-11-07 00:42:04,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-11-07 00:42:04,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-11-07 00:42:04,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-07 00:42:04,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 919 transitions. [2019-11-07 00:42:04,829 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 919 transitions. Word has length 98 [2019-11-07 00:42:04,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:04,829 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 919 transitions. [2019-11-07 00:42:04,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:42:04,830 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 919 transitions. [2019-11-07 00:42:04,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-07 00:42:04,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:04,832 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:04,832 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:04,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:04,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1575053952, now seen corresponding path program 1 times [2019-11-07 00:42:04,833 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:04,833 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896970701] [2019-11-07 00:42:04,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:05,068 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896970701] [2019-11-07 00:42:05,068 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:05,068 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 00:42:05,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805726653] [2019-11-07 00:42:05,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 00:42:05,069 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:05,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 00:42:05,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-07 00:42:05,070 INFO L87 Difference]: Start difference. First operand 592 states and 919 transitions. Second operand 12 states. [2019-11-07 00:42:05,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:05,249 INFO L93 Difference]: Finished difference Result 1127 states and 1776 transitions. [2019-11-07 00:42:05,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-07 00:42:05,250 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-11-07 00:42:05,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:05,254 INFO L225 Difference]: With dead ends: 1127 [2019-11-07 00:42:05,255 INFO L226 Difference]: Without dead ends: 592 [2019-11-07 00:42:05,257 INFO L630 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-11-07 00:42:05,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-11-07 00:42:05,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-11-07 00:42:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-07 00:42:05,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 918 transitions. [2019-11-07 00:42:05,277 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 918 transitions. Word has length 98 [2019-11-07 00:42:05,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:05,277 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 918 transitions. [2019-11-07 00:42:05,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 00:42:05,278 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 918 transitions. [2019-11-07 00:42:05,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-07 00:42:05,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:05,279 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 00:42:05,280 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:05,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:05,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1898679017, now seen corresponding path program 1 times [2019-11-07 00:42:05,280 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:05,280 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512424455] [2019-11-07 00:42:05,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:05,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:42:05,465 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512424455] [2019-11-07 00:42:05,467 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:05,467 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 00:42:05,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569605501] [2019-11-07 00:42:05,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:42:05,468 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:05,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:42:05,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-07 00:42:05,469 INFO L87 Difference]: Start difference. First operand 592 states and 918 transitions. Second operand 6 states. [2019-11-07 00:42:09,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:09,007 INFO L93 Difference]: Finished difference Result 1754 states and 2806 transitions. [2019-11-07 00:42:09,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:42:09,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-11-07 00:42:09,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:09,017 INFO L225 Difference]: With dead ends: 1754 [2019-11-07 00:42:09,018 INFO L226 Difference]: Without dead ends: 1228 [2019-11-07 00:42:09,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:42:09,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-11-07 00:42:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1103. [2019-11-07 00:42:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2019-11-07 00:42:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1757 transitions. [2019-11-07 00:42:09,072 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1757 transitions. Word has length 99 [2019-11-07 00:42:09,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:09,073 INFO L462 AbstractCegarLoop]: Abstraction has 1103 states and 1757 transitions. [2019-11-07 00:42:09,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:42:09,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1757 transitions. [2019-11-07 00:42:09,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-07 00:42:09,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:09,078 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:09,079 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:09,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:09,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1662557516, now seen corresponding path program 1 times [2019-11-07 00:42:09,079 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:09,079 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729495148] [2019-11-07 00:42:09,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-07 00:42:09,268 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729495148] [2019-11-07 00:42:09,268 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:42:09,268 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-07 00:42:09,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263043334] [2019-11-07 00:42:09,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-07 00:42:09,269 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:09,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-07 00:42:09,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-07 00:42:09,270 INFO L87 Difference]: Start difference. First operand 1103 states and 1757 transitions. Second operand 12 states. [2019-11-07 00:42:19,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:19,956 INFO L93 Difference]: Finished difference Result 3586 states and 5731 transitions. [2019-11-07 00:42:19,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-07 00:42:19,956 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 157 [2019-11-07 00:42:19,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:19,974 INFO L225 Difference]: With dead ends: 3586 [2019-11-07 00:42:19,974 INFO L226 Difference]: Without dead ends: 2549 [2019-11-07 00:42:19,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-11-07 00:42:19,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2019-11-07 00:42:20,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2491. [2019-11-07 00:42:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2491 states. [2019-11-07 00:42:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2491 states to 2491 states and 3938 transitions. [2019-11-07 00:42:20,120 INFO L78 Accepts]: Start accepts. Automaton has 2491 states and 3938 transitions. Word has length 157 [2019-11-07 00:42:20,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:20,121 INFO L462 AbstractCegarLoop]: Abstraction has 2491 states and 3938 transitions. [2019-11-07 00:42:20,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-07 00:42:20,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2491 states and 3938 transitions. [2019-11-07 00:42:20,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-07 00:42:20,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:20,126 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:20,127 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:20,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:20,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1568685766, now seen corresponding path program 1 times [2019-11-07 00:42:20,128 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:20,128 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550967442] [2019-11-07 00:42:20,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:20,284 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:42:20,284 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550967442] [2019-11-07 00:42:20,284 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142023689] [2019-11-07 00:42:20,285 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-11-07 00:42:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:20,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 3053 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-07 00:42:20,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:42:20,969 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:42:20,970 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:42:22,114 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:42:22,114 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 00:42:22,114 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-11-07 00:42:22,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080471287] [2019-11-07 00:42:22,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:42:22,116 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:22,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:42:22,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-07 00:42:22,117 INFO L87 Difference]: Start difference. First operand 2491 states and 3938 transitions. Second operand 5 states. [2019-11-07 00:42:22,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:22,998 INFO L93 Difference]: Finished difference Result 4980 states and 8084 transitions. [2019-11-07 00:42:22,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:42:22,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-11-07 00:42:23,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:23,023 INFO L225 Difference]: With dead ends: 4980 [2019-11-07 00:42:23,024 INFO L226 Difference]: Without dead ends: 2555 [2019-11-07 00:42:23,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 302 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-11-07 00:42:23,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2019-11-07 00:42:23,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 2555. [2019-11-07 00:42:23,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2555 states. [2019-11-07 00:42:23,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 4040 transitions. [2019-11-07 00:42:23,150 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 4040 transitions. Word has length 158 [2019-11-07 00:42:23,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:23,151 INFO L462 AbstractCegarLoop]: Abstraction has 2555 states and 4040 transitions. [2019-11-07 00:42:23,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:42:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 4040 transitions. [2019-11-07 00:42:23,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-07 00:42:23,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:23,156 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:23,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:42:23,365 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:23,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:23,366 INFO L82 PathProgramCache]: Analyzing trace with hash -633101954, now seen corresponding path program 1 times [2019-11-07 00:42:23,366 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:23,366 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595335665] [2019-11-07 00:42:23,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:42:23,523 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595335665] [2019-11-07 00:42:23,523 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709244495] [2019-11-07 00:42:23,524 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-11-07 00:42:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:24,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 3055 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-07 00:42:24,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:42:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:42:24,242 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:42:25,087 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:42:25,087 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 00:42:25,087 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-11-07 00:42:25,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554345236] [2019-11-07 00:42:25,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:42:25,088 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:25,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:42:25,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-07 00:42:25,089 INFO L87 Difference]: Start difference. First operand 2555 states and 4040 transitions. Second operand 5 states. [2019-11-07 00:42:25,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:25,919 INFO L93 Difference]: Finished difference Result 5108 states and 8270 transitions. [2019-11-07 00:42:25,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:42:25,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-11-07 00:42:25,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:25,936 INFO L225 Difference]: With dead ends: 5108 [2019-11-07 00:42:25,936 INFO L226 Difference]: Without dead ends: 2619 [2019-11-07 00:42:25,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 306 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-11-07 00:42:25,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2619 states. [2019-11-07 00:42:26,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2619 to 2619. [2019-11-07 00:42:26,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2619 states. [2019-11-07 00:42:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2619 states and 4142 transitions. [2019-11-07 00:42:26,054 INFO L78 Accepts]: Start accepts. Automaton has 2619 states and 4142 transitions. Word has length 160 [2019-11-07 00:42:26,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:26,055 INFO L462 AbstractCegarLoop]: Abstraction has 2619 states and 4142 transitions. [2019-11-07 00:42:26,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:42:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 4142 transitions. [2019-11-07 00:42:26,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-11-07 00:42:26,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:26,060 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:26,267 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:42:26,267 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:26,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:26,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1116163654, now seen corresponding path program 1 times [2019-11-07 00:42:26,268 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:26,268 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657881948] [2019-11-07 00:42:26,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:26,428 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:42:26,428 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657881948] [2019-11-07 00:42:26,429 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830446815] [2019-11-07 00:42:26,429 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-11-07 00:42:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:27,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 3057 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-07 00:42:27,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:42:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:42:27,286 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:42:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:42:28,144 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 00:42:28,144 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-11-07 00:42:28,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49074056] [2019-11-07 00:42:28,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:42:28,145 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:42:28,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:42:28,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-07 00:42:28,145 INFO L87 Difference]: Start difference. First operand 2619 states and 4142 transitions. Second operand 5 states. [2019-11-07 00:42:29,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:42:29,067 INFO L93 Difference]: Finished difference Result 5236 states and 8456 transitions. [2019-11-07 00:42:29,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:42:29,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2019-11-07 00:42:29,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:42:29,084 INFO L225 Difference]: With dead ends: 5236 [2019-11-07 00:42:29,084 INFO L226 Difference]: Without dead ends: 2683 [2019-11-07 00:42:29,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 310 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-11-07 00:42:29,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2683 states. [2019-11-07 00:42:29,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2683 to 2683. [2019-11-07 00:42:29,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2683 states. [2019-11-07 00:42:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2683 states to 2683 states and 4244 transitions. [2019-11-07 00:42:29,259 INFO L78 Accepts]: Start accepts. Automaton has 2683 states and 4244 transitions. Word has length 162 [2019-11-07 00:42:29,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:42:29,259 INFO L462 AbstractCegarLoop]: Abstraction has 2683 states and 4244 transitions. [2019-11-07 00:42:29,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:42:29,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2683 states and 4244 transitions. [2019-11-07 00:42:29,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-07 00:42:29,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:42:29,265 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:42:29,472 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:42:29,472 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:42:29,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:42:29,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1413320822, now seen corresponding path program 1 times [2019-11-07 00:42:29,473 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:42:29,473 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125226710] [2019-11-07 00:42:29,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:42:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:29,635 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:42:29,635 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125226710] [2019-11-07 00:42:29,635 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656667466] [2019-11-07 00:42:29,636 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-11-07 00:42:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:42:30,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 3059 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-07 00:42:30,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:42:30,428 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-07 00:42:30,429 INFO L321 TraceCheckSpWp]: Computing backward predicates...