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 -i ../../../trunk/examples/svcomp/product-lines/elevator_spec1_product20.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:03:46,119 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:03:46,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:03:46,132 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:03:46,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:03:46,134 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:03:46,135 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:03:46,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:03:46,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:03:46,139 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:03:46,140 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:03:46,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:03:46,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:03:46,142 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:03:46,143 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:03:46,144 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:03:46,145 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:03:46,146 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:03:46,148 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:03:46,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:03:46,151 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:03:46,152 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:03:46,153 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:03:46,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:03:46,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:03:46,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:03:46,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:03:46,157 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:03:46,157 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:03:46,158 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:03:46,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:03:46,159 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:03:46,160 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:03:46,161 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:03:46,162 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:03:46,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:03:46,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:03:46,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:03:46,163 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:03:46,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:03:46,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:03:46,165 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 12:03:46,179 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:03:46,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:03:46,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:03:46,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:03:46,181 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:03:46,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:03:46,181 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:03:46,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:03:46,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:03:46,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:03:46,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:03:46,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:03:46,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:03:46,182 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:03:46,183 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:03:46,183 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:03:46,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:03:46,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:03:46,184 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:03:46,184 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:03:46,184 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:03:46,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:03:46,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:03:46,185 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:03:46,185 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:03:46,185 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:03:46,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:03:46,185 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:03:46,185 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:03:46,212 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:03:46,225 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:03:46,228 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:03:46,229 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:03:46,230 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:03:46,230 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product20.cil.c [2019-10-02 12:03:46,293 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff8adedc/c9c3bf1c38334554b57dfe702e1a5d5f/FLAG22de0c101 [2019-10-02 12:03:47,010 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:03:47,012 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product20.cil.c [2019-10-02 12:03:47,045 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff8adedc/c9c3bf1c38334554b57dfe702e1a5d5f/FLAG22de0c101 [2019-10-02 12:03:47,111 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff8adedc/c9c3bf1c38334554b57dfe702e1a5d5f [2019-10-02 12:03:47,122 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:03:47,123 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:03:47,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:03:47,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:03:47,127 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:03:47,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:03:47" (1/1) ... [2019-10-02 12:03:47,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@616dfd38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:47, skipping insertion in model container [2019-10-02 12:03:47,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:03:47" (1/1) ... [2019-10-02 12:03:47,138 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:03:47,213 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:03:47,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:03:47,993 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:03:48,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:03:48,273 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:03:48,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:48 WrapperNode [2019-10-02 12:03:48,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:03:48,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:03:48,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:03:48,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:03:48,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:48" (1/1) ... [2019-10-02 12:03:48,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:48" (1/1) ... [2019-10-02 12:03:48,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:48" (1/1) ... [2019-10-02 12:03:48,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:48" (1/1) ... [2019-10-02 12:03:48,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:48" (1/1) ... [2019-10-02 12:03:48,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:48" (1/1) ... [2019-10-02 12:03:48,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:48" (1/1) ... [2019-10-02 12:03:48,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:03:48,499 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:03:48,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:03:48,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:03:48,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:03:48,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:03:48,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:03:48,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:03:48,578 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:03:48,579 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:03:48,580 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:03:48,580 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:03:48,580 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:03:48,581 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:03:48,581 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:03:48,581 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:03:48,582 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:03:48,582 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:03:48,583 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:03:48,583 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:03:48,584 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:03:48,586 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:03:48,586 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:03:48,586 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:03:48,586 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 12:03:48,587 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:03:48,587 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:03:48,587 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:03:48,588 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 12:03:48,588 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:03:48,588 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:03:48,588 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:03:48,589 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-10-02 12:03:48,589 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:03:48,589 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-10-02 12:03:48,590 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:03:48,590 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:03:48,590 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 12:03:48,590 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 12:03:48,591 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:03:48,591 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:03:48,591 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:03:48,591 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:03:48,592 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:03:48,592 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:03:48,592 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:03:48,592 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:03:48,593 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:03:48,593 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:03:48,593 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:03:48,593 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:03:48,594 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:03:48,594 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:03:48,594 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:03:48,594 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:03:48,594 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:03:48,594 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:03:48,595 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:03:48,595 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:03:48,595 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:03:48,595 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:03:48,595 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:03:48,595 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:03:48,596 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:03:48,596 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:03:48,596 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:03:48,596 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:03:48,596 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:03:48,596 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:03:48,596 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:03:48,597 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:03:48,597 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:03:48,597 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:03:48,597 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:03:48,598 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:03:48,598 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:03:48,598 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:03:48,598 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:03:48,598 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:03:48,599 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:03:48,599 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:03:48,600 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:03:48,600 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:03:48,600 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:03:48,600 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:03:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:03:48,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:03:48,601 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:03:48,601 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:03:48,601 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:03:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:03:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:03:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:03:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:03:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:03:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:03:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:03:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:03:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:03:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:03:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:03:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:03:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:03:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:03:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:03:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:03:48,605 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:03:48,606 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:03:48,606 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 12:03:48,606 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 12:03:48,606 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:03:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:03:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:03:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:03:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:03:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:03:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:03:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 12:03:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:03:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:03:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 12:03:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:03:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:03:48,610 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:03:48,610 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-10-02 12:03:48,611 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:03:48,611 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-10-02 12:03:48,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:03:48,612 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:03:48,613 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:03:48,613 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:03:48,613 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:03:48,613 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:03:48,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:03:48,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:03:48,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:03:48,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:03:48,615 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:03:48,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:03:48,615 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:03:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:03:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:03:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:03:48,616 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:03:48,617 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:03:48,620 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:03:48,621 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:03:48,622 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:03:48,622 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:03:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:03:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:03:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:03:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:03:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:03:48,630 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:03:48,630 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:03:48,630 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:03:48,630 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:03:48,630 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:03:48,630 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:03:48,630 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:03:48,630 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:03:48,631 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:03:48,631 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:03:48,631 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:03:48,631 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:03:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:03:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:03:48,632 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:03:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:03:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:03:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:03:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:03:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:03:48,633 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:03:48,634 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:03:48,634 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:03:48,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:03:48,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:03:48,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:03:51,162 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:03:51,162 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:03:51,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:03:51 BoogieIcfgContainer [2019-10-02 12:03:51,165 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:03:51,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:03:51,167 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:03:51,171 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:03:51,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:03:47" (1/3) ... [2019-10-02 12:03:51,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d2d993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:03:51, skipping insertion in model container [2019-10-02 12:03:51,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:48" (2/3) ... [2019-10-02 12:03:51,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d2d993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:03:51, skipping insertion in model container [2019-10-02 12:03:51,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:03:51" (3/3) ... [2019-10-02 12:03:51,176 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product20.cil.c [2019-10-02 12:03:51,188 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:03:51,203 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:03:51,221 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:03:51,271 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:03:51,272 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:03:51,272 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:03:51,272 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:03:51,272 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:03:51,272 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:03:51,273 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:03:51,273 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:03:51,273 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:03:51,320 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states. [2019-10-02 12:03:51,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 12:03:51,348 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:51,350 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:51,353 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:51,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:51,359 INFO L82 PathProgramCache]: Analyzing trace with hash 669576515, now seen corresponding path program 1 times [2019-10-02 12:03:51,361 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:51,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:51,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:51,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:51,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:52,058 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:03:52,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:52,061 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:03:52,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:52,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 3176 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-02 12:03:52,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:52,829 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:03:52,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:52,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-10-02 12:03:52,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:03:52,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:03:52,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:03:52,874 INFO L87 Difference]: Start difference. First operand 787 states. Second operand 4 states. [2019-10-02 12:03:53,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:53,095 INFO L93 Difference]: Finished difference Result 1244 states and 2003 transitions. [2019-10-02 12:03:53,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:03:53,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-02 12:03:53,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:53,133 INFO L225 Difference]: With dead ends: 1244 [2019-10-02 12:03:53,133 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 12:03:53,146 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:03:53,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 12:03:53,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 12:03:53,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 12:03:53,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 995 transitions. [2019-10-02 12:03:53,278 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 995 transitions. Word has length 116 [2019-10-02 12:03:53,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:53,279 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 995 transitions. [2019-10-02 12:03:53,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:03:53,279 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 995 transitions. [2019-10-02 12:03:53,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-02 12:03:53,283 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:53,283 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:53,284 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:53,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:53,284 INFO L82 PathProgramCache]: Analyzing trace with hash 963635798, now seen corresponding path program 1 times [2019-10-02 12:03:53,284 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:53,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:53,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:53,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:53,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:03:53,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:53,513 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:03:53,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:54,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 3181 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:03:54,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:54,235 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:03:54,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:54,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:03:54,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:03:54,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:03:54,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:03:54,249 INFO L87 Difference]: Start difference. First operand 626 states and 995 transitions. Second operand 6 states. [2019-10-02 12:03:54,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:54,397 INFO L93 Difference]: Finished difference Result 1224 states and 1963 transitions. [2019-10-02 12:03:54,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:03:54,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-10-02 12:03:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:54,412 INFO L225 Difference]: With dead ends: 1224 [2019-10-02 12:03:54,412 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 12:03:54,416 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:03:54,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 12:03:54,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 12:03:54,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 12:03:54,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 994 transitions. [2019-10-02 12:03:54,484 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 994 transitions. Word has length 120 [2019-10-02 12:03:54,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:54,486 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 994 transitions. [2019-10-02 12:03:54,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:03:54,486 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 994 transitions. [2019-10-02 12:03:54,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-02 12:03:54,496 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:54,496 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:54,496 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:54,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:54,497 INFO L82 PathProgramCache]: Analyzing trace with hash 684702014, now seen corresponding path program 1 times [2019-10-02 12:03:54,497 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:54,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:54,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:54,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:54,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:54,663 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:03:54,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:54,664 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:03:54,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:55,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 3183 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:03:55,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:55,276 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:03:55,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:55,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:03:55,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:03:55,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:03:55,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:03:55,285 INFO L87 Difference]: Start difference. First operand 626 states and 994 transitions. Second operand 6 states. [2019-10-02 12:03:55,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:55,392 INFO L93 Difference]: Finished difference Result 1228 states and 1966 transitions. [2019-10-02 12:03:55,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:03:55,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-10-02 12:03:55,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:55,398 INFO L225 Difference]: With dead ends: 1228 [2019-10-02 12:03:55,399 INFO L226 Difference]: Without dead ends: 632 [2019-10-02 12:03:55,401 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:03:55,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-10-02 12:03:55,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-10-02 12:03:55,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-02 12:03:55,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 999 transitions. [2019-10-02 12:03:55,445 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 999 transitions. Word has length 122 [2019-10-02 12:03:55,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:55,445 INFO L475 AbstractCegarLoop]: Abstraction has 632 states and 999 transitions. [2019-10-02 12:03:55,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:03:55,446 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 999 transitions. [2019-10-02 12:03:55,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 12:03:55,448 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:55,449 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:55,449 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:55,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:55,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1568855861, now seen corresponding path program 1 times [2019-10-02 12:03:55,450 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:55,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:55,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:55,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:55,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:03:55,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:55,629 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:03:55,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:56,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 3184 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:03:56,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:56,294 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:03:56,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:56,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:03:56,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:03:56,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:03:56,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:03:56,315 INFO L87 Difference]: Start difference. First operand 632 states and 999 transitions. Second operand 6 states. [2019-10-02 12:03:56,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:56,420 INFO L93 Difference]: Finished difference Result 1227 states and 1957 transitions. [2019-10-02 12:03:56,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:03:56,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-10-02 12:03:56,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:56,440 INFO L225 Difference]: With dead ends: 1227 [2019-10-02 12:03:56,440 INFO L226 Difference]: Without dead ends: 632 [2019-10-02 12:03:56,446 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:03:56,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-10-02 12:03:56,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-10-02 12:03:56,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-02 12:03:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 998 transitions. [2019-10-02 12:03:56,474 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 998 transitions. Word has length 123 [2019-10-02 12:03:56,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:56,475 INFO L475 AbstractCegarLoop]: Abstraction has 632 states and 998 transitions. [2019-10-02 12:03:56,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:03:56,475 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 998 transitions. [2019-10-02 12:03:56,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-02 12:03:56,478 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:56,478 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:56,478 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:56,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:56,479 INFO L82 PathProgramCache]: Analyzing trace with hash 43826914, now seen corresponding path program 1 times [2019-10-02 12:03:56,479 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:56,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:56,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:56,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:56,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:56,603 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:03:56,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:56,603 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:03:56,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:57,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 3185 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:03:57,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:57,231 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:03:57,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:57,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:03:57,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:03:57,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:03:57,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:03:57,244 INFO L87 Difference]: Start difference. First operand 632 states and 998 transitions. Second operand 6 states. [2019-10-02 12:03:57,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:57,346 INFO L93 Difference]: Finished difference Result 1227 states and 1956 transitions. [2019-10-02 12:03:57,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:03:57,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2019-10-02 12:03:57,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:57,352 INFO L225 Difference]: With dead ends: 1227 [2019-10-02 12:03:57,352 INFO L226 Difference]: Without dead ends: 632 [2019-10-02 12:03:57,355 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:03:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-10-02 12:03:57,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-10-02 12:03:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-02 12:03:57,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 997 transitions. [2019-10-02 12:03:57,435 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 997 transitions. Word has length 124 [2019-10-02 12:03:57,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:57,436 INFO L475 AbstractCegarLoop]: Abstraction has 632 states and 997 transitions. [2019-10-02 12:03:57,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:03:57,436 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 997 transitions. [2019-10-02 12:03:57,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-02 12:03:57,439 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:57,439 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:57,439 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:57,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:57,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1250885551, now seen corresponding path program 1 times [2019-10-02 12:03:57,440 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:57,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:57,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:57,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:57,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:57,628 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:03:57,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:57,629 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:03:57,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:58,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 3186 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 12:03:58,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:58,251 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:03:58,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:58,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2019-10-02 12:03:58,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:03:58,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:03:58,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:03:58,262 INFO L87 Difference]: Start difference. First operand 632 states and 997 transitions. Second operand 15 states. [2019-10-02 12:03:58,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:58,489 INFO L93 Difference]: Finished difference Result 1232 states and 1963 transitions. [2019-10-02 12:03:58,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:03:58,490 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 125 [2019-10-02 12:03:58,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:58,498 INFO L225 Difference]: With dead ends: 1232 [2019-10-02 12:03:58,499 INFO L226 Difference]: Without dead ends: 641 [2019-10-02 12:03:58,505 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:03:58,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-10-02 12:03:58,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 639. [2019-10-02 12:03:58,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-02 12:03:58,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 1007 transitions. [2019-10-02 12:03:58,536 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 1007 transitions. Word has length 125 [2019-10-02 12:03:58,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:58,538 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 1007 transitions. [2019-10-02 12:03:58,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:03:58,538 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1007 transitions. [2019-10-02 12:03:58,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-02 12:03:58,541 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:58,541 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:58,542 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:58,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:58,542 INFO L82 PathProgramCache]: Analyzing trace with hash 865518768, now seen corresponding path program 1 times [2019-10-02 12:03:58,542 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:58,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:58,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:58,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:58,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:03:58,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:58,667 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:03:58,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:59,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 3185 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:03:59,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:59,277 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:03:59,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:59,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:03:59,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:03:59,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:03:59,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:03:59,286 INFO L87 Difference]: Start difference. First operand 639 states and 1007 transitions. Second operand 6 states. [2019-10-02 12:03:59,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:59,654 INFO L93 Difference]: Finished difference Result 1239 states and 1974 transitions. [2019-10-02 12:03:59,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:03:59,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2019-10-02 12:03:59,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:59,663 INFO L225 Difference]: With dead ends: 1239 [2019-10-02 12:03:59,663 INFO L226 Difference]: Without dead ends: 635 [2019-10-02 12:03:59,667 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:03:59,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-02 12:03:59,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-10-02 12:03:59,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-02 12:03:59,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 995 transitions. [2019-10-02 12:03:59,701 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 995 transitions. Word has length 125 [2019-10-02 12:03:59,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:59,702 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 995 transitions. [2019-10-02 12:03:59,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:03:59,702 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 995 transitions. [2019-10-02 12:03:59,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-02 12:03:59,707 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:59,707 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:59,712 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:59,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:59,712 INFO L82 PathProgramCache]: Analyzing trace with hash -162638701, now seen corresponding path program 1 times [2019-10-02 12:03:59,712 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:59,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:59,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:59,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:59,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:59,849 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:03:59,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:59,850 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:03:59,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:00,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 3189 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:00,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:04:00,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:00,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:04:00,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:04:00,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:04:00,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:00,448 INFO L87 Difference]: Start difference. First operand 635 states and 995 transitions. Second operand 8 states. [2019-10-02 12:04:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:00,700 INFO L93 Difference]: Finished difference Result 1235 states and 1957 transitions. [2019-10-02 12:04:00,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:04:00,700 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 128 [2019-10-02 12:04:00,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:00,706 INFO L225 Difference]: With dead ends: 1235 [2019-10-02 12:04:00,706 INFO L226 Difference]: Without dead ends: 635 [2019-10-02 12:04:00,709 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:04:00,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-02 12:04:00,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-10-02 12:04:00,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-02 12:04:00,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 990 transitions. [2019-10-02 12:04:00,740 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 990 transitions. Word has length 128 [2019-10-02 12:04:00,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:00,740 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 990 transitions. [2019-10-02 12:04:00,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:04:00,740 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 990 transitions. [2019-10-02 12:04:00,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 12:04:00,742 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:00,742 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:00,742 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:00,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:00,743 INFO L82 PathProgramCache]: Analyzing trace with hash 2001392257, now seen corresponding path program 1 times [2019-10-02 12:04:00,743 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:00,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:00,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:00,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:00,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:00,865 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:04:00,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:00,865 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:00,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:01,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 3191 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:01,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:01,431 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:04:01,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:01,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:04:01,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:04:01,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:04:01,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:01,439 INFO L87 Difference]: Start difference. First operand 635 states and 990 transitions. Second operand 8 states. [2019-10-02 12:04:01,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:01,773 INFO L93 Difference]: Finished difference Result 1256 states and 1978 transitions. [2019-10-02 12:04:01,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:04:01,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 130 [2019-10-02 12:04:01,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:01,779 INFO L225 Difference]: With dead ends: 1256 [2019-10-02 12:04:01,779 INFO L226 Difference]: Without dead ends: 653 [2019-10-02 12:04:01,782 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:04:01,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-10-02 12:04:01,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 650. [2019-10-02 12:04:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-10-02 12:04:01,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1003 transitions. [2019-10-02 12:04:01,807 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1003 transitions. Word has length 130 [2019-10-02 12:04:01,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:01,808 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 1003 transitions. [2019-10-02 12:04:01,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:04:01,808 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1003 transitions. [2019-10-02 12:04:01,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 12:04:01,810 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:01,810 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:01,810 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:01,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:01,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1601209857, now seen corresponding path program 1 times [2019-10-02 12:04:01,811 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:01,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:01,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:01,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:01,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:04:01,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:01,992 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:02,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:02,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 3187 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 12:04:02,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:02,717 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:04:02,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:02,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 12:04:02,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:04:02,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:04:02,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:04:02,727 INFO L87 Difference]: Start difference. First operand 650 states and 1003 transitions. Second operand 14 states. [2019-10-02 12:04:03,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:03,094 INFO L93 Difference]: Finished difference Result 1246 states and 1943 transitions. [2019-10-02 12:04:03,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:04:03,095 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 130 [2019-10-02 12:04:03,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:03,102 INFO L225 Difference]: With dead ends: 1246 [2019-10-02 12:04:03,102 INFO L226 Difference]: Without dead ends: 644 [2019-10-02 12:04:03,107 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:04:03,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-10-02 12:04:03,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 639. [2019-10-02 12:04:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-02 12:04:03,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 983 transitions. [2019-10-02 12:04:03,147 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 983 transitions. Word has length 130 [2019-10-02 12:04:03,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:03,148 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 983 transitions. [2019-10-02 12:04:03,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:04:03,148 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 983 transitions. [2019-10-02 12:04:03,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-02 12:04:03,152 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:03,152 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:03,152 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:03,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:03,153 INFO L82 PathProgramCache]: Analyzing trace with hash -989287389, now seen corresponding path program 1 times [2019-10-02 12:04:03,153 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:03,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:03,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:03,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:03,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:04:03,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:03,316 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:03,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:03,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 3194 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:03,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:04:03,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:03,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:04:03,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:04:03,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:04:03,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:03,934 INFO L87 Difference]: Start difference. First operand 639 states and 983 transitions. Second operand 8 states. [2019-10-02 12:04:04,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:04,124 INFO L93 Difference]: Finished difference Result 1228 states and 1912 transitions. [2019-10-02 12:04:04,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:04:04,124 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 133 [2019-10-02 12:04:04,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:04,129 INFO L225 Difference]: With dead ends: 1228 [2019-10-02 12:04:04,129 INFO L226 Difference]: Without dead ends: 639 [2019-10-02 12:04:04,132 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:04:04,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-10-02 12:04:04,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-10-02 12:04:04,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-02 12:04:04,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 982 transitions. [2019-10-02 12:04:04,198 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 982 transitions. Word has length 133 [2019-10-02 12:04:04,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:04,199 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 982 transitions. [2019-10-02 12:04:04,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:04:04,199 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 982 transitions. [2019-10-02 12:04:04,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-02 12:04:04,203 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:04,203 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:04,203 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:04,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:04,204 INFO L82 PathProgramCache]: Analyzing trace with hash 2042388957, now seen corresponding path program 1 times [2019-10-02 12:04:04,204 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:04,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:04,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:04,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:04,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:04,333 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:04:04,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:04,334 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:04,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:04,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 3195 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:04,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:04:04,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:04,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:04:04,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:04:04,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:04:04,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:04,914 INFO L87 Difference]: Start difference. First operand 639 states and 982 transitions. Second operand 8 states. [2019-10-02 12:04:05,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:05,101 INFO L93 Difference]: Finished difference Result 1228 states and 1911 transitions. [2019-10-02 12:04:05,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:04:05,102 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 134 [2019-10-02 12:04:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:05,107 INFO L225 Difference]: With dead ends: 1228 [2019-10-02 12:04:05,107 INFO L226 Difference]: Without dead ends: 639 [2019-10-02 12:04:05,110 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:04:05,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-10-02 12:04:05,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-10-02 12:04:05,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-02 12:04:05,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 981 transitions. [2019-10-02 12:04:05,134 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 981 transitions. Word has length 134 [2019-10-02 12:04:05,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:05,135 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 981 transitions. [2019-10-02 12:04:05,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:04:05,135 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 981 transitions. [2019-10-02 12:04:05,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 12:04:05,138 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:05,138 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:05,139 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:05,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:05,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1213878146, now seen corresponding path program 1 times [2019-10-02 12:04:05,139 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:05,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:05,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:05,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:05,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:04:05,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:05,386 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:05,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:06,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 3196 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 12:04:06,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:04:06,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:06,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2019-10-02 12:04:06,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 12:04:06,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 12:04:06,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:04:06,261 INFO L87 Difference]: Start difference. First operand 639 states and 981 transitions. Second operand 18 states. [2019-10-02 12:04:06,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:06,881 INFO L93 Difference]: Finished difference Result 1244 states and 1938 transitions. [2019-10-02 12:04:06,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:04:06,882 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2019-10-02 12:04:06,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:06,888 INFO L225 Difference]: With dead ends: 1244 [2019-10-02 12:04:06,889 INFO L226 Difference]: Without dead ends: 654 [2019-10-02 12:04:06,893 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:04:06,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-10-02 12:04:06,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 650. [2019-10-02 12:04:06,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-10-02 12:04:06,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 989 transitions. [2019-10-02 12:04:06,921 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 989 transitions. Word has length 135 [2019-10-02 12:04:06,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:06,922 INFO L475 AbstractCegarLoop]: Abstraction has 650 states and 989 transitions. [2019-10-02 12:04:06,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 12:04:06,923 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 989 transitions. [2019-10-02 12:04:06,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 12:04:06,926 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:06,926 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:06,926 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:06,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:06,927 INFO L82 PathProgramCache]: Analyzing trace with hash 624091160, now seen corresponding path program 1 times [2019-10-02 12:04:06,927 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:06,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:06,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:06,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:06,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:07,112 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:04:07,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:07,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:04:07,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:04:07,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:04:07,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:04:07,114 INFO L87 Difference]: Start difference. First operand 650 states and 989 transitions. Second operand 9 states. [2019-10-02 12:04:07,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:07,303 INFO L93 Difference]: Finished difference Result 1175 states and 1834 transitions. [2019-10-02 12:04:07,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:04:07,304 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-10-02 12:04:07,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:07,308 INFO L225 Difference]: With dead ends: 1175 [2019-10-02 12:04:07,309 INFO L226 Difference]: Without dead ends: 647 [2019-10-02 12:04:07,312 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:04:07,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-10-02 12:04:07,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2019-10-02 12:04:07,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-02 12:04:07,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 984 transitions. [2019-10-02 12:04:07,339 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 984 transitions. Word has length 136 [2019-10-02 12:04:07,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:07,340 INFO L475 AbstractCegarLoop]: Abstraction has 647 states and 984 transitions. [2019-10-02 12:04:07,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:04:07,340 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 984 transitions. [2019-10-02 12:04:07,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 12:04:07,342 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:07,342 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:07,342 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:07,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:07,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1366944630, now seen corresponding path program 1 times [2019-10-02 12:04:07,343 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:07,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:07,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:07,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:07,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:07,502 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:04:07,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:07,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:04:07,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:04:07,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:04:07,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:04:07,506 INFO L87 Difference]: Start difference. First operand 647 states and 984 transitions. Second operand 7 states. [2019-10-02 12:04:07,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:07,603 INFO L93 Difference]: Finished difference Result 1172 states and 1829 transitions. [2019-10-02 12:04:07,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:04:07,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 137 [2019-10-02 12:04:07,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:07,608 INFO L225 Difference]: With dead ends: 1172 [2019-10-02 12:04:07,608 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 12:04:07,613 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:07,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 12:04:07,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 624. [2019-10-02 12:04:07,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-10-02 12:04:07,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 954 transitions. [2019-10-02 12:04:07,636 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 954 transitions. Word has length 137 [2019-10-02 12:04:07,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:07,637 INFO L475 AbstractCegarLoop]: Abstraction has 624 states and 954 transitions. [2019-10-02 12:04:07,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:04:07,637 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 954 transitions. [2019-10-02 12:04:07,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 12:04:07,639 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:07,639 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:07,639 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:07,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:07,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1724216056, now seen corresponding path program 1 times [2019-10-02 12:04:07,640 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:07,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:07,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:07,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:07,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:07,856 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:04:07,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:07,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:04:07,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:04:07,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:04:07,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:04:07,858 INFO L87 Difference]: Start difference. First operand 624 states and 954 transitions. Second operand 13 states. [2019-10-02 12:04:08,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:08,171 INFO L93 Difference]: Finished difference Result 1150 states and 1797 transitions. [2019-10-02 12:04:08,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:04:08,171 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 137 [2019-10-02 12:04:08,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:08,176 INFO L225 Difference]: With dead ends: 1150 [2019-10-02 12:04:08,176 INFO L226 Difference]: Without dead ends: 617 [2019-10-02 12:04:08,180 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:04:08,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-02 12:04:08,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-10-02 12:04:08,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-10-02 12:04:08,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 945 transitions. [2019-10-02 12:04:08,202 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 945 transitions. Word has length 137 [2019-10-02 12:04:08,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:08,205 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 945 transitions. [2019-10-02 12:04:08,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:04:08,205 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 945 transitions. [2019-10-02 12:04:08,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 12:04:08,207 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:08,207 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:08,207 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:08,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:08,207 INFO L82 PathProgramCache]: Analyzing trace with hash -228572886, now seen corresponding path program 1 times [2019-10-02 12:04:08,208 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:08,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:08,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:08,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:08,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:04:08,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:08,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:04:08,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:04:08,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:04:08,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:04:08,437 INFO L87 Difference]: Start difference. First operand 617 states and 945 transitions. Second operand 13 states. [2019-10-02 12:04:08,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:08,781 INFO L93 Difference]: Finished difference Result 1201 states and 1865 transitions. [2019-10-02 12:04:08,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:04:08,782 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 138 [2019-10-02 12:04:08,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:08,787 INFO L225 Difference]: With dead ends: 1201 [2019-10-02 12:04:08,787 INFO L226 Difference]: Without dead ends: 631 [2019-10-02 12:04:08,791 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:04:08,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-10-02 12:04:08,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 629. [2019-10-02 12:04:08,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-02 12:04:08,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 960 transitions. [2019-10-02 12:04:08,814 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 960 transitions. Word has length 138 [2019-10-02 12:04:08,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:08,815 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 960 transitions. [2019-10-02 12:04:08,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:04:08,815 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 960 transitions. [2019-10-02 12:04:08,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 12:04:08,817 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:08,817 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:08,817 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:08,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:08,817 INFO L82 PathProgramCache]: Analyzing trace with hash -674284739, now seen corresponding path program 1 times [2019-10-02 12:04:08,817 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:08,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:08,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:08,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:08,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 12:04:08,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:08,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:04:09,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:04:09,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:04:09,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:04:09,001 INFO L87 Difference]: Start difference. First operand 629 states and 960 transitions. Second operand 11 states. [2019-10-02 12:04:09,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:09,269 INFO L93 Difference]: Finished difference Result 1155 states and 1803 transitions. [2019-10-02 12:04:09,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:04:09,270 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 139 [2019-10-02 12:04:09,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:09,275 INFO L225 Difference]: With dead ends: 1155 [2019-10-02 12:04:09,275 INFO L226 Difference]: Without dead ends: 629 [2019-10-02 12:04:09,279 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:04:09,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-02 12:04:09,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-02 12:04:09,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-02 12:04:09,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 959 transitions. [2019-10-02 12:04:09,303 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 959 transitions. Word has length 139 [2019-10-02 12:04:09,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:09,303 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 959 transitions. [2019-10-02 12:04:09,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:04:09,304 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 959 transitions. [2019-10-02 12:04:09,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 12:04:09,305 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:09,306 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:09,306 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:09,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:09,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1417344580, now seen corresponding path program 1 times [2019-10-02 12:04:09,306 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:09,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:09,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:09,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:09,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:09,498 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 12:04:09,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:09,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:04:09,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:04:09,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:04:09,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:04:09,501 INFO L87 Difference]: Start difference. First operand 629 states and 959 transitions. Second operand 11 states. [2019-10-02 12:04:09,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:09,794 INFO L93 Difference]: Finished difference Result 1201 states and 1856 transitions. [2019-10-02 12:04:09,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:04:09,795 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 140 [2019-10-02 12:04:09,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:09,800 INFO L225 Difference]: With dead ends: 1201 [2019-10-02 12:04:09,801 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 12:04:09,804 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:04:09,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 12:04:09,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 12:04:09,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 12:04:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 951 transitions. [2019-10-02 12:04:09,836 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 951 transitions. Word has length 140 [2019-10-02 12:04:09,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:09,838 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 951 transitions. [2019-10-02 12:04:09,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:04:09,838 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 951 transitions. [2019-10-02 12:04:09,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 12:04:09,840 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:09,840 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:09,841 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:09,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:09,841 INFO L82 PathProgramCache]: Analyzing trace with hash 211574840, now seen corresponding path program 1 times [2019-10-02 12:04:09,841 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:09,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:09,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:09,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:09,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:04:10,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:10,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:04:10,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:04:10,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:04:10,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:04:10,012 INFO L87 Difference]: Start difference. First operand 626 states and 951 transitions. Second operand 9 states. [2019-10-02 12:04:17,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:17,024 INFO L93 Difference]: Finished difference Result 1626 states and 2566 transitions. [2019-10-02 12:04:17,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 12:04:17,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 141 [2019-10-02 12:04:17,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:17,035 INFO L225 Difference]: With dead ends: 1626 [2019-10-02 12:04:17,036 INFO L226 Difference]: Without dead ends: 1109 [2019-10-02 12:04:17,040 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-10-02 12:04:17,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-10-02 12:04:17,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1077. [2019-10-02 12:04:17,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1077 states. [2019-10-02 12:04:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1647 transitions. [2019-10-02 12:04:17,089 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1647 transitions. Word has length 141 [2019-10-02 12:04:17,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:17,090 INFO L475 AbstractCegarLoop]: Abstraction has 1077 states and 1647 transitions. [2019-10-02 12:04:17,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:04:17,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1647 transitions. [2019-10-02 12:04:17,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 12:04:17,092 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:17,092 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:17,093 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:17,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:17,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1394284423, now seen corresponding path program 1 times [2019-10-02 12:04:17,093 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:17,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:17,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:17,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:17,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:17,252 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:04:17,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:17,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:04:17,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:04:17,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:04:17,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:04:17,254 INFO L87 Difference]: Start difference. First operand 1077 states and 1647 transitions. Second operand 5 states. [2019-10-02 12:04:18,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:18,033 INFO L93 Difference]: Finished difference Result 2040 states and 3173 transitions. [2019-10-02 12:04:18,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:04:18,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2019-10-02 12:04:18,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:18,043 INFO L225 Difference]: With dead ends: 2040 [2019-10-02 12:04:18,043 INFO L226 Difference]: Without dead ends: 1073 [2019-10-02 12:04:18,048 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:18,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2019-10-02 12:04:18,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1073. [2019-10-02 12:04:18,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1073 states. [2019-10-02 12:04:18,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1639 transitions. [2019-10-02 12:04:18,099 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1639 transitions. Word has length 142 [2019-10-02 12:04:18,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:18,101 INFO L475 AbstractCegarLoop]: Abstraction has 1073 states and 1639 transitions. [2019-10-02 12:04:18,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:04:18,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1639 transitions. [2019-10-02 12:04:18,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 12:04:18,103 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:18,103 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:18,103 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:18,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:18,105 INFO L82 PathProgramCache]: Analyzing trace with hash -273524449, now seen corresponding path program 1 times [2019-10-02 12:04:18,105 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:18,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:18,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:18,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:18,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:18,304 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:04:18,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:18,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:04:18,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:04:18,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:04:18,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:18,306 INFO L87 Difference]: Start difference. First operand 1073 states and 1639 transitions. Second operand 6 states. [2019-10-02 12:04:21,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:21,673 INFO L93 Difference]: Finished difference Result 3193 states and 5014 transitions. [2019-10-02 12:04:21,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:04:21,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-02 12:04:21,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:21,693 INFO L225 Difference]: With dead ends: 3193 [2019-10-02 12:04:21,693 INFO L226 Difference]: Without dead ends: 2230 [2019-10-02 12:04:21,699 INFO L640 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-10-02 12:04:21,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2019-10-02 12:04:21,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 2016. [2019-10-02 12:04:21,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2016 states. [2019-10-02 12:04:21,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 3142 transitions. [2019-10-02 12:04:21,841 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 3142 transitions. Word has length 143 [2019-10-02 12:04:21,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:21,841 INFO L475 AbstractCegarLoop]: Abstraction has 2016 states and 3142 transitions. [2019-10-02 12:04:21,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:04:21,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 3142 transitions. [2019-10-02 12:04:21,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 12:04:21,850 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:21,850 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:21,850 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:21,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:21,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1300389228, now seen corresponding path program 1 times [2019-10-02 12:04:21,851 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:21,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:21,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:21,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:21,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:22,024 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:04:22,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:22,025 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:22,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:22,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 3579 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:04:22,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:22,714 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:04:22,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:22,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:04:22,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:04:22,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:04:22,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:04:22,724 INFO L87 Difference]: Start difference. First operand 2016 states and 3142 transitions. Second operand 9 states. [2019-10-02 12:04:24,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:24,004 INFO L93 Difference]: Finished difference Result 3939 states and 6307 transitions. [2019-10-02 12:04:24,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:04:24,005 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 201 [2019-10-02 12:04:24,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:24,018 INFO L225 Difference]: With dead ends: 3939 [2019-10-02 12:04:24,018 INFO L226 Difference]: Without dead ends: 2032 [2019-10-02 12:04:24,029 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:04:24,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2019-10-02 12:04:24,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 2032. [2019-10-02 12:04:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2032 states. [2019-10-02 12:04:24,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 3158 transitions. [2019-10-02 12:04:24,127 INFO L78 Accepts]: Start accepts. Automaton has 2032 states and 3158 transitions. Word has length 201 [2019-10-02 12:04:24,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:24,128 INFO L475 AbstractCegarLoop]: Abstraction has 2032 states and 3158 transitions. [2019-10-02 12:04:24,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:04:24,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 3158 transitions. [2019-10-02 12:04:24,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-02 12:04:24,135 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:24,136 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:24,136 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:24,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:24,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1661585591, now seen corresponding path program 1 times [2019-10-02 12:04:24,137 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:24,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:24,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:24,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:24,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:24,347 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 12:04:24,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:24,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:04:24,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:04:24,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:04:24,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:04:24,349 INFO L87 Difference]: Start difference. First operand 2032 states and 3158 transitions. Second operand 12 states. [2019-10-02 12:04:35,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:35,082 INFO L93 Difference]: Finished difference Result 6473 states and 9997 transitions. [2019-10-02 12:04:35,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:04:35,082 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 202 [2019-10-02 12:04:35,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:35,108 INFO L225 Difference]: With dead ends: 6473 [2019-10-02 12:04:35,108 INFO L226 Difference]: Without dead ends: 4550 [2019-10-02 12:04:35,120 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:04:35,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4550 states. [2019-10-02 12:04:35,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4550 to 4494. [2019-10-02 12:04:35,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4494 states. [2019-10-02 12:04:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4494 states to 4494 states and 6820 transitions. [2019-10-02 12:04:35,328 INFO L78 Accepts]: Start accepts. Automaton has 4494 states and 6820 transitions. Word has length 202 [2019-10-02 12:04:35,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:35,329 INFO L475 AbstractCegarLoop]: Abstraction has 4494 states and 6820 transitions. [2019-10-02 12:04:35,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:04:35,329 INFO L276 IsEmpty]: Start isEmpty. Operand 4494 states and 6820 transitions. [2019-10-02 12:04:35,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-02 12:04:35,334 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:35,335 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:35,335 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:35,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:35,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1075700640, now seen corresponding path program 1 times [2019-10-02 12:04:35,335 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:35,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:35,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:35,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:35,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:35,507 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:04:35,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:35,508 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:35,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:36,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 3581 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:04:36,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:04:36,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:36,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:04:36,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:04:36,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:04:36,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:04:36,317 INFO L87 Difference]: Start difference. First operand 4494 states and 6820 transitions. Second operand 9 states. [2019-10-02 12:04:37,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:37,599 INFO L93 Difference]: Finished difference Result 8959 states and 13971 transitions. [2019-10-02 12:04:37,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:04:37,600 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 203 [2019-10-02 12:04:37,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:37,626 INFO L225 Difference]: With dead ends: 8959 [2019-10-02 12:04:37,626 INFO L226 Difference]: Without dead ends: 4574 [2019-10-02 12:04:37,645 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:04:37,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2019-10-02 12:04:37,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 4574. [2019-10-02 12:04:37,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4574 states. [2019-10-02 12:04:37,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4574 states to 4574 states and 6896 transitions. [2019-10-02 12:04:37,848 INFO L78 Accepts]: Start accepts. Automaton has 4574 states and 6896 transitions. Word has length 203 [2019-10-02 12:04:37,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:37,848 INFO L475 AbstractCegarLoop]: Abstraction has 4574 states and 6896 transitions. [2019-10-02 12:04:37,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:04:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 4574 states and 6896 transitions. [2019-10-02 12:04:37,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-02 12:04:37,856 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:37,856 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:37,856 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:37,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:37,857 INFO L82 PathProgramCache]: Analyzing trace with hash -2004872532, now seen corresponding path program 1 times [2019-10-02 12:04:37,857 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:37,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:37,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:37,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:37,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:38,007 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:04:38,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:38,008 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:38,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:38,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 3583 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:04:38,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:38,788 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:04:38,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:38,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:04:38,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:04:38,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:04:38,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:04:38,797 INFO L87 Difference]: Start difference. First operand 4574 states and 6896 transitions. Second operand 9 states. [2019-10-02 12:04:40,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:40,041 INFO L93 Difference]: Finished difference Result 9135 states and 14125 transitions. [2019-10-02 12:04:40,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:04:40,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 205 [2019-10-02 12:04:40,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:40,062 INFO L225 Difference]: With dead ends: 9135 [2019-10-02 12:04:40,062 INFO L226 Difference]: Without dead ends: 4670 [2019-10-02 12:04:40,075 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:04:40,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-10-02 12:04:40,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4670. [2019-10-02 12:04:40,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4670 states. [2019-10-02 12:04:40,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4670 states to 4670 states and 6988 transitions. [2019-10-02 12:04:40,249 INFO L78 Accepts]: Start accepts. Automaton has 4670 states and 6988 transitions. Word has length 205 [2019-10-02 12:04:40,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:40,250 INFO L475 AbstractCegarLoop]: Abstraction has 4670 states and 6988 transitions. [2019-10-02 12:04:40,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:04:40,250 INFO L276 IsEmpty]: Start isEmpty. Operand 4670 states and 6988 transitions. [2019-10-02 12:04:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-02 12:04:40,256 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:40,256 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:40,256 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:40,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:40,257 INFO L82 PathProgramCache]: Analyzing trace with hash 179764264, now seen corresponding path program 1 times [2019-10-02 12:04:40,257 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:40,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:40,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:40,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:40,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:40,396 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:04:40,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:40,396 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:40,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:41,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 3585 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:04:41,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:41,093 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:04:41,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:41,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:04:41,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:04:41,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:04:41,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:04:41,113 INFO L87 Difference]: Start difference. First operand 4670 states and 6988 transitions. Second operand 9 states. [2019-10-02 12:04:42,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:42,503 INFO L93 Difference]: Finished difference Result 9343 states and 14311 transitions. [2019-10-02 12:04:42,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:04:42,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 207 [2019-10-02 12:04:42,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:42,526 INFO L225 Difference]: With dead ends: 9343 [2019-10-02 12:04:42,526 INFO L226 Difference]: Without dead ends: 4782 [2019-10-02 12:04:42,539 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 206 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:04:42,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4782 states. [2019-10-02 12:04:42,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4782 to 4782. [2019-10-02 12:04:42,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4782 states. [2019-10-02 12:04:42,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4782 states to 4782 states and 7096 transitions. [2019-10-02 12:04:42,722 INFO L78 Accepts]: Start accepts. Automaton has 4782 states and 7096 transitions. Word has length 207 [2019-10-02 12:04:42,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:42,723 INFO L475 AbstractCegarLoop]: Abstraction has 4782 states and 7096 transitions. [2019-10-02 12:04:42,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:04:42,723 INFO L276 IsEmpty]: Start isEmpty. Operand 4782 states and 7096 transitions. [2019-10-02 12:04:42,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 12:04:42,728 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:42,728 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:42,728 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:42,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:42,729 INFO L82 PathProgramCache]: Analyzing trace with hash 710289900, now seen corresponding path program 1 times [2019-10-02 12:04:42,729 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:42,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:42,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:42,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:42,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:42,925 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 12:04:42,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:42,925 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:43,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:43,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 3587 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:04:43,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:43,647 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 12:04:43,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:43,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 12:04:43,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:04:43,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:04:43,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:04:43,657 INFO L87 Difference]: Start difference. First operand 4782 states and 7096 transitions. Second operand 14 states. [2019-10-02 12:04:55,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:55,608 INFO L93 Difference]: Finished difference Result 14751 states and 22499 transitions. [2019-10-02 12:04:55,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 12:04:55,609 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 209 [2019-10-02 12:04:55,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:55,668 INFO L225 Difference]: With dead ends: 14751 [2019-10-02 12:04:55,668 INFO L226 Difference]: Without dead ends: 10078 [2019-10-02 12:04:55,688 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 12:04:55,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10078 states. [2019-10-02 12:04:56,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10078 to 9870. [2019-10-02 12:04:56,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9870 states. [2019-10-02 12:04:56,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9870 states to 9870 states and 14804 transitions. [2019-10-02 12:04:56,230 INFO L78 Accepts]: Start accepts. Automaton has 9870 states and 14804 transitions. Word has length 209 [2019-10-02 12:04:56,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:56,231 INFO L475 AbstractCegarLoop]: Abstraction has 9870 states and 14804 transitions. [2019-10-02 12:04:56,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:04:56,231 INFO L276 IsEmpty]: Start isEmpty. Operand 9870 states and 14804 transitions. [2019-10-02 12:04:56,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-02 12:04:56,243 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:56,243 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:56,244 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:56,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:56,244 INFO L82 PathProgramCache]: Analyzing trace with hash -623172948, now seen corresponding path program 1 times [2019-10-02 12:04:56,245 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:56,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:56,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:56,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:56,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:56,418 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:04:56,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:56,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:04:56,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:04:56,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:04:56,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:04:56,422 INFO L87 Difference]: Start difference. First operand 9870 states and 14804 transitions. Second operand 9 states. [2019-10-02 12:04:56,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:56,685 INFO L93 Difference]: Finished difference Result 14501 states and 21693 transitions. [2019-10-02 12:04:56,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:04:56,685 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 217 [2019-10-02 12:04:56,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:56,707 INFO L225 Difference]: With dead ends: 14501 [2019-10-02 12:04:56,708 INFO L226 Difference]: Without dead ends: 4729 [2019-10-02 12:04:56,731 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:04:56,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4729 states. [2019-10-02 12:04:56,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4729 to 4729. [2019-10-02 12:04:56,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4729 states. [2019-10-02 12:04:56,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4729 states to 4729 states and 6992 transitions. [2019-10-02 12:04:56,961 INFO L78 Accepts]: Start accepts. Automaton has 4729 states and 6992 transitions. Word has length 217 [2019-10-02 12:04:56,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:56,963 INFO L475 AbstractCegarLoop]: Abstraction has 4729 states and 6992 transitions. [2019-10-02 12:04:56,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:04:56,963 INFO L276 IsEmpty]: Start isEmpty. Operand 4729 states and 6992 transitions. [2019-10-02 12:04:56,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-02 12:04:56,969 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:56,969 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:56,969 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:56,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:56,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1074494861, now seen corresponding path program 1 times [2019-10-02 12:04:56,970 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:56,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:56,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:56,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:56,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 12:04:57,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:57,918 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:58,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:58,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 3622 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:04:58,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:04:58,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:58,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-10-02 12:04:58,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:04:58,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:04:58,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:04:58,640 INFO L87 Difference]: Start difference. First operand 4729 states and 6992 transitions. Second operand 14 states. [2019-10-02 12:05:04,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:04,163 INFO L93 Difference]: Finished difference Result 10031 states and 15152 transitions. [2019-10-02 12:05:04,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:05:04,164 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 221 [2019-10-02 12:05:04,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:04,187 INFO L225 Difference]: With dead ends: 10031 [2019-10-02 12:05:04,187 INFO L226 Difference]: Without dead ends: 5409 [2019-10-02 12:05:04,199 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:05:04,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5409 states. [2019-10-02 12:05:04,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5409 to 4861. [2019-10-02 12:05:04,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4861 states. [2019-10-02 12:05:04,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4861 states to 4861 states and 7156 transitions. [2019-10-02 12:05:04,446 INFO L78 Accepts]: Start accepts. Automaton has 4861 states and 7156 transitions. Word has length 221 [2019-10-02 12:05:04,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:04,446 INFO L475 AbstractCegarLoop]: Abstraction has 4861 states and 7156 transitions. [2019-10-02 12:05:04,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:05:04,447 INFO L276 IsEmpty]: Start isEmpty. Operand 4861 states and 7156 transitions. [2019-10-02 12:05:04,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 12:05:04,452 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:04,452 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:05:04,454 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:04,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:04,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1406851766, now seen corresponding path program 1 times [2019-10-02 12:05:04,456 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:04,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:04,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:04,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:04,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:04,736 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 12:05:04,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:04,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:05:04,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:05:04,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:05:04,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:05:04,740 INFO L87 Difference]: Start difference. First operand 4861 states and 7156 transitions. Second operand 11 states. [2019-10-02 12:05:09,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:09,537 INFO L93 Difference]: Finished difference Result 9565 states and 14218 transitions. [2019-10-02 12:05:09,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:05:09,537 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 228 [2019-10-02 12:05:09,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:09,557 INFO L225 Difference]: With dead ends: 9565 [2019-10-02 12:05:09,557 INFO L226 Difference]: Without dead ends: 4819 [2019-10-02 12:05:09,567 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:05:09,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4819 states. [2019-10-02 12:05:09,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4819 to 4819. [2019-10-02 12:05:09,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4819 states. [2019-10-02 12:05:09,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4819 states to 4819 states and 7096 transitions. [2019-10-02 12:05:09,948 INFO L78 Accepts]: Start accepts. Automaton has 4819 states and 7096 transitions. Word has length 228 [2019-10-02 12:05:09,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:09,948 INFO L475 AbstractCegarLoop]: Abstraction has 4819 states and 7096 transitions. [2019-10-02 12:05:09,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:05:09,949 INFO L276 IsEmpty]: Start isEmpty. Operand 4819 states and 7096 transitions. [2019-10-02 12:05:09,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 12:05:09,956 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:09,956 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:05:09,957 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:09,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:09,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1725704591, now seen corresponding path program 1 times [2019-10-02 12:05:09,957 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:09,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:09,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:09,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:09,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:05:10,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:10,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:05:10,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:05:10,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:05:10,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:05:10,201 INFO L87 Difference]: Start difference. First operand 4819 states and 7096 transitions. Second operand 9 states. [2019-10-02 12:05:16,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:16,153 INFO L93 Difference]: Finished difference Result 16371 states and 24579 transitions. [2019-10-02 12:05:16,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 12:05:16,154 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 230 [2019-10-02 12:05:16,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:16,198 INFO L225 Difference]: With dead ends: 16371 [2019-10-02 12:05:16,198 INFO L226 Difference]: Without dead ends: 11655 [2019-10-02 12:05:16,214 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:05:16,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11655 states. [2019-10-02 12:05:16,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11655 to 11343. [2019-10-02 12:05:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11343 states. [2019-10-02 12:05:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11343 states to 11343 states and 16776 transitions. [2019-10-02 12:05:16,627 INFO L78 Accepts]: Start accepts. Automaton has 11343 states and 16776 transitions. Word has length 230 [2019-10-02 12:05:16,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:16,628 INFO L475 AbstractCegarLoop]: Abstraction has 11343 states and 16776 transitions. [2019-10-02 12:05:16,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:05:16,628 INFO L276 IsEmpty]: Start isEmpty. Operand 11343 states and 16776 transitions. [2019-10-02 12:05:16,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 12:05:16,636 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:16,637 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:05:16,637 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:16,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:16,637 INFO L82 PathProgramCache]: Analyzing trace with hash -150098587, now seen corresponding path program 1 times [2019-10-02 12:05:16,638 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:16,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:16,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:16,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:16,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:16,804 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:05:16,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:16,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:05:16,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:05:16,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:05:16,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:05:16,806 INFO L87 Difference]: Start difference. First operand 11343 states and 16776 transitions. Second operand 7 states. [2019-10-02 12:05:17,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:17,189 INFO L93 Difference]: Finished difference Result 22949 states and 34146 transitions. [2019-10-02 12:05:17,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:05:17,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 235 [2019-10-02 12:05:17,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:17,232 INFO L225 Difference]: With dead ends: 22949 [2019-10-02 12:05:17,232 INFO L226 Difference]: Without dead ends: 11721 [2019-10-02 12:05:17,257 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:05:17,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11721 states. [2019-10-02 12:05:17,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11721 to 11547. [2019-10-02 12:05:17,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11547 states. [2019-10-02 12:05:17,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11547 states to 11547 states and 16992 transitions. [2019-10-02 12:05:17,716 INFO L78 Accepts]: Start accepts. Automaton has 11547 states and 16992 transitions. Word has length 235 [2019-10-02 12:05:17,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:17,717 INFO L475 AbstractCegarLoop]: Abstraction has 11547 states and 16992 transitions. [2019-10-02 12:05:17,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:05:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 11547 states and 16992 transitions. [2019-10-02 12:05:17,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-02 12:05:17,723 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:17,724 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:05:17,724 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:17,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:17,724 INFO L82 PathProgramCache]: Analyzing trace with hash 360621459, now seen corresponding path program 1 times [2019-10-02 12:05:17,725 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:17,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:17,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:17,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:17,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:18,098 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:05:18,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:18,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:05:18,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:05:18,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:05:18,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:05:18,100 INFO L87 Difference]: Start difference. First operand 11547 states and 16992 transitions. Second operand 9 states. [2019-10-02 12:05:18,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:18,632 INFO L93 Difference]: Finished difference Result 24521 states and 36966 transitions. [2019-10-02 12:05:18,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:05:18,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 242 [2019-10-02 12:05:18,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:18,682 INFO L225 Difference]: With dead ends: 24521 [2019-10-02 12:05:18,682 INFO L226 Difference]: Without dead ends: 11547 [2019-10-02 12:05:18,711 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:05:18,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11547 states. [2019-10-02 12:05:19,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11547 to 11547. [2019-10-02 12:05:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11547 states. [2019-10-02 12:05:19,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11547 states to 11547 states and 16740 transitions. [2019-10-02 12:05:19,098 INFO L78 Accepts]: Start accepts. Automaton has 11547 states and 16740 transitions. Word has length 242 [2019-10-02 12:05:19,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:19,099 INFO L475 AbstractCegarLoop]: Abstraction has 11547 states and 16740 transitions. [2019-10-02 12:05:19,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:05:19,099 INFO L276 IsEmpty]: Start isEmpty. Operand 11547 states and 16740 transitions. [2019-10-02 12:05:19,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-02 12:05:19,106 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:19,106 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:05:19,106 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:19,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:19,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1260163648, now seen corresponding path program 1 times [2019-10-02 12:05:19,107 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:19,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:19,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:19,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:19,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-02 12:05:19,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:19,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:05:19,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:05:19,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:05:19,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:05:19,289 INFO L87 Difference]: Start difference. First operand 11547 states and 16740 transitions. Second operand 7 states. [2019-10-02 12:05:23,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:23,961 INFO L93 Difference]: Finished difference Result 23991 states and 35174 transitions. [2019-10-02 12:05:23,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:05:23,961 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 247 [2019-10-02 12:05:23,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:24,000 INFO L225 Difference]: With dead ends: 23991 [2019-10-02 12:05:24,000 INFO L226 Difference]: Without dead ends: 12563 [2019-10-02 12:05:24,022 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:05:24,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12563 states. [2019-10-02 12:05:24,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12563 to 12177. [2019-10-02 12:05:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12177 states. [2019-10-02 12:05:24,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 17618 transitions. [2019-10-02 12:05:24,553 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 17618 transitions. Word has length 247 [2019-10-02 12:05:24,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:24,554 INFO L475 AbstractCegarLoop]: Abstraction has 12177 states and 17618 transitions. [2019-10-02 12:05:24,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:05:24,554 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 17618 transitions. [2019-10-02 12:05:24,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-02 12:05:24,559 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:24,559 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:05:24,560 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:24,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:24,560 INFO L82 PathProgramCache]: Analyzing trace with hash -46216148, now seen corresponding path program 1 times [2019-10-02 12:05:24,560 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:24,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:24,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:24,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:24,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:24,777 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 12:05:24,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:24,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:05:24,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:05:24,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:05:24,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:05:24,779 INFO L87 Difference]: Start difference. First operand 12177 states and 17618 transitions. Second operand 6 states. [2019-10-02 12:05:25,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:25,632 INFO L93 Difference]: Finished difference Result 30477 states and 44726 transitions. [2019-10-02 12:05:25,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:05:25,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 252 [2019-10-02 12:05:25,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:25,684 INFO L225 Difference]: With dead ends: 30477 [2019-10-02 12:05:25,685 INFO L226 Difference]: Without dead ends: 18419 [2019-10-02 12:05:25,705 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:05:25,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18419 states. [2019-10-02 12:05:26,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18419 to 14781. [2019-10-02 12:05:26,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14781 states. [2019-10-02 12:05:26,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14781 states to 14781 states and 21586 transitions. [2019-10-02 12:05:26,233 INFO L78 Accepts]: Start accepts. Automaton has 14781 states and 21586 transitions. Word has length 252 [2019-10-02 12:05:26,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:26,234 INFO L475 AbstractCegarLoop]: Abstraction has 14781 states and 21586 transitions. [2019-10-02 12:05:26,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:05:26,234 INFO L276 IsEmpty]: Start isEmpty. Operand 14781 states and 21586 transitions. [2019-10-02 12:05:26,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-02 12:05:26,239 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:26,240 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:05:26,240 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:26,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:26,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1418023446, now seen corresponding path program 1 times [2019-10-02 12:05:26,240 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:26,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:26,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:26,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:26,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:26,456 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 12:05:26,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:26,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:05:26,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:05:26,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:05:26,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:05:26,458 INFO L87 Difference]: Start difference. First operand 14781 states and 21586 transitions. Second operand 9 states. [2019-10-02 12:05:27,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:27,505 INFO L93 Difference]: Finished difference Result 15809 states and 22972 transitions. [2019-10-02 12:05:27,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:05:27,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 252 [2019-10-02 12:05:27,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:27,555 INFO L225 Difference]: With dead ends: 15809 [2019-10-02 12:05:27,555 INFO L226 Difference]: Without dead ends: 15793 [2019-10-02 12:05:27,564 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:05:27,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15793 states. [2019-10-02 12:05:28,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15793 to 15535. [2019-10-02 12:05:28,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15535 states. [2019-10-02 12:05:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15535 states to 15535 states and 22570 transitions. [2019-10-02 12:05:29,013 INFO L78 Accepts]: Start accepts. Automaton has 15535 states and 22570 transitions. Word has length 252 [2019-10-02 12:05:29,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:29,013 INFO L475 AbstractCegarLoop]: Abstraction has 15535 states and 22570 transitions. [2019-10-02 12:05:29,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:05:29,014 INFO L276 IsEmpty]: Start isEmpty. Operand 15535 states and 22570 transitions. [2019-10-02 12:05:29,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-10-02 12:05:29,019 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:29,020 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:05:29,020 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:29,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:29,020 INFO L82 PathProgramCache]: Analyzing trace with hash -477458137, now seen corresponding path program 1 times [2019-10-02 12:05:29,021 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:29,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:29,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:29,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:29,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:29,211 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 12:05:29,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:29,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:05:29,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:05:29,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:05:29,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:05:29,213 INFO L87 Difference]: Start difference. First operand 15535 states and 22570 transitions. Second operand 9 states. [2019-10-02 12:05:33,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:33,026 INFO L93 Difference]: Finished difference Result 31011 states and 45196 transitions. [2019-10-02 12:05:33,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:05:33,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 270 [2019-10-02 12:05:33,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:33,072 INFO L225 Difference]: With dead ends: 31011 [2019-10-02 12:05:33,072 INFO L226 Difference]: Without dead ends: 15599 [2019-10-02 12:05:33,099 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:05:33,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15599 states. [2019-10-02 12:05:33,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15599 to 15535. [2019-10-02 12:05:33,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15535 states. [2019-10-02 12:05:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15535 states to 15535 states and 22530 transitions. [2019-10-02 12:05:33,830 INFO L78 Accepts]: Start accepts. Automaton has 15535 states and 22530 transitions. Word has length 270 [2019-10-02 12:05:33,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:33,831 INFO L475 AbstractCegarLoop]: Abstraction has 15535 states and 22530 transitions. [2019-10-02 12:05:33,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:05:33,831 INFO L276 IsEmpty]: Start isEmpty. Operand 15535 states and 22530 transitions. [2019-10-02 12:05:33,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-10-02 12:05:33,835 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:33,835 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:05:33,835 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:33,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:33,835 INFO L82 PathProgramCache]: Analyzing trace with hash 949827430, now seen corresponding path program 1 times [2019-10-02 12:05:33,836 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:33,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:33,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:33,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:33,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:34,003 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 12:05:34,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:34,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:05:34,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:05:34,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:05:34,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:05:34,006 INFO L87 Difference]: Start difference. First operand 15535 states and 22530 transitions. Second operand 6 states. [2019-10-02 12:05:38,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:38,604 INFO L93 Difference]: Finished difference Result 40003 states and 60007 transitions. [2019-10-02 12:05:38,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:05:38,604 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 271 [2019-10-02 12:05:38,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:38,699 INFO L225 Difference]: With dead ends: 40003 [2019-10-02 12:05:38,699 INFO L226 Difference]: Without dead ends: 24591 [2019-10-02 12:05:38,739 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:05:38,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24591 states. [2019-10-02 12:05:39,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24591 to 23370. [2019-10-02 12:05:39,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23370 states. [2019-10-02 12:05:39,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23370 states to 23370 states and 33848 transitions. [2019-10-02 12:05:39,812 INFO L78 Accepts]: Start accepts. Automaton has 23370 states and 33848 transitions. Word has length 271 [2019-10-02 12:05:39,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:39,812 INFO L475 AbstractCegarLoop]: Abstraction has 23370 states and 33848 transitions. [2019-10-02 12:05:39,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:05:39,812 INFO L276 IsEmpty]: Start isEmpty. Operand 23370 states and 33848 transitions. [2019-10-02 12:05:39,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-10-02 12:05:39,817 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:39,817 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:05:39,817 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:39,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:39,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1688206681, now seen corresponding path program 1 times [2019-10-02 12:05:39,818 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:39,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:39,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:39,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:39,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-02 12:05:40,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:05:40,204 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:05:40,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:40,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 3786 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 12:05:40,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:05:40,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 12:05:40,947 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 12:05:40,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:05:40,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2019-10-02 12:05:40,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 12:05:40,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 12:05:40,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:05:40,958 INFO L87 Difference]: Start difference. First operand 23370 states and 33848 transitions. Second operand 18 states. [2019-10-02 12:05:45,154 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-10-02 12:05:51,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:51,479 INFO L93 Difference]: Finished difference Result 48822 states and 70772 transitions. [2019-10-02 12:05:51,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 12:05:51,480 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 279 [2019-10-02 12:05:51,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:51,572 INFO L225 Difference]: With dead ends: 48822 [2019-10-02 12:05:51,572 INFO L226 Difference]: Without dead ends: 25557 [2019-10-02 12:05:51,620 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=257, Invalid=1723, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 12:05:51,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25557 states. [2019-10-02 12:05:52,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25557 to 25379. [2019-10-02 12:05:52,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25379 states. [2019-10-02 12:05:52,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25379 states to 25379 states and 36511 transitions. [2019-10-02 12:05:52,894 INFO L78 Accepts]: Start accepts. Automaton has 25379 states and 36511 transitions. Word has length 279 [2019-10-02 12:05:52,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:52,895 INFO L475 AbstractCegarLoop]: Abstraction has 25379 states and 36511 transitions. [2019-10-02 12:05:52,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 12:05:52,895 INFO L276 IsEmpty]: Start isEmpty. Operand 25379 states and 36511 transitions. [2019-10-02 12:05:52,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2019-10-02 12:05:52,901 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:52,901 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:05:52,902 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:52,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:52,902 INFO L82 PathProgramCache]: Analyzing trace with hash -824847818, now seen corresponding path program 1 times [2019-10-02 12:05:52,902 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:52,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:52,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:52,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:52,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2019-10-02 12:05:53,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:05:53,218 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:05:53,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:54,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 5191 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:05:54,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:05:54,227 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2019-10-02 12:05:54,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:05:54,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2019-10-02 12:05:54,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:05:54,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:05:54,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:05:54,239 INFO L87 Difference]: Start difference. First operand 25379 states and 36511 transitions. Second operand 11 states. [2019-10-02 12:06:04,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:04,498 INFO L93 Difference]: Finished difference Result 52321 states and 77216 transitions. [2019-10-02 12:06:04,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 12:06:04,498 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 454 [2019-10-02 12:06:04,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:04,622 INFO L225 Difference]: With dead ends: 52321 [2019-10-02 12:06:04,622 INFO L226 Difference]: Without dead ends: 27053 [2019-10-02 12:06:04,682 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-10-02 12:06:04,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27053 states. [2019-10-02 12:06:06,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27053 to 26273. [2019-10-02 12:06:06,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26273 states. [2019-10-02 12:06:06,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26273 states to 26273 states and 38017 transitions. [2019-10-02 12:06:06,080 INFO L78 Accepts]: Start accepts. Automaton has 26273 states and 38017 transitions. Word has length 454 [2019-10-02 12:06:06,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:06,080 INFO L475 AbstractCegarLoop]: Abstraction has 26273 states and 38017 transitions. [2019-10-02 12:06:06,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:06:06,081 INFO L276 IsEmpty]: Start isEmpty. Operand 26273 states and 38017 transitions. [2019-10-02 12:06:06,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2019-10-02 12:06:06,086 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:06,086 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:06,087 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:06,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:06,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1557463801, now seen corresponding path program 1 times [2019-10-02 12:06:06,087 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:06,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:06,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:06,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:06,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-02 12:06:06,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:06,304 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:06:06,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:07,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 4835 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:06:07,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:07,227 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-10-02 12:06:07,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:07,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-10-02 12:06:07,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:06:07,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:06:07,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:06:07,238 INFO L87 Difference]: Start difference. First operand 26273 states and 38017 transitions. Second operand 9 states. [2019-10-02 12:06:08,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:08,504 INFO L93 Difference]: Finished difference Result 53137 states and 77837 transitions. [2019-10-02 12:06:08,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:06:08,504 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 427 [2019-10-02 12:06:08,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:08,596 INFO L225 Difference]: With dead ends: 53137 [2019-10-02 12:06:08,596 INFO L226 Difference]: Without dead ends: 26975 [2019-10-02 12:06:08,647 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:06:08,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26975 states. [2019-10-02 12:06:11,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26975 to 26975. [2019-10-02 12:06:11,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26975 states. [2019-10-02 12:06:11,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26975 states to 26975 states and 39283 transitions. [2019-10-02 12:06:11,266 INFO L78 Accepts]: Start accepts. Automaton has 26975 states and 39283 transitions. Word has length 427 [2019-10-02 12:06:11,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:11,266 INFO L475 AbstractCegarLoop]: Abstraction has 26975 states and 39283 transitions. [2019-10-02 12:06:11,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:06:11,266 INFO L276 IsEmpty]: Start isEmpty. Operand 26975 states and 39283 transitions. [2019-10-02 12:06:11,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-10-02 12:06:11,272 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:11,272 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:11,272 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:11,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:11,273 INFO L82 PathProgramCache]: Analyzing trace with hash 207864475, now seen corresponding path program 1 times [2019-10-02 12:06:11,273 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:11,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:11,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:11,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:11,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:11,525 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-10-02 12:06:11,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:11,526 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:06:11,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:12,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 3867 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 12:06:12,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:12,378 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 108 proven. 10 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-10-02 12:06:12,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:06:12,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-10-02 12:06:12,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 12:06:12,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 12:06:12,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:06:12,389 INFO L87 Difference]: Start difference. First operand 26975 states and 39283 transitions. Second operand 19 states. [2019-10-02 12:06:26,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:26,593 INFO L93 Difference]: Finished difference Result 81144 states and 119171 transitions. [2019-10-02 12:06:26,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 12:06:26,594 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 313 [2019-10-02 12:06:26,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:27,041 INFO L225 Difference]: With dead ends: 81144 [2019-10-02 12:06:27,041 INFO L226 Difference]: Without dead ends: 54282 [2019-10-02 12:06:27,086 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2019-10-02 12:06:27,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54282 states. [2019-10-02 12:06:28,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54282 to 54126. [2019-10-02 12:06:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54126 states. [2019-10-02 12:06:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54126 states to 54126 states and 79442 transitions. [2019-10-02 12:06:29,086 INFO L78 Accepts]: Start accepts. Automaton has 54126 states and 79442 transitions. Word has length 313 [2019-10-02 12:06:29,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:29,086 INFO L475 AbstractCegarLoop]: Abstraction has 54126 states and 79442 transitions. [2019-10-02 12:06:29,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 12:06:29,087 INFO L276 IsEmpty]: Start isEmpty. Operand 54126 states and 79442 transitions. [2019-10-02 12:06:29,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2019-10-02 12:06:29,095 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:29,095 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:29,096 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:29,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:29,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1612637625, now seen corresponding path program 1 times [2019-10-02 12:06:29,096 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:29,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:29,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:29,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:29,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:29,675 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2019-10-02 12:06:29,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:29,675 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:06:29,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:30,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 4839 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 12:06:30,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2019-10-02 12:06:30,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:06:30,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-10-02 12:06:30,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:06:30,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:06:30,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:06:30,691 INFO L87 Difference]: Start difference. First operand 54126 states and 79442 transitions. Second operand 15 states. [2019-10-02 12:06:52,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:52,167 INFO L93 Difference]: Finished difference Result 213204 states and 329823 transitions. [2019-10-02 12:06:52,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 12:06:52,167 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 432 [2019-10-02 12:06:52,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:52,893 INFO L225 Difference]: With dead ends: 213204 [2019-10-02 12:06:52,893 INFO L226 Difference]: Without dead ends: 157711 [2019-10-02 12:06:53,062 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=407, Invalid=1573, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 12:06:53,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157711 states. [2019-10-02 12:07:05,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157711 to 155205. [2019-10-02 12:07:05,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155205 states. [2019-10-02 12:07:06,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155205 states to 155205 states and 232107 transitions. [2019-10-02 12:07:06,022 INFO L78 Accepts]: Start accepts. Automaton has 155205 states and 232107 transitions. Word has length 432 [2019-10-02 12:07:06,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:06,023 INFO L475 AbstractCegarLoop]: Abstraction has 155205 states and 232107 transitions. [2019-10-02 12:07:06,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:07:06,023 INFO L276 IsEmpty]: Start isEmpty. Operand 155205 states and 232107 transitions. [2019-10-02 12:07:06,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-10-02 12:07:06,032 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:06,033 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:06,033 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:06,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:06,034 INFO L82 PathProgramCache]: Analyzing trace with hash 301951764, now seen corresponding path program 1 times [2019-10-02 12:07:06,034 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:06,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:06,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:06,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:06,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:06,332 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 34 proven. 23 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-10-02 12:07:06,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:07:06,332 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:07:06,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:07,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 4557 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:07:07,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:07:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:07:07,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:07:07,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-10-02 12:07:07,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:07:07,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:07:07,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:07:07,273 INFO L87 Difference]: Start difference. First operand 155205 states and 232107 transitions. Second operand 11 states. [2019-10-02 12:07:34,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:34,809 INFO L93 Difference]: Finished difference Result 534358 states and 829570 transitions. [2019-10-02 12:07:34,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 12:07:34,809 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 408 [2019-10-02 12:07:34,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:36,664 INFO L225 Difference]: With dead ends: 534358 [2019-10-02 12:07:36,664 INFO L226 Difference]: Without dead ends: 377127 [2019-10-02 12:07:37,079 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 433 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=625, Unknown=0, NotChecked=0, Total=812 [2019-10-02 12:07:37,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377127 states. [2019-10-02 12:08:03,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377127 to 369575. [2019-10-02 12:08:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369575 states. [2019-10-02 12:08:12,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369575 states to 369575 states and 557820 transitions. [2019-10-02 12:08:12,930 INFO L78 Accepts]: Start accepts. Automaton has 369575 states and 557820 transitions. Word has length 408 [2019-10-02 12:08:12,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:12,931 INFO L475 AbstractCegarLoop]: Abstraction has 369575 states and 557820 transitions. [2019-10-02 12:08:12,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:08:12,931 INFO L276 IsEmpty]: Start isEmpty. Operand 369575 states and 557820 transitions. [2019-10-02 12:08:12,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-10-02 12:08:12,943 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:12,943 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:12,944 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:12,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:12,944 INFO L82 PathProgramCache]: Analyzing trace with hash -330297812, now seen corresponding path program 1 times [2019-10-02 12:08:12,944 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:12,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:12,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:12,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:12,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:13,253 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 32 proven. 21 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2019-10-02 12:08:13,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:08:13,253 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:08:13,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:14,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 4560 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:08:14,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:08:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2019-10-02 12:08:14,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:08:14,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2019-10-02 12:08:14,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:08:14,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:08:14,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:08:14,180 INFO L87 Difference]: Start difference. First operand 369575 states and 557820 transitions. Second operand 13 states. [2019-10-02 12:09:00,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:09:00,747 INFO L93 Difference]: Finished difference Result 764814 states and 1177797 transitions. [2019-10-02 12:09:00,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:09:00,747 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 411 [2019-10-02 12:09:00,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:09:02,461 INFO L225 Difference]: With dead ends: 764814 [2019-10-02 12:09:02,461 INFO L226 Difference]: Without dead ends: 395409 [2019-10-02 12:09:03,937 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 438 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=1010, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 12:09:04,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395409 states. [2019-10-02 12:09:33,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395409 to 392555. [2019-10-02 12:09:33,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392555 states. [2019-10-02 12:09:35,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392555 states to 392555 states and 593564 transitions. [2019-10-02 12:09:35,875 INFO L78 Accepts]: Start accepts. Automaton has 392555 states and 593564 transitions. Word has length 411 [2019-10-02 12:09:35,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:09:35,876 INFO L475 AbstractCegarLoop]: Abstraction has 392555 states and 593564 transitions. [2019-10-02 12:09:35,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:09:35,876 INFO L276 IsEmpty]: Start isEmpty. Operand 392555 states and 593564 transitions. [2019-10-02 12:09:35,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-10-02 12:09:35,887 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:09:35,887 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:09:35,887 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:09:35,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:09:35,888 INFO L82 PathProgramCache]: Analyzing trace with hash -953318386, now seen corresponding path program 1 times [2019-10-02 12:09:35,888 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:09:35,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:09:35,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:35,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:35,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:45,576 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 47 proven. 20 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-10-02 12:09:45,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:09:45,577 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:09:45,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:46,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 4563 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:09:46,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:09:46,486 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:09:46,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:09:46,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-10-02 12:09:46,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:09:46,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:09:46,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:09:46,510 INFO L87 Difference]: Start difference. First operand 392555 states and 593564 transitions. Second operand 12 states. [2019-10-02 12:10:39,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:39,189 INFO L93 Difference]: Finished difference Result 1062425 states and 1735611 transitions. [2019-10-02 12:10:39,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 12:10:39,189 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 414 [2019-10-02 12:10:39,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:43,193 INFO L225 Difference]: With dead ends: 1062425 [2019-10-02 12:10:43,193 INFO L226 Difference]: Without dead ends: 650026 [2019-10-02 12:10:55,883 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 437 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=251, Invalid=805, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 12:10:56,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650026 states. [2019-10-02 12:11:42,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650026 to 637235. [2019-10-02 12:11:42,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637235 states. [2019-10-02 12:11:47,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637235 states to 637235 states and 981712 transitions. [2019-10-02 12:11:47,765 INFO L78 Accepts]: Start accepts. Automaton has 637235 states and 981712 transitions. Word has length 414 [2019-10-02 12:11:47,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:47,766 INFO L475 AbstractCegarLoop]: Abstraction has 637235 states and 981712 transitions. [2019-10-02 12:11:47,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:11:47,766 INFO L276 IsEmpty]: Start isEmpty. Operand 637235 states and 981712 transitions. [2019-10-02 12:11:47,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2019-10-02 12:11:47,783 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:47,784 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:11:47,784 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:47,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:47,784 INFO L82 PathProgramCache]: Analyzing trace with hash 915564473, now seen corresponding path program 1 times [2019-10-02 12:11:47,784 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:47,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:47,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:47,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:47,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 50 proven. 26 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-10-02 12:11:48,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:11:48,116 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:11:48,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:48,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 4679 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 12:11:48,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:11:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 88 proven. 115 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-10-02 12:11:49,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:11:49,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-10-02 12:11:49,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 12:11:49,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 12:11:49,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:11:49,040 INFO L87 Difference]: Start difference. First operand 637235 states and 981712 transitions. Second operand 19 states.