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_product09.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 03:45:16,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 03:45:16,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 03:45:16,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 03:45:16,591 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 03:45:16,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 03:45:16,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 03:45:16,595 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 03:45:16,597 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 03:45:16,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 03:45:16,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 03:45:16,600 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 03:45:16,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 03:45:16,601 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 03:45:16,602 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 03:45:16,603 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 03:45:16,604 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 03:45:16,605 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 03:45:16,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 03:45:16,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 03:45:16,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 03:45:16,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 03:45:16,613 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 03:45:16,614 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 03:45:16,617 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 03:45:16,617 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 03:45:16,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 03:45:16,618 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 03:45:16,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 03:45:16,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 03:45:16,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 03:45:16,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 03:45:16,622 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 03:45:16,623 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 03:45:16,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 03:45:16,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 03:45:16,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 03:45:16,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 03:45:16,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 03:45:16,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 03:45:16,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 03:45:16,628 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-09-08 03:45:16,643 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 03:45:16,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 03:45:16,644 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 03:45:16,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 03:45:16,645 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 03:45:16,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 03:45:16,645 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 03:45:16,646 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 03:45:16,646 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 03:45:16,646 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 03:45:16,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 03:45:16,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 03:45:16,647 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 03:45:16,647 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 03:45:16,647 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 03:45:16,647 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 03:45:16,647 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 03:45:16,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 03:45:16,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 03:45:16,648 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 03:45:16,648 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 03:45:16,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:45:16,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 03:45:16,649 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 03:45:16,649 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 03:45:16,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 03:45:16,649 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 03:45:16,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 03:45:16,650 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 03:45:16,682 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 03:45:16,695 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 03:45:16,699 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 03:45:16,700 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 03:45:16,701 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 03:45:16,701 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product09.cil.c [2019-09-08 03:45:16,767 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a8eca3ad/ae4b14e84b834ffbae4d56317aa21b9c/FLAG7c07abb86 [2019-09-08 03:45:17,392 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 03:45:17,393 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product09.cil.c [2019-09-08 03:45:17,433 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a8eca3ad/ae4b14e84b834ffbae4d56317aa21b9c/FLAG7c07abb86 [2019-09-08 03:45:17,609 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a8eca3ad/ae4b14e84b834ffbae4d56317aa21b9c [2019-09-08 03:45:17,619 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 03:45:17,620 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 03:45:17,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 03:45:17,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 03:45:17,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 03:45:17,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:45:17" (1/1) ... [2019-09-08 03:45:17,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@706649c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:45:17, skipping insertion in model container [2019-09-08 03:45:17,630 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:45:17" (1/1) ... [2019-09-08 03:45:17,637 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 03:45:17,718 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 03:45:18,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:45:18,424 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 03:45:18,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:45:18,628 INFO L192 MainTranslator]: Completed translation [2019-09-08 03:45:18,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:45:18 WrapperNode [2019-09-08 03:45:18,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 03:45:18,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 03:45:18,630 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 03:45:18,630 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 03:45:18,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:45:18" (1/1) ... [2019-09-08 03:45:18,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:45:18" (1/1) ... [2019-09-08 03:45:18,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:45:18" (1/1) ... [2019-09-08 03:45:18,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:45:18" (1/1) ... [2019-09-08 03:45:18,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:45:18" (1/1) ... [2019-09-08 03:45:18,806 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:45:18" (1/1) ... [2019-09-08 03:45:18,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:45:18" (1/1) ... [2019-09-08 03:45:18,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 03:45:18,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 03:45:18,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 03:45:18,836 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 03:45:18,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:45:18" (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-09-08 03:45:18,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 03:45:18,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 03:45:18,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 03:45:18,931 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 03:45:18,932 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 03:45:18,932 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 03:45:18,933 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 03:45:18,933 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 03:45:18,934 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 03:45:18,934 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 03:45:18,934 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 03:45:18,934 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 03:45:18,935 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 03:45:18,935 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 03:45:18,936 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 03:45:18,936 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 03:45:18,938 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 03:45:18,939 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 03:45:18,939 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 03:45:18,939 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 03:45:18,939 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 03:45:18,939 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 03:45:18,940 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 03:45:18,940 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 03:45:18,940 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 03:45:18,940 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 03:45:18,940 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 03:45:18,940 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 03:45:18,941 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 03:45:18,941 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 03:45:18,941 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 03:45:18,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-09-08 03:45:18,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-09-08 03:45:18,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-09-08 03:45:18,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-09-08 03:45:18,942 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 03:45:18,942 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 03:45:18,942 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 03:45:18,942 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 03:45:18,943 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 03:45:18,943 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 03:45:18,943 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 03:45:18,943 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 03:45:18,943 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 03:45:18,943 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 03:45:18,943 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 03:45:18,944 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 03:45:18,944 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 03:45:18,944 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 03:45:18,944 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 03:45:18,945 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 03:45:18,945 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 03:45:18,945 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 03:45:18,945 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 03:45:18,945 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 03:45:18,945 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 03:45:18,945 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 03:45:18,946 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 03:45:18,947 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 03:45:18,947 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 03:45:18,947 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 03:45:18,947 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 03:45:18,947 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 03:45:18,948 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 03:45:18,948 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 03:45:18,948 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 03:45:18,949 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 03:45:18,949 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 03:45:18,949 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 03:45:18,949 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 03:45:18,949 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 03:45:18,950 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 03:45:18,950 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 03:45:18,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 03:45:18,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 03:45:18,951 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 03:45:18,951 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 03:45:18,951 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 03:45:18,952 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 03:45:18,952 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 03:45:18,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 03:45:18,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 03:45:18,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 03:45:18,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 03:45:18,953 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 03:45:18,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 03:45:18,953 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 03:45:18,954 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 03:45:18,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 03:45:18,954 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 03:45:18,955 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 03:45:18,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 03:45:18,955 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 03:45:18,955 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 03:45:18,956 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 03:45:18,956 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 03:45:18,956 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 03:45:18,956 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 03:45:18,956 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 03:45:18,957 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 03:45:18,957 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 03:45:18,957 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 03:45:18,957 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 03:45:18,957 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 03:45:18,958 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 03:45:18,958 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 03:45:18,958 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 03:45:18,958 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 03:45:18,958 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 03:45:18,959 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 03:45:18,959 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 03:45:18,959 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 03:45:18,959 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 03:45:18,959 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 03:45:18,960 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 03:45:18,960 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 03:45:18,960 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 03:45:18,960 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 03:45:18,961 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 03:45:18,961 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 03:45:18,961 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-09-08 03:45:18,962 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-09-08 03:45:18,962 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 03:45:18,962 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 03:45:18,963 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 03:45:18,963 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 03:45:18,964 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 03:45:18,964 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-09-08 03:45:18,964 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-09-08 03:45:18,964 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 03:45:18,964 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 03:45:18,965 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 03:45:18,965 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 03:45:18,965 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 03:45:18,965 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 03:45:18,965 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 03:45:18,969 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 03:45:18,969 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 03:45:18,969 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 03:45:18,970 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 03:45:18,973 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 03:45:18,974 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 03:45:18,974 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 03:45:18,975 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 03:45:18,980 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 03:45:18,980 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 03:45:18,980 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 03:45:18,981 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 03:45:18,981 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 03:45:18,981 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 03:45:18,982 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 03:45:18,982 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 03:45:18,982 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 03:45:18,983 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 03:45:18,983 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 03:45:18,983 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 03:45:18,983 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 03:45:18,983 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 03:45:18,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 03:45:18,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 03:45:18,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 03:45:21,478 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 03:45:21,479 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 03:45:21,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:45:21 BoogieIcfgContainer [2019-09-08 03:45:21,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 03:45:21,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 03:45:21,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 03:45:21,485 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 03:45:21,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 03:45:17" (1/3) ... [2019-09-08 03:45:21,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43337c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:45:21, skipping insertion in model container [2019-09-08 03:45:21,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:45:18" (2/3) ... [2019-09-08 03:45:21,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43337c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:45:21, skipping insertion in model container [2019-09-08 03:45:21,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:45:21" (3/3) ... [2019-09-08 03:45:21,488 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product09.cil.c [2019-09-08 03:45:21,502 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 03:45:21,513 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 03:45:21,532 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 03:45:21,574 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 03:45:21,575 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 03:45:21,575 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 03:45:21,576 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 03:45:21,576 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 03:45:21,576 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 03:45:21,576 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 03:45:21,576 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 03:45:21,576 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 03:45:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states. [2019-09-08 03:45:21,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 03:45:21,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:21,645 INFO L399 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-09-08 03:45:21,648 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:21,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:21,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1329174793, now seen corresponding path program 1 times [2019-09-08 03:45:21,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:21,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:21,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:21,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:21,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:22,282 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:45:22,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:22,285 INFO L223 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-09-08 03:45:22,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:22,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 3175 conjuncts, 1 conjunts are in the unsatisfiable core [2019-09-08 03:45:22,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 03:45:22,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:22,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-09-08 03:45:22,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:45:22,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:45:22,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:45:22,946 INFO L87 Difference]: Start difference. First operand 738 states. Second operand 4 states. [2019-09-08 03:45:23,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:23,211 INFO L93 Difference]: Finished difference Result 1160 states and 1895 transitions. [2019-09-08 03:45:23,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:45:23,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-08 03:45:23,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:23,249 INFO L225 Difference]: With dead ends: 1160 [2019-09-08 03:45:23,250 INFO L226 Difference]: Without dead ends: 584 [2019-09-08 03:45:23,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 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-09-08 03:45:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-09-08 03:45:23,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-09-08 03:45:23,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-08 03:45:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 941 transitions. [2019-09-08 03:45:23,389 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 941 transitions. Word has length 138 [2019-09-08 03:45:23,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:23,390 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 941 transitions. [2019-09-08 03:45:23,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:45:23,390 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 941 transitions. [2019-09-08 03:45:23,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 03:45:23,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:23,400 INFO L399 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, 1, 1] [2019-09-08 03:45:23,400 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:23,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:23,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1148939338, now seen corresponding path program 1 times [2019-09-08 03:45:23,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:23,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:23,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:23,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:23,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:45:23,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:23,655 INFO L223 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-09-08 03:45:23,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:24,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 3180 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:45:24,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:24,271 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 03:45:24,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:24,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:45:24,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:45:24,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:45:24,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:45:24,287 INFO L87 Difference]: Start difference. First operand 584 states and 941 transitions. Second operand 6 states. [2019-09-08 03:45:24,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:24,430 INFO L93 Difference]: Finished difference Result 1140 states and 1855 transitions. [2019-09-08 03:45:24,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:45:24,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-08 03:45:24,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:24,445 INFO L225 Difference]: With dead ends: 1140 [2019-09-08 03:45:24,445 INFO L226 Difference]: Without dead ends: 584 [2019-09-08 03:45:24,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 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-09-08 03:45:24,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-09-08 03:45:24,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-09-08 03:45:24,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-08 03:45:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 940 transitions. [2019-09-08 03:45:24,505 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 940 transitions. Word has length 142 [2019-09-08 03:45:24,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:24,507 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 940 transitions. [2019-09-08 03:45:24,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:45:24,510 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 940 transitions. [2019-09-08 03:45:24,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 03:45:24,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:24,519 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:45:24,519 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:24,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:24,520 INFO L82 PathProgramCache]: Analyzing trace with hash -333550332, now seen corresponding path program 1 times [2019-09-08 03:45:24,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:24,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:24,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:24,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:24,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:24,731 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:45:24,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:24,731 INFO L223 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-09-08 03:45:24,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:25,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 3182 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:45:25,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:25,361 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 03:45:25,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:25,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:45:25,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:45:25,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:45:25,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:45:25,370 INFO L87 Difference]: Start difference. First operand 584 states and 940 transitions. Second operand 6 states. [2019-09-08 03:45:25,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:25,479 INFO L93 Difference]: Finished difference Result 1144 states and 1858 transitions. [2019-09-08 03:45:25,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:45:25,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-09-08 03:45:25,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:25,486 INFO L225 Difference]: With dead ends: 1144 [2019-09-08 03:45:25,486 INFO L226 Difference]: Without dead ends: 590 [2019-09-08 03:45:25,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 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-09-08 03:45:25,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-09-08 03:45:25,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-09-08 03:45:25,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 03:45:25,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 945 transitions. [2019-09-08 03:45:25,527 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 945 transitions. Word has length 144 [2019-09-08 03:45:25,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:25,527 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 945 transitions. [2019-09-08 03:45:25,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:45:25,527 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 945 transitions. [2019-09-08 03:45:25,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 03:45:25,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:25,537 INFO L399 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, 1, 1, 1, 1, 1] [2019-09-08 03:45:25,537 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:25,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:25,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2025668661, now seen corresponding path program 1 times [2019-09-08 03:45:25,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:25,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:25,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:25,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:25,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:25,701 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:45:25,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:25,701 INFO L223 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-09-08 03:45:25,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:26,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 3183 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:45:26,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:26,325 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-09-08 03:45:26,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:26,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:45:26,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:45:26,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:45:26,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:45:26,344 INFO L87 Difference]: Start difference. First operand 590 states and 945 transitions. Second operand 6 states. [2019-09-08 03:45:26,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:26,442 INFO L93 Difference]: Finished difference Result 1143 states and 1849 transitions. [2019-09-08 03:45:26,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:45:26,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-09-08 03:45:26,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:26,447 INFO L225 Difference]: With dead ends: 1143 [2019-09-08 03:45:26,448 INFO L226 Difference]: Without dead ends: 590 [2019-09-08 03:45:26,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 145 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-09-08 03:45:26,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-09-08 03:45:26,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-09-08 03:45:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 03:45:26,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 944 transitions. [2019-09-08 03:45:26,479 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 944 transitions. Word has length 145 [2019-09-08 03:45:26,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:26,480 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 944 transitions. [2019-09-08 03:45:26,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:45:26,480 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 944 transitions. [2019-09-08 03:45:26,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 03:45:26,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:26,486 INFO L399 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, 1, 1, 1, 1, 1, 1] [2019-09-08 03:45:26,486 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:26,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:26,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1147712472, now seen corresponding path program 1 times [2019-09-08 03:45:26,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:26,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:26,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:26,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:26,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:26,673 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:45:26,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:26,674 INFO L223 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-09-08 03:45:26,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:27,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 3184 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:45:27,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:27,260 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 03:45:27,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:27,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:45:27,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:45:27,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:45:27,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:45:27,272 INFO L87 Difference]: Start difference. First operand 590 states and 944 transitions. Second operand 6 states. [2019-09-08 03:45:27,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:27,361 INFO L93 Difference]: Finished difference Result 1143 states and 1848 transitions. [2019-09-08 03:45:27,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:45:27,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2019-09-08 03:45:27,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:27,374 INFO L225 Difference]: With dead ends: 1143 [2019-09-08 03:45:27,375 INFO L226 Difference]: Without dead ends: 590 [2019-09-08 03:45:27,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 146 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-09-08 03:45:27,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-09-08 03:45:27,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-09-08 03:45:27,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-09-08 03:45:27,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 943 transitions. [2019-09-08 03:45:27,405 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 943 transitions. Word has length 146 [2019-09-08 03:45:27,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:27,406 INFO L475 AbstractCegarLoop]: Abstraction has 590 states and 943 transitions. [2019-09-08 03:45:27,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:45:27,406 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 943 transitions. [2019-09-08 03:45:27,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 03:45:27,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:27,410 INFO L399 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:45:27,411 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:27,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:27,411 INFO L82 PathProgramCache]: Analyzing trace with hash 261961625, now seen corresponding path program 1 times [2019-09-08 03:45:27,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:27,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:27,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:27,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:27,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:27,646 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 03:45:27,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:27,646 INFO L223 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-09-08 03:45:27,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:28,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 3185 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 03:45:28,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Stream closed [2019-09-08 03:45:28,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:28,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2019-09-08 03:45:28,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:45:28,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:45:28,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:45:28,281 INFO L87 Difference]: Start difference. First operand 590 states and 943 transitions. Second operand 15 states. [2019-09-08 03:45:28,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:28,539 INFO L93 Difference]: Finished difference Result 1148 states and 1855 transitions. [2019-09-08 03:45:28,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:45:28,540 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 147 [2019-09-08 03:45:28,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:28,552 INFO L225 Difference]: With dead ends: 1148 [2019-09-08 03:45:28,552 INFO L226 Difference]: Without dead ends: 599 [2019-09-08 03:45:28,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 146 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-09-08 03:45:28,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-08 03:45:28,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2019-09-08 03:45:28,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-09-08 03:45:28,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 953 transitions. [2019-09-08 03:45:28,619 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 953 transitions. Word has length 147 [2019-09-08 03:45:28,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:28,621 INFO L475 AbstractCegarLoop]: Abstraction has 597 states and 953 transitions. [2019-09-08 03:45:28,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:45:28,621 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 953 transitions. [2019-09-08 03:45:28,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 03:45:28,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:28,627 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:45:28,627 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:28,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:28,628 INFO L82 PathProgramCache]: Analyzing trace with hash -654338191, now seen corresponding path program 1 times [2019-09-08 03:45:28,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:28,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:28,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:28,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:28,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:28,787 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 03:45:28,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:28,788 INFO L223 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) [2019-09-08 03:45:28,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:45:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:29,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 3186 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:45:29,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:45:29,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:29,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:45:29,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:45:29,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:45:29,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:45:29,486 INFO L87 Difference]: Start difference. First operand 597 states and 953 transitions. Second operand 8 states. [2019-09-08 03:45:29,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:29,861 INFO L93 Difference]: Finished difference Result 1155 states and 1868 transitions. [2019-09-08 03:45:29,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:45:29,861 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 148 [2019-09-08 03:45:29,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:29,867 INFO L225 Difference]: With dead ends: 1155 [2019-09-08 03:45:29,868 INFO L226 Difference]: Without dead ends: 597 [2019-09-08 03:45:29,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 150 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-09-08 03:45:29,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-09-08 03:45:29,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2019-09-08 03:45:29,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-09-08 03:45:29,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 948 transitions. [2019-09-08 03:45:29,896 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 948 transitions. Word has length 148 [2019-09-08 03:45:29,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:29,897 INFO L475 AbstractCegarLoop]: Abstraction has 597 states and 948 transitions. [2019-09-08 03:45:29,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:45:29,898 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 948 transitions. [2019-09-08 03:45:29,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 03:45:29,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:29,902 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:45:29,902 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:29,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:29,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1770571481, now seen corresponding path program 1 times [2019-09-08 03:45:29,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:29,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:29,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:29,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:29,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 03:45:30,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:30,049 INFO L223 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) [2019-09-08 03:45:30,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:45:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:30,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 3188 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:45:30,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:30,607 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-09-08 03:45:30,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:30,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:45:30,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:45:30,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:45:30,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:45:30,625 INFO L87 Difference]: Start difference. First operand 597 states and 948 transitions. Second operand 8 states. [2019-09-08 03:45:30,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:30,932 INFO L93 Difference]: Finished difference Result 1155 states and 1858 transitions. [2019-09-08 03:45:30,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:45:30,932 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 150 [2019-09-08 03:45:30,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:30,937 INFO L225 Difference]: With dead ends: 1155 [2019-09-08 03:45:30,938 INFO L226 Difference]: Without dead ends: 597 [2019-09-08 03:45:30,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 152 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-09-08 03:45:30,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-09-08 03:45:30,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2019-09-08 03:45:30,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-09-08 03:45:30,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 943 transitions. [2019-09-08 03:45:30,964 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 943 transitions. Word has length 150 [2019-09-08 03:45:30,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:30,964 INFO L475 AbstractCegarLoop]: Abstraction has 597 states and 943 transitions. [2019-09-08 03:45:30,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:45:30,964 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 943 transitions. [2019-09-08 03:45:30,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 03:45:30,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:30,969 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:45:30,969 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:30,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:30,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1535082471, now seen corresponding path program 1 times [2019-09-08 03:45:30,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:30,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:30,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:30,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:30,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 03:45:31,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:31,145 INFO L223 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-09-08 03:45:31,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:32,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:32,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 3190 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:45:32,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:32,077 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 (10)] Exception during sending of exit command (exit): Stream closed [2019-09-08 03:45:32,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:32,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:45:32,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:45:32,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:45:32,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:45:32,098 INFO L87 Difference]: Start difference. First operand 597 states and 943 transitions. Second operand 8 states. [2019-09-08 03:45:32,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:32,595 INFO L93 Difference]: Finished difference Result 1176 states and 1879 transitions. [2019-09-08 03:45:32,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:45:32,596 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 152 [2019-09-08 03:45:32,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:32,603 INFO L225 Difference]: With dead ends: 1176 [2019-09-08 03:45:32,604 INFO L226 Difference]: Without dead ends: 624 [2019-09-08 03:45:32,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 154 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-09-08 03:45:32,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-09-08 03:45:32,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 621. [2019-09-08 03:45:32,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-09-08 03:45:32,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 970 transitions. [2019-09-08 03:45:32,653 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 970 transitions. Word has length 152 [2019-09-08 03:45:32,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:32,654 INFO L475 AbstractCegarLoop]: Abstraction has 621 states and 970 transitions. [2019-09-08 03:45:32,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:45:32,654 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 970 transitions. [2019-09-08 03:45:32,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 03:45:32,661 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:32,661 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:45:32,662 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:32,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:32,662 INFO L82 PathProgramCache]: Analyzing trace with hash 819565415, now seen corresponding path program 1 times [2019-09-08 03:45:32,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:32,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:32,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:32,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:32,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:32,877 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 03:45:32,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:32,878 INFO L223 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-09-08 03:45:32,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:33,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 3186 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 03:45:33,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:33,706 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:45:33,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:33,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-09-08 03:45:33,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:45:33,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:45:33,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:45:33,729 INFO L87 Difference]: Start difference. First operand 621 states and 970 transitions. Second operand 14 states. [2019-09-08 03:45:34,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:34,294 INFO L93 Difference]: Finished difference Result 1177 states and 1860 transitions. [2019-09-08 03:45:34,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:45:34,295 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 152 [2019-09-08 03:45:34,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:34,303 INFO L225 Difference]: With dead ends: 1177 [2019-09-08 03:45:34,304 INFO L226 Difference]: Without dead ends: 643 [2019-09-08 03:45:34,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:45:34,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-09-08 03:45:34,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 632. [2019-09-08 03:45:34,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-09-08 03:45:34,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 991 transitions. [2019-09-08 03:45:34,359 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 991 transitions. Word has length 152 [2019-09-08 03:45:34,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:34,360 INFO L475 AbstractCegarLoop]: Abstraction has 632 states and 991 transitions. [2019-09-08 03:45:34,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:45:34,360 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 991 transitions. [2019-09-08 03:45:34,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 03:45:34,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:34,368 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:45:34,369 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:34,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:34,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1523822727, now seen corresponding path program 1 times [2019-09-08 03:45:34,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:34,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:34,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:34,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:34,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:34,543 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 03:45:34,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:34,544 INFO L223 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-09-08 03:45:34,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:35,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 3189 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:45:35,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:35,523 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:45:35,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:35,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:45:35,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:45:35,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:45:35,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:45:35,545 INFO L87 Difference]: Start difference. First operand 632 states and 991 transitions. Second operand 6 states. [2019-09-08 03:45:35,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:35,989 INFO L93 Difference]: Finished difference Result 1226 states and 1944 transitions. [2019-09-08 03:45:35,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:45:35,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2019-09-08 03:45:35,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:35,995 INFO L225 Difference]: With dead ends: 1226 [2019-09-08 03:45:35,995 INFO L226 Difference]: Without dead ends: 597 [2019-09-08 03:45:35,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 152 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-09-08 03:45:36,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-09-08 03:45:36,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2019-09-08 03:45:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-09-08 03:45:36,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 928 transitions. [2019-09-08 03:45:36,026 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 928 transitions. Word has length 152 [2019-09-08 03:45:36,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:36,028 INFO L475 AbstractCegarLoop]: Abstraction has 597 states and 928 transitions. [2019-09-08 03:45:36,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:45:36,028 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 928 transitions. [2019-09-08 03:45:36,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 03:45:36,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:36,032 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:45:36,033 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:36,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:36,033 INFO L82 PathProgramCache]: Analyzing trace with hash 272043983, now seen corresponding path program 1 times [2019-09-08 03:45:36,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:36,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:36,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:36,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:36,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:36,193 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 03:45:36,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:36,194 INFO L223 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-09-08 03:45:36,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:36,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 3194 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:45:36,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:36,781 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:45:36,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:36,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:45:36,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:45:36,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:45:36,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:45:36,791 INFO L87 Difference]: Start difference. First operand 597 states and 928 transitions. Second operand 8 states. [2019-09-08 03:45:36,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:36,990 INFO L93 Difference]: Finished difference Result 1144 states and 1803 transitions. [2019-09-08 03:45:36,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:45:36,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 156 [2019-09-08 03:45:36,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:36,995 INFO L225 Difference]: With dead ends: 1144 [2019-09-08 03:45:36,995 INFO L226 Difference]: Without dead ends: 597 [2019-09-08 03:45:36,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 158 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-09-08 03:45:37,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-09-08 03:45:37,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2019-09-08 03:45:37,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-09-08 03:45:37,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 927 transitions. [2019-09-08 03:45:37,020 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 927 transitions. Word has length 156 [2019-09-08 03:45:37,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:37,021 INFO L475 AbstractCegarLoop]: Abstraction has 597 states and 927 transitions. [2019-09-08 03:45:37,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:45:37,021 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 927 transitions. [2019-09-08 03:45:37,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 03:45:37,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:37,026 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:45:37,026 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:37,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:37,026 INFO L82 PathProgramCache]: Analyzing trace with hash -101707020, now seen corresponding path program 1 times [2019-09-08 03:45:37,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:37,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:37,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:37,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:37,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:37,245 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 03:45:37,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:37,246 INFO L223 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-09-08 03:45:37,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:37,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 3195 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 03:45:37,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:37,884 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:45:37,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:37,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2019-09-08 03:45:37,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 03:45:37,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 03:45:37,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-08 03:45:37,893 INFO L87 Difference]: Start difference. First operand 597 states and 927 transitions. Second operand 18 states. [2019-09-08 03:45:38,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:38,633 INFO L93 Difference]: Finished difference Result 1160 states and 1830 transitions. [2019-09-08 03:45:38,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 03:45:38,634 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 157 [2019-09-08 03:45:38,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:38,641 INFO L225 Difference]: With dead ends: 1160 [2019-09-08 03:45:38,641 INFO L226 Difference]: Without dead ends: 612 [2019-09-08 03:45:38,645 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 159 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-09-08 03:45:38,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-08 03:45:38,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 608. [2019-09-08 03:45:38,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-09-08 03:45:38,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 935 transitions. [2019-09-08 03:45:38,713 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 935 transitions. Word has length 157 [2019-09-08 03:45:38,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:38,713 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 935 transitions. [2019-09-08 03:45:38,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 03:45:38,714 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 935 transitions. [2019-09-08 03:45:38,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 03:45:38,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:38,718 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:45:38,718 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:38,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:38,719 INFO L82 PathProgramCache]: Analyzing trace with hash 747290421, now seen corresponding path program 1 times [2019-09-08 03:45:38,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:38,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:38,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:38,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:38,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:38,900 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 03:45:38,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:45:38,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:45:38,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:45:38,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:45:38,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:45:38,902 INFO L87 Difference]: Start difference. First operand 608 states and 935 transitions. Second operand 9 states. [2019-09-08 03:45:39,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:39,088 INFO L93 Difference]: Finished difference Result 1091 states and 1726 transitions. [2019-09-08 03:45:39,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:45:39,089 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2019-09-08 03:45:39,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:39,093 INFO L225 Difference]: With dead ends: 1091 [2019-09-08 03:45:39,094 INFO L226 Difference]: Without dead ends: 605 [2019-09-08 03:45:39,097 INFO L628 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-09-08 03:45:39,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-09-08 03:45:39,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-09-08 03:45:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-09-08 03:45:39,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 930 transitions. [2019-09-08 03:45:39,121 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 930 transitions. Word has length 158 [2019-09-08 03:45:39,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:39,121 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 930 transitions. [2019-09-08 03:45:39,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:45:39,121 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 930 transitions. [2019-09-08 03:45:39,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 03:45:39,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:39,126 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:45:39,126 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:39,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:39,126 INFO L82 PathProgramCache]: Analyzing trace with hash 282772150, now seen corresponding path program 1 times [2019-09-08 03:45:39,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:39,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:39,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:39,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:39,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 03:45:39,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:45:39,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:45:39,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:45:39,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:45:39,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:45:39,277 INFO L87 Difference]: Start difference. First operand 605 states and 930 transitions. Second operand 7 states. [2019-09-08 03:45:39,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:39,373 INFO L93 Difference]: Finished difference Result 1088 states and 1721 transitions. [2019-09-08 03:45:39,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:45:39,373 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 159 [2019-09-08 03:45:39,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:39,377 INFO L225 Difference]: With dead ends: 1088 [2019-09-08 03:45:39,378 INFO L226 Difference]: Without dead ends: 584 [2019-09-08 03:45:39,382 INFO L628 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-09-08 03:45:39,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-09-08 03:45:39,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 582. [2019-09-08 03:45:39,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-09-08 03:45:39,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 900 transitions. [2019-09-08 03:45:39,402 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 900 transitions. Word has length 159 [2019-09-08 03:45:39,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:39,403 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 900 transitions. [2019-09-08 03:45:39,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:45:39,403 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 900 transitions. [2019-09-08 03:45:39,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 03:45:39,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:39,407 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:45:39,408 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:39,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:39,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1450567751, now seen corresponding path program 1 times [2019-09-08 03:45:39,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:39,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:39,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:39,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:39,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:39,703 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 03:45:39,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:45:39,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 03:45:39,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:45:39,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:45:39,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:45:39,706 INFO L87 Difference]: Start difference. First operand 582 states and 900 transitions. Second operand 13 states. [2019-09-08 03:45:40,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:40,066 INFO L93 Difference]: Finished difference Result 1066 states and 1689 transitions. [2019-09-08 03:45:40,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:45:40,066 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 159 [2019-09-08 03:45:40,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:40,070 INFO L225 Difference]: With dead ends: 1066 [2019-09-08 03:45:40,070 INFO L226 Difference]: Without dead ends: 575 [2019-09-08 03:45:40,074 INFO L628 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-09-08 03:45:40,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-09-08 03:45:40,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-09-08 03:45:40,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-09-08 03:45:40,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 891 transitions. [2019-09-08 03:45:40,093 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 891 transitions. Word has length 159 [2019-09-08 03:45:40,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:40,096 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 891 transitions. [2019-09-08 03:45:40,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:45:40,096 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 891 transitions. [2019-09-08 03:45:40,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 03:45:40,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:40,100 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:45:40,100 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:40,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:40,101 INFO L82 PathProgramCache]: Analyzing trace with hash 510737970, now seen corresponding path program 1 times [2019-09-08 03:45:40,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:40,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:40,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:40,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:40,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:40,403 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 03:45:40,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:45:40,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 03:45:40,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:45:40,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:45:40,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:45:40,409 INFO L87 Difference]: Start difference. First operand 575 states and 891 transitions. Second operand 13 states. [2019-09-08 03:45:40,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:40,817 INFO L93 Difference]: Finished difference Result 1117 states and 1757 transitions. [2019-09-08 03:45:40,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:45:40,818 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 160 [2019-09-08 03:45:40,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:40,823 INFO L225 Difference]: With dead ends: 1117 [2019-09-08 03:45:40,823 INFO L226 Difference]: Without dead ends: 589 [2019-09-08 03:45:40,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-09-08 03:45:40,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-08 03:45:40,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 587. [2019-09-08 03:45:40,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-09-08 03:45:40,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 906 transitions. [2019-09-08 03:45:40,850 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 906 transitions. Word has length 160 [2019-09-08 03:45:40,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:40,851 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 906 transitions. [2019-09-08 03:45:40,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:45:40,851 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 906 transitions. [2019-09-08 03:45:40,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 03:45:40,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:40,855 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:45:40,855 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:40,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:40,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1236703458, now seen corresponding path program 1 times [2019-09-08 03:45:40,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:40,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:40,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:40,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:40,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:41,084 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 03:45:41,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:45:41,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:45:41,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:45:41,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:45:41,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:45:41,086 INFO L87 Difference]: Start difference. First operand 587 states and 906 transitions. Second operand 11 states. [2019-09-08 03:45:41,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:41,456 INFO L93 Difference]: Finished difference Result 1071 states and 1695 transitions. [2019-09-08 03:45:41,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:45:41,457 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 161 [2019-09-08 03:45:41,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:41,464 INFO L225 Difference]: With dead ends: 1071 [2019-09-08 03:45:41,464 INFO L226 Difference]: Without dead ends: 587 [2019-09-08 03:45:41,468 INFO L628 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-09-08 03:45:41,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-09-08 03:45:41,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-09-08 03:45:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-09-08 03:45:41,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 905 transitions. [2019-09-08 03:45:41,501 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 905 transitions. Word has length 161 [2019-09-08 03:45:41,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:41,501 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 905 transitions. [2019-09-08 03:45:41,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:45:41,501 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 905 transitions. [2019-09-08 03:45:41,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 03:45:41,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:41,506 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:45:41,506 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:41,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:41,506 INFO L82 PathProgramCache]: Analyzing trace with hash 2003437219, now seen corresponding path program 1 times [2019-09-08 03:45:41,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:41,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:41,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:41,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:41,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:41,760 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 03:45:41,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:45:41,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:45:41,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:45:41,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:45:41,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:45:41,763 INFO L87 Difference]: Start difference. First operand 587 states and 905 transitions. Second operand 11 states. [2019-09-08 03:45:42,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:42,037 INFO L93 Difference]: Finished difference Result 1117 states and 1748 transitions. [2019-09-08 03:45:42,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:45:42,037 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 162 [2019-09-08 03:45:42,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:42,042 INFO L225 Difference]: With dead ends: 1117 [2019-09-08 03:45:42,042 INFO L226 Difference]: Without dead ends: 584 [2019-09-08 03:45:42,045 INFO L628 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-09-08 03:45:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-09-08 03:45:42,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-09-08 03:45:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-08 03:45:42,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 897 transitions. [2019-09-08 03:45:42,062 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 897 transitions. Word has length 162 [2019-09-08 03:45:42,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:42,064 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 897 transitions. [2019-09-08 03:45:42,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:45:42,064 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 897 transitions. [2019-09-08 03:45:42,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 03:45:42,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:42,068 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:45:42,068 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:42,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:42,068 INFO L82 PathProgramCache]: Analyzing trace with hash -394050151, now seen corresponding path program 1 times [2019-09-08 03:45:42,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:42,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:42,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:42,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:42,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:45:42,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:45:42,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:45:42,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:45:42,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:45:42,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:45:42,253 INFO L87 Difference]: Start difference. First operand 584 states and 897 transitions. Second operand 9 states. [2019-09-08 03:45:46,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:46,376 INFO L93 Difference]: Finished difference Result 1065 states and 1701 transitions. [2019-09-08 03:45:46,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:45:46,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 163 [2019-09-08 03:45:46,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:46,385 INFO L225 Difference]: With dead ends: 1065 [2019-09-08 03:45:46,387 INFO L226 Difference]: Without dead ends: 590 [2019-09-08 03:45:46,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 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-09-08 03:45:46,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-09-08 03:45:46,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 588. [2019-09-08 03:45:46,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-09-08 03:45:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 916 transitions. [2019-09-08 03:45:46,414 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 916 transitions. Word has length 163 [2019-09-08 03:45:46,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:46,415 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 916 transitions. [2019-09-08 03:45:46,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:45:46,415 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 916 transitions. [2019-09-08 03:45:46,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 03:45:46,419 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:46,419 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:45:46,419 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:46,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:46,420 INFO L82 PathProgramCache]: Analyzing trace with hash -335232507, now seen corresponding path program 1 times [2019-09-08 03:45:46,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:46,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:46,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:46,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:46,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:46,565 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:45:46,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:45:46,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 03:45:46,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:45:46,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:45:46,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:45:46,567 INFO L87 Difference]: Start difference. First operand 588 states and 916 transitions. Second operand 8 states. [2019-09-08 03:45:52,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:52,808 INFO L93 Difference]: Finished difference Result 1949 states and 3218 transitions. [2019-09-08 03:45:52,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 03:45:52,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 164 [2019-09-08 03:45:52,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:52,823 INFO L225 Difference]: With dead ends: 1949 [2019-09-08 03:45:52,823 INFO L226 Difference]: Without dead ends: 1470 [2019-09-08 03:45:52,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:45:52,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2019-09-08 03:45:52,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1431. [2019-09-08 03:45:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2019-09-08 03:45:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 2285 transitions. [2019-09-08 03:45:52,887 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 2285 transitions. Word has length 164 [2019-09-08 03:45:52,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:52,888 INFO L475 AbstractCegarLoop]: Abstraction has 1431 states and 2285 transitions. [2019-09-08 03:45:52,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:45:52,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 2285 transitions. [2019-09-08 03:45:52,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 03:45:52,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:52,892 INFO L399 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, 1, 1, 1, 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-09-08 03:45:52,892 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:52,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:52,893 INFO L82 PathProgramCache]: Analyzing trace with hash 879368408, now seen corresponding path program 1 times [2019-09-08 03:45:52,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:52,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:52,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:52,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:52,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:53,064 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:45:53,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:45:53,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:45:53,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:45:53,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:45:53,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:45:53,066 INFO L87 Difference]: Start difference. First operand 1431 states and 2285 transitions. Second operand 9 states. [2019-09-08 03:46:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:01,350 INFO L93 Difference]: Finished difference Result 4508 states and 7468 transitions. [2019-09-08 03:46:01,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:46:01,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 170 [2019-09-08 03:46:01,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:01,395 INFO L225 Difference]: With dead ends: 4508 [2019-09-08 03:46:01,395 INFO L226 Difference]: Without dead ends: 3186 [2019-09-08 03:46:01,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:46:01,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3186 states. [2019-09-08 03:46:01,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3186 to 2963. [2019-09-08 03:46:01,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2963 states. [2019-09-08 03:46:01,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2963 states to 2963 states and 4814 transitions. [2019-09-08 03:46:01,650 INFO L78 Accepts]: Start accepts. Automaton has 2963 states and 4814 transitions. Word has length 170 [2019-09-08 03:46:01,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:01,651 INFO L475 AbstractCegarLoop]: Abstraction has 2963 states and 4814 transitions. [2019-09-08 03:46:01,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:46:01,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2963 states and 4814 transitions. [2019-09-08 03:46:01,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 03:46:01,657 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:01,658 INFO L399 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, 1, 1, 1, 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-09-08 03:46:01,658 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:01,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:01,659 INFO L82 PathProgramCache]: Analyzing trace with hash 871609049, now seen corresponding path program 1 times [2019-09-08 03:46:01,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:01,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:01,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:01,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:01,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:01,882 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:46:01,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:46:01,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:46:01,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:46:01,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:46:01,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:46:01,884 INFO L87 Difference]: Start difference. First operand 2963 states and 4814 transitions. Second operand 7 states. [2019-09-08 03:46:07,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:07,361 INFO L93 Difference]: Finished difference Result 7565 states and 12542 transitions. [2019-09-08 03:46:07,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 03:46:07,362 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2019-09-08 03:46:07,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:07,406 INFO L225 Difference]: With dead ends: 7565 [2019-09-08 03:46:07,406 INFO L226 Difference]: Without dead ends: 5463 [2019-09-08 03:46:07,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:46:07,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5463 states. [2019-09-08 03:46:07,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5463 to 5370. [2019-09-08 03:46:07,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5370 states. [2019-09-08 03:46:07,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5370 states to 5370 states and 8816 transitions. [2019-09-08 03:46:07,709 INFO L78 Accepts]: Start accepts. Automaton has 5370 states and 8816 transitions. Word has length 170 [2019-09-08 03:46:07,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:07,709 INFO L475 AbstractCegarLoop]: Abstraction has 5370 states and 8816 transitions. [2019-09-08 03:46:07,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:46:07,710 INFO L276 IsEmpty]: Start isEmpty. Operand 5370 states and 8816 transitions. [2019-09-08 03:46:07,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 03:46:07,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:07,717 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:46:07,717 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:07,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:07,718 INFO L82 PathProgramCache]: Analyzing trace with hash 444088872, now seen corresponding path program 1 times [2019-09-08 03:46:07,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:07,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:07,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:07,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:07,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:07,951 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:46:07,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:46:07,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 03:46:07,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 03:46:07,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 03:46:07,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:46:07,952 INFO L87 Difference]: Start difference. First operand 5370 states and 8816 transitions. Second operand 5 states. [2019-09-08 03:46:08,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:08,220 INFO L93 Difference]: Finished difference Result 9887 states and 16338 transitions. [2019-09-08 03:46:08,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:46:08,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-09-08 03:46:08,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:08,271 INFO L225 Difference]: With dead ends: 9887 [2019-09-08 03:46:08,271 INFO L226 Difference]: Without dead ends: 5488 [2019-09-08 03:46:08,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:46:08,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5488 states. [2019-09-08 03:46:08,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5488 to 5422. [2019-09-08 03:46:08,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5422 states. [2019-09-08 03:46:08,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5422 states to 5422 states and 8889 transitions. [2019-09-08 03:46:08,551 INFO L78 Accepts]: Start accepts. Automaton has 5422 states and 8889 transitions. Word has length 175 [2019-09-08 03:46:08,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:08,552 INFO L475 AbstractCegarLoop]: Abstraction has 5422 states and 8889 transitions. [2019-09-08 03:46:08,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 03:46:08,552 INFO L276 IsEmpty]: Start isEmpty. Operand 5422 states and 8889 transitions. [2019-09-08 03:46:08,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 03:46:08,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:08,557 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:46:08,558 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:08,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:08,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1893422493, now seen corresponding path program 1 times [2019-09-08 03:46:08,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:08,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:08,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:08,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:08,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:08,700 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 03:46:08,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:46:08,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:46:08,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:46:08,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:46:08,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:46:08,702 INFO L87 Difference]: Start difference. First operand 5422 states and 8889 transitions. Second operand 7 states. [2019-09-08 03:46:09,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:09,045 INFO L93 Difference]: Finished difference Result 10463 states and 17454 transitions. [2019-09-08 03:46:09,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:46:09,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 182 [2019-09-08 03:46:09,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:09,081 INFO L225 Difference]: With dead ends: 10463 [2019-09-08 03:46:09,081 INFO L226 Difference]: Without dead ends: 5422 [2019-09-08 03:46:09,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-09-08 03:46:09,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5422 states. [2019-09-08 03:46:09,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5422 to 5422. [2019-09-08 03:46:09,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5422 states. [2019-09-08 03:46:09,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5422 states to 5422 states and 8797 transitions. [2019-09-08 03:46:09,336 INFO L78 Accepts]: Start accepts. Automaton has 5422 states and 8797 transitions. Word has length 182 [2019-09-08 03:46:09,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:09,337 INFO L475 AbstractCegarLoop]: Abstraction has 5422 states and 8797 transitions. [2019-09-08 03:46:09,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:46:09,337 INFO L276 IsEmpty]: Start isEmpty. Operand 5422 states and 8797 transitions. [2019-09-08 03:46:09,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-08 03:46:09,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:09,342 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:46:09,342 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:09,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:09,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1756483171, now seen corresponding path program 1 times [2019-09-08 03:46:09,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:09,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:09,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:09,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:09,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:09,483 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 03:46:09,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:46:09,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:46:09,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:46:09,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:46:09,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:46:09,484 INFO L87 Difference]: Start difference. First operand 5422 states and 8797 transitions. Second operand 7 states. [2019-09-08 03:46:13,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:13,958 INFO L93 Difference]: Finished difference Result 10203 states and 16633 transitions. [2019-09-08 03:46:13,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:46:13,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 187 [2019-09-08 03:46:13,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:13,988 INFO L225 Difference]: With dead ends: 10203 [2019-09-08 03:46:13,989 INFO L226 Difference]: Without dead ends: 5769 [2019-09-08 03:46:14,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 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-09-08 03:46:14,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5769 states. [2019-09-08 03:46:14,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5769 to 5654. [2019-09-08 03:46:14,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5654 states. [2019-09-08 03:46:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5654 states to 5654 states and 9111 transitions. [2019-09-08 03:46:14,348 INFO L78 Accepts]: Start accepts. Automaton has 5654 states and 9111 transitions. Word has length 187 [2019-09-08 03:46:14,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:14,349 INFO L475 AbstractCegarLoop]: Abstraction has 5654 states and 9111 transitions. [2019-09-08 03:46:14,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:46:14,349 INFO L276 IsEmpty]: Start isEmpty. Operand 5654 states and 9111 transitions. [2019-09-08 03:46:14,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-08 03:46:14,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:14,355 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:46:14,355 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:14,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:14,356 INFO L82 PathProgramCache]: Analyzing trace with hash 94995430, now seen corresponding path program 1 times [2019-09-08 03:46:14,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:14,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:14,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:14,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:14,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:14,541 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:46:14,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:46:14,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:46:14,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:46:14,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:46:14,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:46:14,543 INFO L87 Difference]: Start difference. First operand 5654 states and 9111 transitions. Second operand 11 states. [2019-09-08 03:46:22,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:22,114 INFO L93 Difference]: Finished difference Result 11750 states and 18909 transitions. [2019-09-08 03:46:22,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 03:46:22,115 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 194 [2019-09-08 03:46:22,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:22,145 INFO L225 Difference]: With dead ends: 11750 [2019-09-08 03:46:22,146 INFO L226 Difference]: Without dead ends: 6963 [2019-09-08 03:46:22,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-09-08 03:46:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6963 states. [2019-09-08 03:46:22,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6963 to 6814. [2019-09-08 03:46:22,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6814 states. [2019-09-08 03:46:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6814 states to 6814 states and 10803 transitions. [2019-09-08 03:46:22,442 INFO L78 Accepts]: Start accepts. Automaton has 6814 states and 10803 transitions. Word has length 194 [2019-09-08 03:46:22,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:22,443 INFO L475 AbstractCegarLoop]: Abstraction has 6814 states and 10803 transitions. [2019-09-08 03:46:22,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:46:22,443 INFO L276 IsEmpty]: Start isEmpty. Operand 6814 states and 10803 transitions. [2019-09-08 03:46:22,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 03:46:22,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:22,448 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:46:22,448 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:22,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:22,449 INFO L82 PathProgramCache]: Analyzing trace with hash -5086000, now seen corresponding path program 1 times [2019-09-08 03:46:22,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:22,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:22,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:22,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:22,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:46:22,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:46:22,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:46:22,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:46:22,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:46:22,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:46:22,572 INFO L87 Difference]: Start difference. First operand 6814 states and 10803 transitions. Second operand 6 states. [2019-09-08 03:46:23,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:23,463 INFO L93 Difference]: Finished difference Result 15759 states and 25227 transitions. [2019-09-08 03:46:23,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:46:23,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 192 [2019-09-08 03:46:23,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:23,503 INFO L225 Difference]: With dead ends: 15759 [2019-09-08 03:46:23,503 INFO L226 Difference]: Without dead ends: 9933 [2019-09-08 03:46:23,518 INFO L628 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-09-08 03:46:23,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9933 states. [2019-09-08 03:46:23,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9933 to 8706. [2019-09-08 03:46:23,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8706 states. [2019-09-08 03:46:23,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8706 states to 8706 states and 13931 transitions. [2019-09-08 03:46:23,932 INFO L78 Accepts]: Start accepts. Automaton has 8706 states and 13931 transitions. Word has length 192 [2019-09-08 03:46:23,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:23,933 INFO L475 AbstractCegarLoop]: Abstraction has 8706 states and 13931 transitions. [2019-09-08 03:46:23,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:46:23,933 INFO L276 IsEmpty]: Start isEmpty. Operand 8706 states and 13931 transitions. [2019-09-08 03:46:23,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-08 03:46:23,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:23,938 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:46:23,939 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:23,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:23,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1565765319, now seen corresponding path program 1 times [2019-09-08 03:46:23,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:23,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:23,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:23,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:23,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:24,083 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:46:24,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:46:24,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:46:24,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:46:24,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:46:24,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:46:24,085 INFO L87 Difference]: Start difference. First operand 8706 states and 13931 transitions. Second operand 4 states. [2019-09-08 03:46:24,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:24,945 INFO L93 Difference]: Finished difference Result 17242 states and 27832 transitions. [2019-09-08 03:46:24,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:46:24,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-09-08 03:46:24,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:24,988 INFO L225 Difference]: With dead ends: 17242 [2019-09-08 03:46:24,989 INFO L226 Difference]: Without dead ends: 8645 [2019-09-08 03:46:25,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-09-08 03:46:25,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8645 states. [2019-09-08 03:46:25,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8645 to 8645. [2019-09-08 03:46:25,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8645 states. [2019-09-08 03:46:25,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8645 states to 8645 states and 13809 transitions. [2019-09-08 03:46:25,420 INFO L78 Accepts]: Start accepts. Automaton has 8645 states and 13809 transitions. Word has length 194 [2019-09-08 03:46:25,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:25,421 INFO L475 AbstractCegarLoop]: Abstraction has 8645 states and 13809 transitions. [2019-09-08 03:46:25,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:46:25,421 INFO L276 IsEmpty]: Start isEmpty. Operand 8645 states and 13809 transitions. [2019-09-08 03:46:25,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 03:46:25,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:25,537 INFO L399 BasicCegarLoop]: trace histogram [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-09-08 03:46:25,537 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:25,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:25,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1293801122, now seen corresponding path program 1 times [2019-09-08 03:46:25,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:25,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:25,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:25,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:25,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:25,700 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:46:25,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:46:25,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:46:25,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:46:25,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:46:25,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:46:25,703 INFO L87 Difference]: Start difference. First operand 8645 states and 13809 transitions. Second operand 6 states. [2019-09-08 03:46:26,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:26,688 INFO L93 Difference]: Finished difference Result 8712 states and 13920 transitions. [2019-09-08 03:46:26,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:46:26,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-09-08 03:46:26,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:26,730 INFO L225 Difference]: With dead ends: 8712 [2019-09-08 03:46:26,730 INFO L226 Difference]: Without dead ends: 8696 [2019-09-08 03:46:26,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:46:26,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8696 states. [2019-09-08 03:46:27,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8696 to 8657. [2019-09-08 03:46:27,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8657 states. [2019-09-08 03:46:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8657 states to 8657 states and 13821 transitions. [2019-09-08 03:46:27,103 INFO L78 Accepts]: Start accepts. Automaton has 8657 states and 13821 transitions. Word has length 195 [2019-09-08 03:46:27,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:27,104 INFO L475 AbstractCegarLoop]: Abstraction has 8657 states and 13821 transitions. [2019-09-08 03:46:27,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:46:27,104 INFO L276 IsEmpty]: Start isEmpty. Operand 8657 states and 13821 transitions. [2019-09-08 03:46:27,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-08 03:46:27,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:27,108 INFO L399 BasicCegarLoop]: trace histogram [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-09-08 03:46:27,108 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:27,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:27,109 INFO L82 PathProgramCache]: Analyzing trace with hash -29300484, now seen corresponding path program 1 times [2019-09-08 03:46:27,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:27,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:27,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:27,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:27,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:46:27,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:46:27,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 03:46:27,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:46:27,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:46:27,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:46:27,256 INFO L87 Difference]: Start difference. First operand 8657 states and 13821 transitions. Second operand 8 states. [2019-09-08 03:46:27,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:27,470 INFO L93 Difference]: Finished difference Result 8681 states and 13851 transitions. [2019-09-08 03:46:27,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:46:27,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 199 [2019-09-08 03:46:27,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:27,503 INFO L225 Difference]: With dead ends: 8681 [2019-09-08 03:46:27,504 INFO L226 Difference]: Without dead ends: 8665 [2019-09-08 03:46:27,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:46:27,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8665 states. [2019-09-08 03:46:27,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8665 to 8657. [2019-09-08 03:46:27,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8657 states. [2019-09-08 03:46:27,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8657 states to 8657 states and 13807 transitions. [2019-09-08 03:46:27,984 INFO L78 Accepts]: Start accepts. Automaton has 8657 states and 13807 transitions. Word has length 199 [2019-09-08 03:46:27,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:27,985 INFO L475 AbstractCegarLoop]: Abstraction has 8657 states and 13807 transitions. [2019-09-08 03:46:27,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:46:27,985 INFO L276 IsEmpty]: Start isEmpty. Operand 8657 states and 13807 transitions. [2019-09-08 03:46:27,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 03:46:27,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:27,990 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:46:27,991 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:27,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:27,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1726107859, now seen corresponding path program 1 times [2019-09-08 03:46:27,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:27,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:27,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:27,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:27,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 03:46:28,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:46:28,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:46:28,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:46:28,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:46:28,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:46:28,190 INFO L87 Difference]: Start difference. First operand 8657 states and 13807 transitions. Second operand 9 states. [2019-09-08 03:46:31,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:31,963 INFO L93 Difference]: Finished difference Result 17217 states and 27602 transitions. [2019-09-08 03:46:31,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:46:31,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 219 [2019-09-08 03:46:31,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:31,997 INFO L225 Difference]: With dead ends: 17217 [2019-09-08 03:46:31,997 INFO L226 Difference]: Without dead ends: 8685 [2019-09-08 03:46:32,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 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-09-08 03:46:32,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8685 states. [2019-09-08 03:46:32,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8685 to 8657. [2019-09-08 03:46:32,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8657 states. [2019-09-08 03:46:32,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8657 states to 8657 states and 13793 transitions. [2019-09-08 03:46:32,545 INFO L78 Accepts]: Start accepts. Automaton has 8657 states and 13793 transitions. Word has length 219 [2019-09-08 03:46:32,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:32,546 INFO L475 AbstractCegarLoop]: Abstraction has 8657 states and 13793 transitions. [2019-09-08 03:46:32,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:46:32,546 INFO L276 IsEmpty]: Start isEmpty. Operand 8657 states and 13793 transitions. [2019-09-08 03:46:32,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 03:46:32,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:32,551 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:46:32,551 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:32,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:32,551 INFO L82 PathProgramCache]: Analyzing trace with hash 233246925, now seen corresponding path program 1 times [2019-09-08 03:46:32,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:32,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:32,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:32,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:32,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:32,794 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 03:46:32,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:46:32,794 INFO L223 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) [2019-09-08 03:46:32,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:46:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:33,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 3397 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 03:46:33,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:46:33,552 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 03:46:33,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:46:33,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-09-08 03:46:33,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:46:33,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:46:33,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:46:33,571 INFO L87 Difference]: Start difference. First operand 8657 states and 13793 transitions. Second operand 15 states. [2019-09-08 03:46:43,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:43,298 INFO L93 Difference]: Finished difference Result 17899 states and 28545 transitions. [2019-09-08 03:46:43,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 03:46:43,299 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 228 [2019-09-08 03:46:43,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:43,335 INFO L225 Difference]: With dead ends: 17899 [2019-09-08 03:46:43,335 INFO L226 Difference]: Without dead ends: 10115 [2019-09-08 03:46:43,355 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=1038, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 03:46:43,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10115 states. [2019-09-08 03:46:43,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10115 to 9922. [2019-09-08 03:46:43,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9922 states. [2019-09-08 03:46:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9922 states to 9922 states and 15425 transitions. [2019-09-08 03:46:43,884 INFO L78 Accepts]: Start accepts. Automaton has 9922 states and 15425 transitions. Word has length 228 [2019-09-08 03:46:43,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:43,885 INFO L475 AbstractCegarLoop]: Abstraction has 9922 states and 15425 transitions. [2019-09-08 03:46:43,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:46:43,885 INFO L276 IsEmpty]: Start isEmpty. Operand 9922 states and 15425 transitions. [2019-09-08 03:46:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-08 03:46:43,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:43,890 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 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] [2019-09-08 03:46:43,890 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:43,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:43,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1638137082, now seen corresponding path program 1 times [2019-09-08 03:46:43,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:43,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:43,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:43,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:43,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-09-08 03:46:44,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:46:44,183 INFO L223 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-09-08 03:46:44,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:44,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 3449 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 03:46:44,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:46:44,947 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-08 03:46:44,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:46:44,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-09-08 03:46:44,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 03:46:44,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 03:46:44,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:46:44,956 INFO L87 Difference]: Start difference. First operand 9922 states and 15425 transitions. Second operand 19 states. [2019-09-08 03:46:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:55,478 INFO L93 Difference]: Finished difference Result 30852 states and 48720 transitions. [2019-09-08 03:46:55,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 03:46:55,478 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 254 [2019-09-08 03:46:55,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:55,569 INFO L225 Difference]: With dead ends: 30852 [2019-09-08 03:46:55,569 INFO L226 Difference]: Without dead ends: 21053 [2019-09-08 03:46:55,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2019-09-08 03:46:55,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21053 states. [2019-09-08 03:46:56,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21053 to 20901. [2019-09-08 03:46:56,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20901 states. [2019-09-08 03:46:56,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20901 states to 20901 states and 32991 transitions. [2019-09-08 03:46:56,513 INFO L78 Accepts]: Start accepts. Automaton has 20901 states and 32991 transitions. Word has length 254 [2019-09-08 03:46:56,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:56,514 INFO L475 AbstractCegarLoop]: Abstraction has 20901 states and 32991 transitions. [2019-09-08 03:46:56,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 03:46:56,514 INFO L276 IsEmpty]: Start isEmpty. Operand 20901 states and 32991 transitions. [2019-09-08 03:46:56,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-08 03:46:56,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:56,522 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 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] [2019-09-08 03:46:56,523 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:56,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:56,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1964729506, now seen corresponding path program 1 times [2019-09-08 03:46:56,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:56,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:56,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:56,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:56,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:56,652 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-08 03:46:56,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:46:56,653 INFO L223 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-09-08 03:46:56,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:57,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 3450 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:46:57,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:46:57,321 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-08 03:46:57,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:46:57,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:46:57,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:46:57,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:46:57,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:46:57,329 INFO L87 Difference]: Start difference. First operand 20901 states and 32991 transitions. Second operand 6 states. [2019-09-08 03:46:58,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:58,588 INFO L93 Difference]: Finished difference Result 42251 states and 67387 transitions. [2019-09-08 03:46:58,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:46:58,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 255 [2019-09-08 03:46:58,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:58,660 INFO L225 Difference]: With dead ends: 42251 [2019-09-08 03:46:58,660 INFO L226 Difference]: Without dead ends: 21199 [2019-09-08 03:46:58,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 256 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-09-08 03:46:58,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21199 states. [2019-09-08 03:46:59,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21199 to 21197. [2019-09-08 03:46:59,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21197 states. [2019-09-08 03:46:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21197 states to 21197 states and 32916 transitions. [2019-09-08 03:46:59,418 INFO L78 Accepts]: Start accepts. Automaton has 21197 states and 32916 transitions. Word has length 255 [2019-09-08 03:46:59,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:59,419 INFO L475 AbstractCegarLoop]: Abstraction has 21197 states and 32916 transitions. [2019-09-08 03:46:59,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:46:59,419 INFO L276 IsEmpty]: Start isEmpty. Operand 21197 states and 32916 transitions. [2019-09-08 03:46:59,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-09-08 03:46:59,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:59,432 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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, 2, 2, 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] [2019-09-08 03:46:59,432 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:59,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:59,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1152999554, now seen corresponding path program 1 times [2019-09-08 03:46:59,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:59,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:59,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:59,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:59,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:59,630 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-09-08 03:46:59,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:46:59,630 INFO L223 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) [2019-09-08 03:46:59,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:47:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:00,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 4130 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:47:00,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:47:00,401 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 03:47:00,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:47:00,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-09-08 03:47:00,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:47:00,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:47:00,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:47:00,409 INFO L87 Difference]: Start difference. First operand 21197 states and 32916 transitions. Second operand 7 states. [2019-09-08 03:47:01,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:47:01,599 INFO L93 Difference]: Finished difference Result 43493 states and 68457 transitions. [2019-09-08 03:47:01,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:47:01,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 336 [2019-09-08 03:47:01,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:47:01,682 INFO L225 Difference]: With dead ends: 43493 [2019-09-08 03:47:01,682 INFO L226 Difference]: Without dead ends: 22413 [2019-09-08 03:47:01,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 336 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-09-08 03:47:01,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22413 states. [2019-09-08 03:47:02,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22413 to 22401. [2019-09-08 03:47:02,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22401 states. [2019-09-08 03:47:02,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22401 states to 22401 states and 35084 transitions. [2019-09-08 03:47:02,417 INFO L78 Accepts]: Start accepts. Automaton has 22401 states and 35084 transitions. Word has length 336 [2019-09-08 03:47:02,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:47:02,417 INFO L475 AbstractCegarLoop]: Abstraction has 22401 states and 35084 transitions. [2019-09-08 03:47:02,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:47:02,417 INFO L276 IsEmpty]: Start isEmpty. Operand 22401 states and 35084 transitions. [2019-09-08 03:47:02,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-09-08 03:47:02,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:47:02,429 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 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, 2, 2, 2, 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] [2019-09-08 03:47:02,429 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:47:02,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:47:02,430 INFO L82 PathProgramCache]: Analyzing trace with hash -601847978, now seen corresponding path program 1 times [2019-09-08 03:47:02,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:47:02,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:47:02,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:02,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:47:02,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:02,636 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-09-08 03:47:02,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:47:02,637 INFO L223 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) [2019-09-08 03:47:02,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:47:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:03,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 4135 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 03:47:03,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:47:03,785 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-09-08 03:47:03,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:47:03,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-08 03:47:03,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:47:03,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:47:03,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:47:03,796 INFO L87 Difference]: Start difference. First operand 22401 states and 35084 transitions. Second operand 15 states. [2019-09-08 03:47:17,991 WARN L188 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-09-08 03:47:18,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:47:18,575 INFO L93 Difference]: Finished difference Result 91378 states and 148143 transitions. [2019-09-08 03:47:18,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 03:47:18,575 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 343 [2019-09-08 03:47:18,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:47:18,871 INFO L225 Difference]: With dead ends: 91378 [2019-09-08 03:47:18,871 INFO L226 Difference]: Without dead ends: 68698 [2019-09-08 03:47:18,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=407, Invalid=1573, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 03:47:18,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68698 states. [2019-09-08 03:47:23,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68698 to 67483. [2019-09-08 03:47:23,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67483 states. [2019-09-08 03:47:23,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67483 states to 67483 states and 107309 transitions. [2019-09-08 03:47:23,705 INFO L78 Accepts]: Start accepts. Automaton has 67483 states and 107309 transitions. Word has length 343 [2019-09-08 03:47:23,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:47:23,705 INFO L475 AbstractCegarLoop]: Abstraction has 67483 states and 107309 transitions. [2019-09-08 03:47:23,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:47:23,706 INFO L276 IsEmpty]: Start isEmpty. Operand 67483 states and 107309 transitions. [2019-09-08 03:47:23,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-08 03:47:23,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:47:23,713 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:47:23,713 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:47:23,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:47:23,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1329488564, now seen corresponding path program 1 times [2019-09-08 03:47:23,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:47:23,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:47:23,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:23,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:47:23,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:23,927 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-08 03:47:23,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:47:23,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 03:47:23,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:47:23,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:47:23,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:47:23,929 INFO L87 Difference]: Start difference. First operand 67483 states and 107309 transitions. Second operand 8 states. [2019-09-08 03:47:26,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:47:26,979 INFO L93 Difference]: Finished difference Result 130795 states and 209985 transitions. [2019-09-08 03:47:26,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:47:26,980 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 292 [2019-09-08 03:47:26,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:47:27,361 INFO L225 Difference]: With dead ends: 130795 [2019-09-08 03:47:27,361 INFO L226 Difference]: Without dead ends: 63519 [2019-09-08 03:47:27,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:47:27,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63519 states. [2019-09-08 03:47:32,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63519 to 63499. [2019-09-08 03:47:32,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63499 states. [2019-09-08 03:47:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63499 states to 63499 states and 101623 transitions. [2019-09-08 03:47:32,973 INFO L78 Accepts]: Start accepts. Automaton has 63499 states and 101623 transitions. Word has length 292 [2019-09-08 03:47:32,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:47:32,974 INFO L475 AbstractCegarLoop]: Abstraction has 63499 states and 101623 transitions. [2019-09-08 03:47:32,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:47:32,974 INFO L276 IsEmpty]: Start isEmpty. Operand 63499 states and 101623 transitions. [2019-09-08 03:47:32,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-08 03:47:32,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:47:32,980 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:47:32,981 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:47:32,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:47:32,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1481189409, now seen corresponding path program 1 times [2019-09-08 03:47:32,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:47:32,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:47:32,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:32,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:47:32,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 23 proven. 19 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-08 03:47:33,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:47:33,220 INFO L223 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-09-08 03:47:33,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:47:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:33,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 3803 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:47:33,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:47:33,954 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 20 proven. 65 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-08 03:47:33,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:47:33,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-09-08 03:47:33,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:47:33,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:47:33,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:47:33,963 INFO L87 Difference]: Start difference. First operand 63499 states and 101623 transitions. Second operand 15 states. [2019-09-08 03:47:55,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:47:55,871 INFO L93 Difference]: Finished difference Result 152619 states and 248565 transitions. [2019-09-08 03:47:55,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 03:47:55,872 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 303 [2019-09-08 03:47:55,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:47:56,384 INFO L225 Difference]: With dead ends: 152619 [2019-09-08 03:47:56,384 INFO L226 Difference]: Without dead ends: 89217 [2019-09-08 03:47:56,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=372, Invalid=2280, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 03:47:56,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89217 states. [2019-09-08 03:47:59,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89217 to 85635. [2019-09-08 03:47:59,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85635 states. [2019-09-08 03:48:00,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85635 states to 85635 states and 134594 transitions. [2019-09-08 03:48:00,275 INFO L78 Accepts]: Start accepts. Automaton has 85635 states and 134594 transitions. Word has length 303 [2019-09-08 03:48:00,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:48:00,275 INFO L475 AbstractCegarLoop]: Abstraction has 85635 states and 134594 transitions. [2019-09-08 03:48:00,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:48:00,276 INFO L276 IsEmpty]: Start isEmpty. Operand 85635 states and 134594 transitions. [2019-09-08 03:48:00,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-08 03:48:00,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:48:00,284 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:48:00,284 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:48:00,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:48:00,285 INFO L82 PathProgramCache]: Analyzing trace with hash 342278673, now seen corresponding path program 1 times [2019-09-08 03:48:00,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:48:00,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:48:00,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:48:00,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:48:00,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:48:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:48:00,498 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-09-08 03:48:00,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:48:00,499 INFO L223 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-09-08 03:48:00,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:48:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:48:01,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 3801 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:48:01,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:48:01,226 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:48:01,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:48:01,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 03:48:01,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:48:01,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:48:01,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:48:01,235 INFO L87 Difference]: Start difference. First operand 85635 states and 134594 transitions. Second operand 8 states. [2019-09-08 03:48:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:48:16,420 INFO L93 Difference]: Finished difference Result 224066 states and 357423 transitions. [2019-09-08 03:48:16,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 03:48:16,421 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 304 [2019-09-08 03:48:16,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:48:17,120 INFO L225 Difference]: With dead ends: 224066 [2019-09-08 03:48:17,120 INFO L226 Difference]: Without dead ends: 138297 [2019-09-08 03:48:17,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=762, Unknown=0, NotChecked=0, Total=992 [2019-09-08 03:48:17,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138297 states. [2019-09-08 03:48:25,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138297 to 135061. [2019-09-08 03:48:25,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135061 states. [2019-09-08 03:48:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135061 states to 135061 states and 213704 transitions. [2019-09-08 03:48:26,147 INFO L78 Accepts]: Start accepts. Automaton has 135061 states and 213704 transitions. Word has length 304 [2019-09-08 03:48:26,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:48:26,147 INFO L475 AbstractCegarLoop]: Abstraction has 135061 states and 213704 transitions. [2019-09-08 03:48:26,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:48:26,148 INFO L276 IsEmpty]: Start isEmpty. Operand 135061 states and 213704 transitions. [2019-09-08 03:48:26,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 03:48:26,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:48:26,163 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:48:26,163 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:48:26,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:48:26,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1587114854, now seen corresponding path program 1 times [2019-09-08 03:48:26,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:48:26,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:48:26,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:48:26,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:48:26,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:48:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:48:26,388 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-09-08 03:48:26,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:48:26,388 INFO L223 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) [2019-09-08 03:48:26,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:48:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:48:27,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 3802 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 03:48:27,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:48:27,776 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-08 03:48:27,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:48:27,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-09-08 03:48:27,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:48:27,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:48:27,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:48:27,785 INFO L87 Difference]: Start difference. First operand 135061 states and 213704 transitions. Second operand 15 states. [2019-09-08 03:48:46,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:48:46,861 INFO L93 Difference]: Finished difference Result 306799 states and 484198 transitions. [2019-09-08 03:48:46,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 03:48:46,861 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 306 [2019-09-08 03:48:46,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:48:47,804 INFO L225 Difference]: With dead ends: 306799 [2019-09-08 03:48:47,804 INFO L226 Difference]: Without dead ends: 169042 [2019-09-08 03:48:48,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2019-09-08 03:48:48,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169042 states. [2019-09-08 03:49:00,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169042 to 168036. [2019-09-08 03:49:00,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168036 states. [2019-09-08 03:49:01,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168036 states to 168036 states and 264520 transitions. [2019-09-08 03:49:01,837 INFO L78 Accepts]: Start accepts. Automaton has 168036 states and 264520 transitions. Word has length 306 [2019-09-08 03:49:01,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:01,838 INFO L475 AbstractCegarLoop]: Abstraction has 168036 states and 264520 transitions. [2019-09-08 03:49:01,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:49:01,838 INFO L276 IsEmpty]: Start isEmpty. Operand 168036 states and 264520 transitions. [2019-09-08 03:49:01,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-08 03:49:01,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:01,849 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:49:01,850 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:01,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:01,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1216139042, now seen corresponding path program 1 times [2019-09-08 03:49:01,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:01,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:01,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:01,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:01,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:02,090 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-09-08 03:49:02,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:49:02,091 INFO L223 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-09-08 03:49:02,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:03,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 3807 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 03:49:03,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:49:03,692 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-08 03:49:03,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:49:03,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2019-09-08 03:49:03,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:49:03,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:49:03,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:49:03,700 INFO L87 Difference]: Start difference. First operand 168036 states and 264520 transitions. Second operand 13 states. [2019-09-08 03:49:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:49:41,923 INFO L93 Difference]: Finished difference Result 575795 states and 929313 transitions. [2019-09-08 03:49:41,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 03:49:41,924 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 307 [2019-09-08 03:49:41,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:49:51,092 INFO L225 Difference]: With dead ends: 575795 [2019-09-08 03:49:51,092 INFO L226 Difference]: Without dead ends: 408002 [2019-09-08 03:49:51,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 324 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=1010, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 03:49:51,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408002 states. [2019-09-08 03:50:22,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408002 to 404304. [2019-09-08 03:50:22,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404304 states. [2019-09-08 03:50:27,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404304 states to 404304 states and 650607 transitions. [2019-09-08 03:50:27,118 INFO L78 Accepts]: Start accepts. Automaton has 404304 states and 650607 transitions. Word has length 307 [2019-09-08 03:50:27,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:27,119 INFO L475 AbstractCegarLoop]: Abstraction has 404304 states and 650607 transitions. [2019-09-08 03:50:27,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:50:27,119 INFO L276 IsEmpty]: Start isEmpty. Operand 404304 states and 650607 transitions. [2019-09-08 03:50:27,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-08 03:50:27,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:27,161 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:50:27,161 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:27,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:27,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1834047227, now seen corresponding path program 1 times [2019-09-08 03:50:27,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:27,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:27,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:27,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:27,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:27,352 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-08 03:50:27,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:27,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:50:27,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:50:27,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:50:27,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:50:27,353 INFO L87 Difference]: Start difference. First operand 404304 states and 650607 transitions. Second operand 7 states. [2019-09-08 03:51:13,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:13,787 INFO L93 Difference]: Finished difference Result 909323 states and 1486867 transitions. [2019-09-08 03:51:13,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:51:13,787 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 310 [2019-09-08 03:51:13,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:18,002 INFO L225 Difference]: With dead ends: 909323 [2019-09-08 03:51:18,002 INFO L226 Difference]: Without dead ends: 504461 [2019-09-08 03:51:19,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:51:20,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504461 states. [2019-09-08 03:51:57,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504461 to 501665. [2019-09-08 03:51:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501665 states. [2019-09-08 03:52:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501665 states to 501665 states and 815170 transitions. [2019-09-08 03:52:01,992 INFO L78 Accepts]: Start accepts. Automaton has 501665 states and 815170 transitions. Word has length 310 [2019-09-08 03:52:01,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:52:01,992 INFO L475 AbstractCegarLoop]: Abstraction has 501665 states and 815170 transitions. [2019-09-08 03:52:01,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:52:01,993 INFO L276 IsEmpty]: Start isEmpty. Operand 501665 states and 815170 transitions. [2019-09-08 03:52:02,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-08 03:52:02,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:52:02,022 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:52:02,022 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:52:02,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:52:02,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1595761367, now seen corresponding path program 1 times [2019-09-08 03:52:02,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:52:02,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:52:02,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:02,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:02,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:02,182 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-08 03:52:02,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:52:02,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:52:02,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:52:02,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:52:02,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:52:02,184 INFO L87 Difference]: Start difference. First operand 501665 states and 815170 transitions. Second operand 7 states. [2019-09-08 03:52:58,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:52:58,130 INFO L93 Difference]: Finished difference Result 1087137 states and 1796823 transitions. [2019-09-08 03:52:58,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:52:58,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 311 [2019-09-08 03:52:58,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:02,191 INFO L225 Difference]: With dead ends: 1087137 [2019-09-08 03:53:02,192 INFO L226 Difference]: Without dead ends: 584466 [2019-09-08 03:53:03,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:53:03,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584466 states. [2019-09-08 03:54:02,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584466 to 580917. [2019-09-08 03:54:02,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580917 states. [2019-09-08 03:54:09,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580917 states to 580917 states and 942239 transitions. [2019-09-08 03:54:09,682 INFO L78 Accepts]: Start accepts. Automaton has 580917 states and 942239 transitions. Word has length 311 [2019-09-08 03:54:09,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:09,682 INFO L475 AbstractCegarLoop]: Abstraction has 580917 states and 942239 transitions. [2019-09-08 03:54:09,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:54:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 580917 states and 942239 transitions. [2019-09-08 03:54:09,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-08 03:54:09,723 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:09,723 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:54:09,723 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:09,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:09,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1492443014, now seen corresponding path program 1 times [2019-09-08 03:54:09,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:09,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:09,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:09,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:09,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:09,899 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-09-08 03:54:09,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:54:09,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:54:09,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:54:09,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:54:09,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:54:09,900 INFO L87 Difference]: Start difference. First operand 580917 states and 942239 transitions. Second operand 9 states.