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_product29.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 03:54:54,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 03:54:54,804 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 03:54:54,827 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 03:54:54,828 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 03:54:54,829 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 03:54:54,833 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 03:54:54,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 03:54:54,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 03:54:54,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 03:54:54,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 03:54:54,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 03:54:54,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 03:54:54,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 03:54:54,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 03:54:54,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 03:54:54,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 03:54:54,854 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 03:54:54,856 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 03:54:54,858 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 03:54:54,860 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 03:54:54,861 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 03:54:54,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 03:54:54,863 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 03:54:54,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 03:54:54,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 03:54:54,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 03:54:54,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 03:54:54,870 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 03:54:54,871 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 03:54:54,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 03:54:54,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 03:54:54,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 03:54:54,873 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 03:54:54,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 03:54:54,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 03:54:54,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 03:54:54,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 03:54:54,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 03:54:54,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 03:54:54,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 03:54:54,879 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:54:54,901 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 03:54:54,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 03:54:54,903 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 03:54:54,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 03:54:54,903 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 03:54:54,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 03:54:54,904 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 03:54:54,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 03:54:54,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 03:54:54,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 03:54:54,904 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 03:54:54,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 03:54:54,905 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 03:54:54,905 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 03:54:54,905 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 03:54:54,905 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 03:54:54,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 03:54:54,906 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 03:54:54,906 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 03:54:54,906 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 03:54:54,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 03:54:54,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:54:54,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 03:54:54,908 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 03:54:54,909 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 03:54:54,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 03:54:54,909 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 03:54:54,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 03:54:54,910 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 03:54:54,942 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 03:54:54,956 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 03:54:54,959 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 03:54:54,961 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 03:54:54,961 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 03:54:54,962 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product29.cil.c [2019-09-08 03:54:55,038 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6827a591a/ff9a00a70f404abdb1ad5cb1915b8c81/FLAGdfdcc4fd1 [2019-09-08 03:54:55,719 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 03:54:55,720 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product29.cil.c [2019-09-08 03:54:55,758 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6827a591a/ff9a00a70f404abdb1ad5cb1915b8c81/FLAGdfdcc4fd1 [2019-09-08 03:54:55,850 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6827a591a/ff9a00a70f404abdb1ad5cb1915b8c81 [2019-09-08 03:54:55,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 03:54:55,865 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 03:54:55,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 03:54:55,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 03:54:55,870 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 03:54:55,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:54:55" (1/1) ... [2019-09-08 03:54:55,874 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c19ae1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:54:55, skipping insertion in model container [2019-09-08 03:54:55,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:54:55" (1/1) ... [2019-09-08 03:54:55,883 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 03:54:55,971 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 03:54:56,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:54:56,717 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 03:54:56,862 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:54:56,936 INFO L192 MainTranslator]: Completed translation [2019-09-08 03:54:56,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:54:56 WrapperNode [2019-09-08 03:54:56,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 03:54:56,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 03:54:56,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 03:54:56,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 03:54:56,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:54:56" (1/1) ... [2019-09-08 03:54:56,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:54:56" (1/1) ... [2019-09-08 03:54:56,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:54:56" (1/1) ... [2019-09-08 03:54:56,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:54:56" (1/1) ... [2019-09-08 03:54:57,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:54:56" (1/1) ... [2019-09-08 03:54:57,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:54:56" (1/1) ... [2019-09-08 03:54:57,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:54:56" (1/1) ... [2019-09-08 03:54:57,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 03:54:57,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 03:54:57,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 03:54:57,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 03:54:57,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:54:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:54:57,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 03:54:57,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 03:54:57,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 03:54:57,243 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 03:54:57,243 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 03:54:57,244 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 03:54:57,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 03:54:57,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-09-08 03:54:57,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-09-08 03:54:57,245 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-09-08 03:54:57,245 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-09-08 03:54:57,245 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 03:54:57,245 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 03:54:57,246 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 03:54:57,246 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 03:54:57,246 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 03:54:57,246 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 03:54:57,246 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 03:54:57,247 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 03:54:57,247 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 03:54:57,247 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 03:54:57,247 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 03:54:57,248 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 03:54:57,248 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 03:54:57,248 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 03:54:57,248 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 03:54:57,249 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 03:54:57,249 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 03:54:57,249 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 03:54:57,249 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 03:54:57,249 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 03:54:57,250 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 03:54:57,250 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 03:54:57,250 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 03:54:57,250 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 03:54:57,250 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 03:54:57,251 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 03:54:57,251 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 03:54:57,251 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 03:54:57,251 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 03:54:57,251 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 03:54:57,251 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 03:54:57,252 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 03:54:57,252 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 03:54:57,252 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 03:54:57,252 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 03:54:57,252 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 03:54:57,253 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 03:54:57,253 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-08 03:54:57,253 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 03:54:57,253 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 03:54:57,254 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 03:54:57,254 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 03:54:57,254 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 03:54:57,254 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 03:54:57,254 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 03:54:57,254 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 03:54:57,255 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 03:54:57,255 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 03:54:57,255 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 03:54:57,255 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 03:54:57,255 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 03:54:57,256 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 03:54:57,256 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 03:54:57,256 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 03:54:57,256 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 03:54:57,256 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 03:54:57,256 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 03:54:57,257 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 03:54:57,257 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 03:54:57,257 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 03:54:57,257 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 03:54:57,257 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 03:54:57,257 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 03:54:57,258 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 03:54:57,258 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 03:54:57,258 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 03:54:57,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 03:54:57,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 03:54:57,259 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 03:54:57,259 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 03:54:57,259 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 03:54:57,259 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 03:54:57,259 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 03:54:57,259 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 03:54:57,259 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-09-08 03:54:57,260 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-09-08 03:54:57,260 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-09-08 03:54:57,260 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-09-08 03:54:57,260 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 03:54:57,260 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 03:54:57,260 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 03:54:57,261 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 03:54:57,261 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 03:54:57,261 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 03:54:57,261 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 03:54:57,261 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 03:54:57,261 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 03:54:57,262 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 03:54:57,262 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 03:54:57,262 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 03:54:57,262 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 03:54:57,262 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 03:54:57,262 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 03:54:57,263 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 03:54:57,263 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 03:54:57,263 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 03:54:57,263 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 03:54:57,263 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 03:54:57,264 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 03:54:57,264 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 03:54:57,264 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 03:54:57,264 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 03:54:57,264 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 03:54:57,264 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 03:54:57,264 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 03:54:57,265 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 03:54:57,265 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 03:54:57,265 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 03:54:57,265 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 03:54:57,265 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 03:54:57,265 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 03:54:57,266 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 03:54:57,266 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 03:54:57,266 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 03:54:57,266 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 03:54:57,266 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 03:54:57,266 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 03:54:57,266 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 03:54:57,267 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 03:54:57,267 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 03:54:57,267 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 03:54:57,267 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 03:54:57,267 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 03:54:57,267 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 03:54:57,268 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-08 03:54:57,268 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 03:54:57,268 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 03:54:57,268 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 03:54:57,268 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 03:54:57,268 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 03:54:57,269 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 03:54:57,269 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 03:54:57,269 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 03:54:57,269 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 03:54:57,269 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 03:54:57,269 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 03:54:57,269 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 03:54:57,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 03:54:57,270 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 03:54:57,270 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 03:54:57,270 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 03:54:57,270 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 03:54:57,270 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 03:54:57,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 03:54:57,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 03:54:57,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 03:54:57,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 03:54:57,271 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 03:54:57,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 03:54:57,271 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 03:54:57,272 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 03:54:57,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 03:54:57,272 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 03:54:57,272 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 03:54:57,272 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 03:54:57,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 03:54:57,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 03:54:57,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 03:54:59,935 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 03:54:59,935 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 03:54:59,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:54:59 BoogieIcfgContainer [2019-09-08 03:54:59,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 03:54:59,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 03:54:59,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 03:54:59,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 03:54:59,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 03:54:55" (1/3) ... [2019-09-08 03:54:59,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1745ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:54:59, skipping insertion in model container [2019-09-08 03:54:59,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:54:56" (2/3) ... [2019-09-08 03:54:59,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1745ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:54:59, skipping insertion in model container [2019-09-08 03:54:59,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:54:59" (3/3) ... [2019-09-08 03:54:59,947 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product29.cil.c [2019-09-08 03:54:59,957 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 03:54:59,969 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 03:54:59,987 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 03:55:00,033 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 03:55:00,034 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 03:55:00,034 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 03:55:00,034 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 03:55:00,035 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 03:55:00,035 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 03:55:00,035 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 03:55:00,035 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 03:55:00,035 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 03:55:00,079 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states. [2019-09-08 03:55:00,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 03:55:00,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:00,122 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] [2019-09-08 03:55:00,125 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:00,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:00,132 INFO L82 PathProgramCache]: Analyzing trace with hash 902898907, now seen corresponding path program 1 times [2019-09-08 03:55:00,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:00,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:00,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:00,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:00,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:00,837 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 03:55:00,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:55:00,843 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:55:00,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:01,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 3273 conjuncts, 1 conjunts are in the unsatisfiable core [2019-09-08 03:55:01,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:55:01,625 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:55:01,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:55:01,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-09-08 03:55:01,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:55:01,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:55:01,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:55:01,665 INFO L87 Difference]: Start difference. First operand 790 states. Second operand 4 states. [2019-09-08 03:55:01,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:01,933 INFO L93 Difference]: Finished difference Result 1264 states and 2037 transitions. [2019-09-08 03:55:01,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:55:01,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-08 03:55:01,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:01,972 INFO L225 Difference]: With dead ends: 1264 [2019-09-08 03:55:01,972 INFO L226 Difference]: Without dead ends: 636 [2019-09-08 03:55:01,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 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:55:02,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2019-09-08 03:55:02,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2019-09-08 03:55:02,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-09-08 03:55:02,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1012 transitions. [2019-09-08 03:55:02,141 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1012 transitions. Word has length 155 [2019-09-08 03:55:02,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:02,142 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 1012 transitions. [2019-09-08 03:55:02,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:55:02,142 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1012 transitions. [2019-09-08 03:55:02,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 03:55:02,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:02,151 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:02,151 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:02,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:02,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1074530708, now seen corresponding path program 1 times [2019-09-08 03:55:02,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:02,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:02,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:02,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:02,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 03:55:02,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:55:02,376 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) [2019-09-08 03:55:02,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:55:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:02,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 3278 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:55:02,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:55:03,076 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 03:55:03,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:55:03,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:55:03,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:55:03,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:55:03,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:55:03,088 INFO L87 Difference]: Start difference. First operand 636 states and 1012 transitions. Second operand 6 states. [2019-09-08 03:55:03,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:03,236 INFO L93 Difference]: Finished difference Result 1244 states and 1997 transitions. [2019-09-08 03:55:03,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:55:03,236 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2019-09-08 03:55:03,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:03,245 INFO L225 Difference]: With dead ends: 1244 [2019-09-08 03:55:03,246 INFO L226 Difference]: Without dead ends: 636 [2019-09-08 03:55:03,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 158 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:55:03,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2019-09-08 03:55:03,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2019-09-08 03:55:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-09-08 03:55:03,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1011 transitions. [2019-09-08 03:55:03,316 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1011 transitions. Word has length 159 [2019-09-08 03:55:03,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:03,319 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 1011 transitions. [2019-09-08 03:55:03,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:55:03,319 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1011 transitions. [2019-09-08 03:55:03,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 03:55:03,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:03,332 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] [2019-09-08 03:55:03,333 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:03,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:03,333 INFO L82 PathProgramCache]: Analyzing trace with hash 480608966, now seen corresponding path program 1 times [2019-09-08 03:55:03,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:03,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:03,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:03,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:03,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:03,544 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 03:55:03,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:55:03,545 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:55:03,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:04,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 3280 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:55:04,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:55:04,268 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:55:04,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:55:04,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:55:04,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:55:04,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:55:04,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:55:04,285 INFO L87 Difference]: Start difference. First operand 636 states and 1011 transitions. Second operand 6 states. [2019-09-08 03:55:04,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:04,403 INFO L93 Difference]: Finished difference Result 1248 states and 2000 transitions. [2019-09-08 03:55:04,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:55:04,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-09-08 03:55:04,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:04,410 INFO L225 Difference]: With dead ends: 1248 [2019-09-08 03:55:04,410 INFO L226 Difference]: Without dead ends: 642 [2019-09-08 03:55:04,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 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:55:04,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-09-08 03:55:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-09-08 03:55:04,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 03:55:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1016 transitions. [2019-09-08 03:55:04,457 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1016 transitions. Word has length 161 [2019-09-08 03:55:04,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:04,458 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 1016 transitions. [2019-09-08 03:55:04,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:55:04,459 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1016 transitions. [2019-09-08 03:55:04,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 03:55:04,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:04,470 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:04,470 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:04,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:04,470 INFO L82 PathProgramCache]: Analyzing trace with hash 744578377, now seen corresponding path program 1 times [2019-09-08 03:55:04,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:04,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:04,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:04,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:04,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:04,653 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 03:55:04,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:55:04,654 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:55:04,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:05,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 3281 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:55:05,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:55:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 03:55:05,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:55:05,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:55:05,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:55:05,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:55:05,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:55:05,275 INFO L87 Difference]: Start difference. First operand 642 states and 1016 transitions. Second operand 6 states. [2019-09-08 03:55:05,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:05,467 INFO L93 Difference]: Finished difference Result 1247 states and 1991 transitions. [2019-09-08 03:55:05,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:55:05,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2019-09-08 03:55:05,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:05,482 INFO L225 Difference]: With dead ends: 1247 [2019-09-08 03:55:05,482 INFO L226 Difference]: Without dead ends: 642 [2019-09-08 03:55:05,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 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:55:05,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-09-08 03:55:05,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-09-08 03:55:05,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 03:55:05,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1015 transitions. [2019-09-08 03:55:05,521 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1015 transitions. Word has length 162 [2019-09-08 03:55:05,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:05,522 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 1015 transitions. [2019-09-08 03:55:05,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:55:05,522 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1015 transitions. [2019-09-08 03:55:05,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 03:55:05,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:05,529 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:05,529 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:05,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:05,530 INFO L82 PathProgramCache]: Analyzing trace with hash -831847774, now seen corresponding path program 1 times [2019-09-08 03:55:05,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:05,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:05,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:05,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:05,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:05,670 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 03:55:05,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:55:05,671 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) [2019-09-08 03:55:05,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:55:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:06,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 3282 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:55:06,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:55:06,259 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 03:55:06,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:55:06,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:55:06,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:55:06,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:55:06,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:55:06,280 INFO L87 Difference]: Start difference. First operand 642 states and 1015 transitions. Second operand 6 states. [2019-09-08 03:55:06,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:06,371 INFO L93 Difference]: Finished difference Result 1247 states and 1990 transitions. [2019-09-08 03:55:06,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:55:06,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-09-08 03:55:06,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:06,377 INFO L225 Difference]: With dead ends: 1247 [2019-09-08 03:55:06,377 INFO L226 Difference]: Without dead ends: 642 [2019-09-08 03:55:06,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 163 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:55:06,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-09-08 03:55:06,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-09-08 03:55:06,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 03:55:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1014 transitions. [2019-09-08 03:55:06,405 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1014 transitions. Word has length 163 [2019-09-08 03:55:06,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:06,405 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 1014 transitions. [2019-09-08 03:55:06,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:55:06,406 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1014 transitions. [2019-09-08 03:55:06,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 03:55:06,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:06,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:06,413 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:06,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:06,413 INFO L82 PathProgramCache]: Analyzing trace with hash 669005797, now seen corresponding path program 1 times [2019-09-08 03:55:06,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:06,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:06,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:06,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:06,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:06,652 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 03:55:06,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:55:06,652 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) [2019-09-08 03:55:06,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:55:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:07,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 3283 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:55:07,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:55:07,288 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:55:07,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:55:07,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-09-08 03:55:07,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:55:07,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:55:07,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:55:07,303 INFO L87 Difference]: Start difference. First operand 642 states and 1014 transitions. Second operand 12 states. [2019-09-08 03:55:08,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:08,036 INFO L93 Difference]: Finished difference Result 1258 states and 2010 transitions. [2019-09-08 03:55:08,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:55:08,037 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 164 [2019-09-08 03:55:08,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:08,043 INFO L225 Difference]: With dead ends: 1258 [2019-09-08 03:55:08,043 INFO L226 Difference]: Without dead ends: 651 [2019-09-08 03:55:08,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:55:08,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-09-08 03:55:08,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 649. [2019-09-08 03:55:08,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2019-09-08 03:55:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1019 transitions. [2019-09-08 03:55:08,077 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1019 transitions. Word has length 164 [2019-09-08 03:55:08,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:08,077 INFO L475 AbstractCegarLoop]: Abstraction has 649 states and 1019 transitions. [2019-09-08 03:55:08,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:55:08,078 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1019 transitions. [2019-09-08 03:55:08,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 03:55:08,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:08,083 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, 1, 1, 1, 1, 1] [2019-09-08 03:55:08,084 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:08,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:08,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1098388375, now seen corresponding path program 1 times [2019-09-08 03:55:08,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:08,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:08,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:08,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:08,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:08,247 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 03:55:08,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:55:08,248 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:55:08,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:08,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 3286 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:55:08,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:55:08,908 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:55:08,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:55:08,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:55:08,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:55:08,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:55:08,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:55:08,916 INFO L87 Difference]: Start difference. First operand 649 states and 1019 transitions. Second operand 8 states. [2019-09-08 03:55:09,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:09,247 INFO L93 Difference]: Finished difference Result 1259 states and 2000 transitions. [2019-09-08 03:55:09,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:55:09,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 167 [2019-09-08 03:55:09,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:09,253 INFO L225 Difference]: With dead ends: 1259 [2019-09-08 03:55:09,253 INFO L226 Difference]: Without dead ends: 649 [2019-09-08 03:55:09,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 169 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:55:09,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-09-08 03:55:09,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2019-09-08 03:55:09,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2019-09-08 03:55:09,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1014 transitions. [2019-09-08 03:55:09,284 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1014 transitions. Word has length 167 [2019-09-08 03:55:09,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:09,285 INFO L475 AbstractCegarLoop]: Abstraction has 649 states and 1014 transitions. [2019-09-08 03:55:09,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:55:09,285 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1014 transitions. [2019-09-08 03:55:09,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 03:55:09,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:09,291 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:55:09,291 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:09,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:09,292 INFO L82 PathProgramCache]: Analyzing trace with hash -372621191, now seen corresponding path program 1 times [2019-09-08 03:55:09,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:09,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:09,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:09,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:09,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:09,429 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 03:55:09,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:55:09,430 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:55:09,444 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:55:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:10,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 3288 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:55:10,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:55:10,057 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 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:55:10,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:55:10,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:55:10,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:55:10,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:55:10,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:55:10,071 INFO L87 Difference]: Start difference. First operand 649 states and 1014 transitions. Second operand 8 states. [2019-09-08 03:55:10,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:10,377 INFO L93 Difference]: Finished difference Result 1280 states and 2021 transitions. [2019-09-08 03:55:10,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:55:10,378 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 169 [2019-09-08 03:55:10,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:10,383 INFO L225 Difference]: With dead ends: 1280 [2019-09-08 03:55:10,384 INFO L226 Difference]: Without dead ends: 676 [2019-09-08 03:55:10,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 171 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:55:10,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2019-09-08 03:55:10,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 673. [2019-09-08 03:55:10,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-09-08 03:55:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1041 transitions. [2019-09-08 03:55:10,417 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1041 transitions. Word has length 169 [2019-09-08 03:55:10,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:10,418 INFO L475 AbstractCegarLoop]: Abstraction has 673 states and 1041 transitions. [2019-09-08 03:55:10,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:55:10,418 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1041 transitions. [2019-09-08 03:55:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 03:55:10,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:10,425 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:55:10,426 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:10,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:10,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1530831994, now seen corresponding path program 1 times [2019-09-08 03:55:10,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:10,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:10,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:10,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:10,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:10,554 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:55:10,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:55:10,555 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:55:10,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:11,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 3283 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 03:55:11,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:55:11,176 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 03:55:11,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:55:11,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2019-09-08 03:55:11,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:55:11,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:55:11,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:55:11,186 INFO L87 Difference]: Start difference. First operand 673 states and 1041 transitions. Second operand 9 states. [2019-09-08 03:55:11,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:11,442 INFO L93 Difference]: Finished difference Result 1304 states and 2038 transitions. [2019-09-08 03:55:11,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:55:11,443 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 169 [2019-09-08 03:55:11,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:11,451 INFO L225 Difference]: With dead ends: 1304 [2019-09-08 03:55:11,451 INFO L226 Difference]: Without dead ends: 657 [2019-09-08 03:55:11,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:55:11,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-09-08 03:55:11,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-09-08 03:55:11,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-09-08 03:55:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1016 transitions. [2019-09-08 03:55:11,501 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1016 transitions. Word has length 169 [2019-09-08 03:55:11,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:11,501 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1016 transitions. [2019-09-08 03:55:11,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:55:11,501 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1016 transitions. [2019-09-08 03:55:11,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 03:55:11,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:11,507 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] [2019-09-08 03:55:11,508 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:11,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:11,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2092547535, now seen corresponding path program 1 times [2019-09-08 03:55:11,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:11,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:11,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:11,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:11,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:11,731 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 03:55:11,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:55:11,732 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) [2019-09-08 03:55:11,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:55:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:12,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 3285 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 03:55:12,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:55:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Stream closed [2019-09-08 03:55:12,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:55:12,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-09-08 03:55:12,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:55:12,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:55:12,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:55:12,505 INFO L87 Difference]: Start difference. First operand 657 states and 1016 transitions. Second operand 14 states. [2019-09-08 03:55:12,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:12,765 INFO L93 Difference]: Finished difference Result 1252 states and 1954 transitions. [2019-09-08 03:55:12,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:55:12,766 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 170 [2019-09-08 03:55:12,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:12,771 INFO L225 Difference]: With dead ends: 1252 [2019-09-08 03:55:12,771 INFO L226 Difference]: Without dead ends: 643 [2019-09-08 03:55:12,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:55:12,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-09-08 03:55:12,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 638. [2019-09-08 03:55:12,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-09-08 03:55:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 981 transitions. [2019-09-08 03:55:12,796 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 981 transitions. Word has length 170 [2019-09-08 03:55:12,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:12,796 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 981 transitions. [2019-09-08 03:55:12,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:55:12,796 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 981 transitions. [2019-09-08 03:55:12,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 03:55:12,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:12,801 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] [2019-09-08 03:55:12,802 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:12,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:12,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1610301341, now seen corresponding path program 1 times [2019-09-08 03:55:12,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:12,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:12,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:12,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:12,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 03:55:13,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:55:13,026 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) [2019-09-08 03:55:13,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:55:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:13,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 3291 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:55:13,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:55:13,617 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:55:13,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:55:13,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:55:13,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:55:13,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:55:13,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:55:13,627 INFO L87 Difference]: Start difference. First operand 638 states and 981 transitions. Second operand 8 states. [2019-09-08 03:55:13,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:13,920 INFO L93 Difference]: Finished difference Result 1226 states and 1908 transitions. [2019-09-08 03:55:13,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:55:13,921 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 172 [2019-09-08 03:55:13,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:13,928 INFO L225 Difference]: With dead ends: 1226 [2019-09-08 03:55:13,928 INFO L226 Difference]: Without dead ends: 638 [2019-09-08 03:55:13,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 174 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:55:13,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-09-08 03:55:13,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-09-08 03:55:13,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-09-08 03:55:13,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 980 transitions. [2019-09-08 03:55:13,962 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 980 transitions. Word has length 172 [2019-09-08 03:55:13,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:13,963 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 980 transitions. [2019-09-08 03:55:13,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:55:13,963 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 980 transitions. [2019-09-08 03:55:13,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 03:55:13,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:13,968 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] [2019-09-08 03:55:13,969 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:13,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:13,969 INFO L82 PathProgramCache]: Analyzing trace with hash 307723721, now seen corresponding path program 1 times [2019-09-08 03:55:13,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:13,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:13,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:13,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:13,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:14,173 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 03:55:14,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:55:14,174 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:55:14,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:14,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 3292 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:55:14,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:55:14,747 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:55:14,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:55:14,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:55:14,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:55:14,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:55:14,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:55:14,760 INFO L87 Difference]: Start difference. First operand 638 states and 980 transitions. Second operand 8 states. [2019-09-08 03:55:14,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:14,990 INFO L93 Difference]: Finished difference Result 1226 states and 1907 transitions. [2019-09-08 03:55:14,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:55:14,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 173 [2019-09-08 03:55:14,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:14,997 INFO L225 Difference]: With dead ends: 1226 [2019-09-08 03:55:14,997 INFO L226 Difference]: Without dead ends: 638 [2019-09-08 03:55:15,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 175 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:55:15,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-09-08 03:55:15,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-09-08 03:55:15,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-09-08 03:55:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 979 transitions. [2019-09-08 03:55:15,031 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 979 transitions. Word has length 173 [2019-09-08 03:55:15,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:15,033 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 979 transitions. [2019-09-08 03:55:15,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:55:15,033 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 979 transitions. [2019-09-08 03:55:15,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 03:55:15,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:15,039 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] [2019-09-08 03:55:15,039 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:15,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:15,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1036484702, now seen corresponding path program 1 times [2019-09-08 03:55:15,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:15,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:15,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:15,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:15,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:15,373 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 03:55:15,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:55:15,374 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) [2019-09-08 03:55:15,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:55:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:15,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 3293 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 03:55:15,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:55:16,069 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 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:55:16,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:55:16,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2019-09-08 03:55:16,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 03:55:16,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 03:55:16,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-08 03:55:16,086 INFO L87 Difference]: Start difference. First operand 638 states and 979 transitions. Second operand 18 states. [2019-09-08 03:55:16,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:16,747 INFO L93 Difference]: Finished difference Result 1240 states and 1929 transitions. [2019-09-08 03:55:16,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:55:16,748 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 174 [2019-09-08 03:55:16,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:16,753 INFO L225 Difference]: With dead ends: 1240 [2019-09-08 03:55:16,753 INFO L226 Difference]: Without dead ends: 651 [2019-09-08 03:55:16,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-08 03:55:16,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-09-08 03:55:16,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 645. [2019-09-08 03:55:16,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-09-08 03:55:16,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 987 transitions. [2019-09-08 03:55:16,778 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 987 transitions. Word has length 174 [2019-09-08 03:55:16,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:16,778 INFO L475 AbstractCegarLoop]: Abstraction has 645 states and 987 transitions. [2019-09-08 03:55:16,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 03:55:16,778 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 987 transitions. [2019-09-08 03:55:16,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 03:55:16,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:16,784 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:16,784 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:16,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:16,785 INFO L82 PathProgramCache]: Analyzing trace with hash -39301917, now seen corresponding path program 1 times [2019-09-08 03:55:16,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:16,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:16,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:16,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:16,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:16,957 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 03:55:16,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:16,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:55:16,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:55:16,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:55:16,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:55:16,959 INFO L87 Difference]: Start difference. First operand 645 states and 987 transitions. Second operand 9 states. [2019-09-08 03:55:17,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:17,135 INFO L93 Difference]: Finished difference Result 1180 states and 1848 transitions. [2019-09-08 03:55:17,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:55:17,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 175 [2019-09-08 03:55:17,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:17,141 INFO L225 Difference]: With dead ends: 1180 [2019-09-08 03:55:17,141 INFO L226 Difference]: Without dead ends: 642 [2019-09-08 03:55:17,145 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:55:17,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-09-08 03:55:17,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-09-08 03:55:17,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-09-08 03:55:17,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 982 transitions. [2019-09-08 03:55:17,169 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 982 transitions. Word has length 175 [2019-09-08 03:55:17,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:17,169 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 982 transitions. [2019-09-08 03:55:17,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:55:17,170 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 982 transitions. [2019-09-08 03:55:17,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 03:55:17,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:17,176 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:55:17,177 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:17,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:17,177 INFO L82 PathProgramCache]: Analyzing trace with hash -302741149, now seen corresponding path program 1 times [2019-09-08 03:55:17,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:17,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:17,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:17,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:17,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 03:55:17,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:17,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:55:17,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:55:17,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:55:17,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:55:17,324 INFO L87 Difference]: Start difference. First operand 642 states and 982 transitions. Second operand 7 states. [2019-09-08 03:55:17,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:17,421 INFO L93 Difference]: Finished difference Result 1177 states and 1843 transitions. [2019-09-08 03:55:17,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:55:17,422 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 175 [2019-09-08 03:55:17,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:17,427 INFO L225 Difference]: With dead ends: 1177 [2019-09-08 03:55:17,427 INFO L226 Difference]: Without dead ends: 634 [2019-09-08 03:55:17,430 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:55:17,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-09-08 03:55:17,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2019-09-08 03:55:17,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-09-08 03:55:17,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 971 transitions. [2019-09-08 03:55:17,451 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 971 transitions. Word has length 175 [2019-09-08 03:55:17,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:17,451 INFO L475 AbstractCegarLoop]: Abstraction has 634 states and 971 transitions. [2019-09-08 03:55:17,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:55:17,451 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 971 transitions. [2019-09-08 03:55:17,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 03:55:17,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:17,457 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] [2019-09-08 03:55:17,457 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:17,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:17,458 INFO L82 PathProgramCache]: Analyzing trace with hash -906587733, now seen corresponding path program 1 times [2019-09-08 03:55:17,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:17,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:17,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:17,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:17,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:17,666 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 03:55:17,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:17,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 03:55:17,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:55:17,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:55:17,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:55:17,669 INFO L87 Difference]: Start difference. First operand 634 states and 971 transitions. Second operand 13 states. [2019-09-08 03:55:18,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:18,015 INFO L93 Difference]: Finished difference Result 1170 states and 1831 transitions. [2019-09-08 03:55:18,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:55:18,016 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 176 [2019-09-08 03:55:18,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:18,020 INFO L225 Difference]: With dead ends: 1170 [2019-09-08 03:55:18,021 INFO L226 Difference]: Without dead ends: 627 [2019-09-08 03:55:18,024 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:55:18,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-09-08 03:55:18,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2019-09-08 03:55:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-09-08 03:55:18,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 962 transitions. [2019-09-08 03:55:18,044 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 962 transitions. Word has length 176 [2019-09-08 03:55:18,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:18,045 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 962 transitions. [2019-09-08 03:55:18,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:55:18,045 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 962 transitions. [2019-09-08 03:55:18,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 03:55:18,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:18,050 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] [2019-09-08 03:55:18,051 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:18,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:18,051 INFO L82 PathProgramCache]: Analyzing trace with hash 242506502, now seen corresponding path program 1 times [2019-09-08 03:55:18,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:18,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:18,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:18,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:18,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:18,260 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 03:55:18,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:18,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 03:55:18,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:55:18,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:55:18,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:55:18,262 INFO L87 Difference]: Start difference. First operand 627 states and 962 transitions. Second operand 13 states. [2019-09-08 03:55:18,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:18,675 INFO L93 Difference]: Finished difference Result 1221 states and 1899 transitions. [2019-09-08 03:55:18,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:55:18,676 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 177 [2019-09-08 03:55:18,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:18,680 INFO L225 Difference]: With dead ends: 1221 [2019-09-08 03:55:18,681 INFO L226 Difference]: Without dead ends: 641 [2019-09-08 03:55:18,684 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:55:18,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-09-08 03:55:18,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 639. [2019-09-08 03:55:18,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 03:55:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 977 transitions. [2019-09-08 03:55:18,705 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 977 transitions. Word has length 177 [2019-09-08 03:55:18,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:18,706 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 977 transitions. [2019-09-08 03:55:18,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:55:18,706 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 977 transitions. [2019-09-08 03:55:18,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 03:55:18,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:18,711 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:55:18,711 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:18,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:18,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1165438822, now seen corresponding path program 1 times [2019-09-08 03:55:18,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:18,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:18,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:18,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:18,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:18,907 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 03:55:18,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:18,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:55:18,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:55:18,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:55:18,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:55:18,909 INFO L87 Difference]: Start difference. First operand 639 states and 977 transitions. Second operand 11 states. [2019-09-08 03:55:19,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:19,162 INFO L93 Difference]: Finished difference Result 1175 states and 1837 transitions. [2019-09-08 03:55:19,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:55:19,163 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 178 [2019-09-08 03:55:19,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:19,168 INFO L225 Difference]: With dead ends: 1175 [2019-09-08 03:55:19,169 INFO L226 Difference]: Without dead ends: 639 [2019-09-08 03:55:19,172 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:55:19,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-08 03:55:19,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-09-08 03:55:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 03:55:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 976 transitions. [2019-09-08 03:55:19,193 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 976 transitions. Word has length 178 [2019-09-08 03:55:19,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:19,194 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 976 transitions. [2019-09-08 03:55:19,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:55:19,194 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 976 transitions. [2019-09-08 03:55:19,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 03:55:19,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:19,199 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:19,199 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:19,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:19,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1675024101, now seen corresponding path program 1 times [2019-09-08 03:55:19,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:19,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:19,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:19,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:19,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:19,423 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 03:55:19,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:19,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:55:19,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:55:19,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:55:19,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:55:19,426 INFO L87 Difference]: Start difference. First operand 639 states and 976 transitions. Second operand 11 states. [2019-09-08 03:55:19,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:19,711 INFO L93 Difference]: Finished difference Result 1221 states and 1890 transitions. [2019-09-08 03:55:19,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:55:19,712 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 179 [2019-09-08 03:55:19,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:19,716 INFO L225 Difference]: With dead ends: 1221 [2019-09-08 03:55:19,717 INFO L226 Difference]: Without dead ends: 636 [2019-09-08 03:55:19,720 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:55:19,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2019-09-08 03:55:19,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2019-09-08 03:55:19,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-09-08 03:55:19,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 968 transitions. [2019-09-08 03:55:19,739 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 968 transitions. Word has length 179 [2019-09-08 03:55:19,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:19,740 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 968 transitions. [2019-09-08 03:55:19,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:55:19,740 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 968 transitions. [2019-09-08 03:55:19,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 03:55:19,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:19,744 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] [2019-09-08 03:55:19,744 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:19,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:19,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1286305397, now seen corresponding path program 1 times [2019-09-08 03:55:19,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:19,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:19,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:19,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:19,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:19,908 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:55:19,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:19,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:55:19,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:55:19,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:55:19,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:55:19,910 INFO L87 Difference]: Start difference. First operand 636 states and 968 transitions. Second operand 6 states. [2019-09-08 03:55:24,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:24,752 INFO L93 Difference]: Finished difference Result 1820 states and 2933 transitions. [2019-09-08 03:55:24,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:55:24,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-09-08 03:55:24,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:24,762 INFO L225 Difference]: With dead ends: 1820 [2019-09-08 03:55:24,763 INFO L226 Difference]: Without dead ends: 1293 [2019-09-08 03:55:24,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:55:24,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2019-09-08 03:55:24,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1210. [2019-09-08 03:55:24,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-09-08 03:55:24,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1908 transitions. [2019-09-08 03:55:24,837 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1908 transitions. Word has length 180 [2019-09-08 03:55:24,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:24,837 INFO L475 AbstractCegarLoop]: Abstraction has 1210 states and 1908 transitions. [2019-09-08 03:55:24,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:55:24,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1908 transitions. [2019-09-08 03:55:24,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 03:55:24,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:24,841 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] [2019-09-08 03:55:24,842 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:24,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:24,842 INFO L82 PathProgramCache]: Analyzing trace with hash 496043897, now seen corresponding path program 1 times [2019-09-08 03:55:24,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:24,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:24,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:24,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:24,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:25,008 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:55:25,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:25,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:55:25,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:55:25,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:55:25,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:55:25,010 INFO L87 Difference]: Start difference. First operand 1210 states and 1908 transitions. Second operand 6 states. [2019-09-08 03:55:29,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:29,419 INFO L93 Difference]: Finished difference Result 3767 states and 6212 transitions. [2019-09-08 03:55:29,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:55:29,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2019-09-08 03:55:29,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:29,440 INFO L225 Difference]: With dead ends: 3767 [2019-09-08 03:55:29,440 INFO L226 Difference]: Without dead ends: 2667 [2019-09-08 03:55:29,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:55:29,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2019-09-08 03:55:29,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2471. [2019-09-08 03:55:29,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2471 states. [2019-09-08 03:55:29,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 4001 transitions. [2019-09-08 03:55:29,581 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 4001 transitions. Word has length 181 [2019-09-08 03:55:29,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:29,581 INFO L475 AbstractCegarLoop]: Abstraction has 2471 states and 4001 transitions. [2019-09-08 03:55:29,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:55:29,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 4001 transitions. [2019-09-08 03:55:29,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 03:55:29,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:29,585 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] [2019-09-08 03:55:29,586 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:29,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:29,586 INFO L82 PathProgramCache]: Analyzing trace with hash 152092239, now seen corresponding path program 1 times [2019-09-08 03:55:29,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:29,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:29,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:29,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:29,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:29,813 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:55:29,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:29,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:55:29,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:55:29,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:55:29,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:55:29,816 INFO L87 Difference]: Start difference. First operand 2471 states and 4001 transitions. Second operand 6 states. [2019-09-08 03:55:35,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:35,463 INFO L93 Difference]: Finished difference Result 8206 states and 13868 transitions. [2019-09-08 03:55:35,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:55:35,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 182 [2019-09-08 03:55:35,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:35,529 INFO L225 Difference]: With dead ends: 8206 [2019-09-08 03:55:35,530 INFO L226 Difference]: Without dead ends: 5847 [2019-09-08 03:55:35,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:55:35,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5847 states. [2019-09-08 03:55:35,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5847 to 5326. [2019-09-08 03:55:35,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5326 states. [2019-09-08 03:55:35,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5326 states to 5326 states and 8852 transitions. [2019-09-08 03:55:35,945 INFO L78 Accepts]: Start accepts. Automaton has 5326 states and 8852 transitions. Word has length 182 [2019-09-08 03:55:35,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:35,946 INFO L475 AbstractCegarLoop]: Abstraction has 5326 states and 8852 transitions. [2019-09-08 03:55:35,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:55:35,946 INFO L276 IsEmpty]: Start isEmpty. Operand 5326 states and 8852 transitions. [2019-09-08 03:55:35,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 03:55:35,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:35,951 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] [2019-09-08 03:55:35,951 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:35,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:35,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1682679491, now seen corresponding path program 1 times [2019-09-08 03:55:35,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:35,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:35,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:35,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:35,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:36,133 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:55:36,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:36,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:55:36,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:55:36,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:55:36,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:55:36,135 INFO L87 Difference]: Start difference. First operand 5326 states and 8852 transitions. Second operand 6 states. [2019-09-08 03:55:42,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:42,169 INFO L93 Difference]: Finished difference Result 18751 states and 32708 transitions. [2019-09-08 03:55:42,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:55:42,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2019-09-08 03:55:42,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:42,311 INFO L225 Difference]: With dead ends: 18751 [2019-09-08 03:55:42,312 INFO L226 Difference]: Without dead ends: 13541 [2019-09-08 03:55:42,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:55:42,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13541 states. [2019-09-08 03:55:43,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13541 to 12065. [2019-09-08 03:55:43,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12065 states. [2019-09-08 03:55:43,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12065 states to 12065 states and 20733 transitions. [2019-09-08 03:55:43,233 INFO L78 Accepts]: Start accepts. Automaton has 12065 states and 20733 transitions. Word has length 183 [2019-09-08 03:55:43,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:43,234 INFO L475 AbstractCegarLoop]: Abstraction has 12065 states and 20733 transitions. [2019-09-08 03:55:43,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:55:43,234 INFO L276 IsEmpty]: Start isEmpty. Operand 12065 states and 20733 transitions. [2019-09-08 03:55:43,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 03:55:43,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:43,239 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] [2019-09-08 03:55:43,240 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:43,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:43,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1355042604, now seen corresponding path program 1 times [2019-09-08 03:55:43,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:43,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:43,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:43,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:43,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:44,202 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:55:44,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:44,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:55:44,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:55:44,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:55:44,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:55:44,203 INFO L87 Difference]: Start difference. First operand 12065 states and 20733 transitions. Second operand 9 states. [2019-09-08 03:55:51,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:51,532 INFO L93 Difference]: Finished difference Result 38892 states and 67027 transitions. [2019-09-08 03:55:51,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 03:55:51,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 184 [2019-09-08 03:55:51,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:51,777 INFO L225 Difference]: With dead ends: 38892 [2019-09-08 03:55:51,777 INFO L226 Difference]: Without dead ends: 26951 [2019-09-08 03:55:51,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-09-08 03:55:51,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26951 states. [2019-09-08 03:55:53,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26951 to 26532. [2019-09-08 03:55:53,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26532 states. [2019-09-08 03:55:53,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26532 states to 26532 states and 45363 transitions. [2019-09-08 03:55:53,473 INFO L78 Accepts]: Start accepts. Automaton has 26532 states and 45363 transitions. Word has length 184 [2019-09-08 03:55:53,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:53,473 INFO L475 AbstractCegarLoop]: Abstraction has 26532 states and 45363 transitions. [2019-09-08 03:55:53,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:55:53,473 INFO L276 IsEmpty]: Start isEmpty. Operand 26532 states and 45363 transitions. [2019-09-08 03:55:53,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 03:55:53,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:53,479 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, 1, 1, 1] [2019-09-08 03:55:53,479 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:53,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:53,479 INFO L82 PathProgramCache]: Analyzing trace with hash -998659066, now seen corresponding path program 1 times [2019-09-08 03:55:53,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:53,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:53,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:53,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:53,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:55:53,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:53,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 03:55:53,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 03:55:53,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 03:55:53,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:55:53,602 INFO L87 Difference]: Start difference. First operand 26532 states and 45363 transitions. Second operand 5 states. [2019-09-08 03:55:55,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:55,306 INFO L93 Difference]: Finished difference Result 53123 states and 90834 transitions. [2019-09-08 03:55:55,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:55:55,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2019-09-08 03:55:55,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:55,539 INFO L225 Difference]: With dead ends: 53123 [2019-09-08 03:55:55,540 INFO L226 Difference]: Without dead ends: 26715 [2019-09-08 03:55:55,672 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:55:55,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26715 states. [2019-09-08 03:55:58,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26715 to 26547. [2019-09-08 03:55:58,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26547 states. [2019-09-08 03:55:58,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26547 states to 26547 states and 45381 transitions. [2019-09-08 03:55:58,518 INFO L78 Accepts]: Start accepts. Automaton has 26547 states and 45381 transitions. Word has length 190 [2019-09-08 03:55:58,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:58,519 INFO L475 AbstractCegarLoop]: Abstraction has 26547 states and 45381 transitions. [2019-09-08 03:55:58,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 03:55:58,519 INFO L276 IsEmpty]: Start isEmpty. Operand 26547 states and 45381 transitions. [2019-09-08 03:55:58,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 03:55:58,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:58,524 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, 1, 1] [2019-09-08 03:55:58,524 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:58,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:58,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1519253740, now seen corresponding path program 1 times [2019-09-08 03:55:58,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:58,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:58,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:58,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:58,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:55:58,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:55:58,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:55:58,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:55:58,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:55:58,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:55:58,667 INFO L87 Difference]: Start difference. First operand 26547 states and 45381 transitions. Second operand 7 states. [2019-09-08 03:56:00,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:56:00,017 INFO L93 Difference]: Finished difference Result 53658 states and 91721 transitions. [2019-09-08 03:56:00,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:56:00,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 189 [2019-09-08 03:56:00,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:56:00,189 INFO L225 Difference]: With dead ends: 53658 [2019-09-08 03:56:00,189 INFO L226 Difference]: Without dead ends: 27235 [2019-09-08 03:56:00,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:56:00,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27235 states. [2019-09-08 03:56:01,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27235 to 26883. [2019-09-08 03:56:01,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26883 states. [2019-09-08 03:56:01,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26883 states to 26883 states and 45861 transitions. [2019-09-08 03:56:01,507 INFO L78 Accepts]: Start accepts. Automaton has 26883 states and 45861 transitions. Word has length 189 [2019-09-08 03:56:01,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:56:01,508 INFO L475 AbstractCegarLoop]: Abstraction has 26883 states and 45861 transitions. [2019-09-08 03:56:01,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:56:01,508 INFO L276 IsEmpty]: Start isEmpty. Operand 26883 states and 45861 transitions. [2019-09-08 03:56:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 03:56:01,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:56:01,512 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, 1, 1, 1] [2019-09-08 03:56:01,513 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:56:01,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:56:01,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1629117691, now seen corresponding path program 1 times [2019-09-08 03:56:01,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:56:01,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:56:01,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:56:01,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:56:01,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:56:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:56:02,066 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:56:02,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:56:02,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:56:02,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:56:02,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:56:02,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:56:02,068 INFO L87 Difference]: Start difference. First operand 26883 states and 45861 transitions. Second operand 6 states. [2019-09-08 03:56:11,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:56:11,256 INFO L93 Difference]: Finished difference Result 98707 states and 178389 transitions. [2019-09-08 03:56:11,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:56:11,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 190 [2019-09-08 03:56:11,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:56:11,664 INFO L225 Difference]: With dead ends: 98707 [2019-09-08 03:56:11,664 INFO L226 Difference]: Without dead ends: 71948 [2019-09-08 03:56:11,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:56:11,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71948 states. [2019-09-08 03:56:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71948 to 63281. [2019-09-08 03:56:14,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63281 states. [2019-09-08 03:56:15,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63281 states to 63281 states and 112644 transitions. [2019-09-08 03:56:15,123 INFO L78 Accepts]: Start accepts. Automaton has 63281 states and 112644 transitions. Word has length 190 [2019-09-08 03:56:15,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:56:15,124 INFO L475 AbstractCegarLoop]: Abstraction has 63281 states and 112644 transitions. [2019-09-08 03:56:15,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:56:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 63281 states and 112644 transitions. [2019-09-08 03:56:15,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 03:56:15,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:56:15,127 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, 1, 1, 1] [2019-09-08 03:56:15,128 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:56:15,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:56:15,128 INFO L82 PathProgramCache]: Analyzing trace with hash -206315708, now seen corresponding path program 1 times [2019-09-08 03:56:15,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:56:15,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:56:15,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:56:15,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:56:15,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:56:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:56:15,259 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:56:15,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:56:15,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:56:15,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:56:15,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:56:15,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:56:15,261 INFO L87 Difference]: Start difference. First operand 63281 states and 112644 transitions. Second operand 7 states. [2019-09-08 03:56:18,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:56:18,595 INFO L93 Difference]: Finished difference Result 127606 states and 226933 transitions. [2019-09-08 03:56:18,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:56:18,595 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 190 [2019-09-08 03:56:18,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:56:22,070 INFO L225 Difference]: With dead ends: 127606 [2019-09-08 03:56:22,071 INFO L226 Difference]: Without dead ends: 64465 [2019-09-08 03:56:22,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:56:22,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64465 states. [2019-09-08 03:56:24,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64465 to 63377. [2019-09-08 03:56:24,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63377 states. [2019-09-08 03:56:25,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63377 states to 63377 states and 112740 transitions. [2019-09-08 03:56:25,407 INFO L78 Accepts]: Start accepts. Automaton has 63377 states and 112740 transitions. Word has length 190 [2019-09-08 03:56:25,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:56:25,407 INFO L475 AbstractCegarLoop]: Abstraction has 63377 states and 112740 transitions. [2019-09-08 03:56:25,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:56:25,407 INFO L276 IsEmpty]: Start isEmpty. Operand 63377 states and 112740 transitions. [2019-09-08 03:56:25,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-08 03:56:25,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:56:25,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:56:25,412 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:56:25,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:56:25,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1964233918, now seen corresponding path program 1 times [2019-09-08 03:56:25,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:56:25,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:56:25,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:56:25,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:56:25,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:56:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:56:25,614 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:56:25,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:56:25,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 03:56:25,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:56:25,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:56:25,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:56:25,615 INFO L87 Difference]: Start difference. First operand 63377 states and 112740 transitions. Second operand 8 states. [2019-09-08 03:56:39,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:56:39,764 INFO L93 Difference]: Finished difference Result 213874 states and 385343 transitions. [2019-09-08 03:56:39,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:56:39,765 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 198 [2019-09-08 03:56:39,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:56:40,820 INFO L225 Difference]: With dead ends: 213874 [2019-09-08 03:56:40,821 INFO L226 Difference]: Without dead ends: 150637 [2019-09-08 03:56:41,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:56:41,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150637 states. [2019-09-08 03:56:51,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150637 to 150507. [2019-09-08 03:56:51,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150507 states. [2019-09-08 03:56:52,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150507 states to 150507 states and 269457 transitions. [2019-09-08 03:56:52,499 INFO L78 Accepts]: Start accepts. Automaton has 150507 states and 269457 transitions. Word has length 198 [2019-09-08 03:56:52,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:56:52,499 INFO L475 AbstractCegarLoop]: Abstraction has 150507 states and 269457 transitions. [2019-09-08 03:56:52,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:56:52,500 INFO L276 IsEmpty]: Start isEmpty. Operand 150507 states and 269457 transitions. [2019-09-08 03:56:52,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-08 03:56:52,506 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:56:52,507 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:56:52,507 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:56:52,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:56:52,507 INFO L82 PathProgramCache]: Analyzing trace with hash 287273289, now seen corresponding path program 1 times [2019-09-08 03:56:52,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:56:52,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:56:52,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:56:52,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:56:52,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:56:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:56:52,647 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:56:52,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:56:52,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:56:52,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:56:52,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:56:52,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:56:52,653 INFO L87 Difference]: Start difference. First operand 150507 states and 269457 transitions. Second operand 7 states. [2019-09-08 03:57:05,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:57:05,505 INFO L93 Difference]: Finished difference Result 301705 states and 545837 transitions. [2019-09-08 03:57:05,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:57:05,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 201 [2019-09-08 03:57:05,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:57:06,539 INFO L225 Difference]: With dead ends: 301705 [2019-09-08 03:57:06,539 INFO L226 Difference]: Without dead ends: 151275 [2019-09-08 03:57:07,071 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:57:07,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151275 states. [2019-09-08 03:57:22,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151275 to 151275. [2019-09-08 03:57:22,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151275 states. [2019-09-08 03:57:23,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151275 states to 151275 states and 270161 transitions. [2019-09-08 03:57:24,028 INFO L78 Accepts]: Start accepts. Automaton has 151275 states and 270161 transitions. Word has length 201 [2019-09-08 03:57:24,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:57:24,029 INFO L475 AbstractCegarLoop]: Abstraction has 151275 states and 270161 transitions. [2019-09-08 03:57:24,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:57:24,029 INFO L276 IsEmpty]: Start isEmpty. Operand 151275 states and 270161 transitions. [2019-09-08 03:57:24,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-08 03:57:24,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:57:24,036 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:57:24,036 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:57:24,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:57:24,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1482501799, now seen corresponding path program 1 times [2019-09-08 03:57:24,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:57:24,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:57:24,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:57:24,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:57:24,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:57:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:57:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:57:24,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:57:24,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:57:24,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:57:24,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:57:24,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:57:24,214 INFO L87 Difference]: Start difference. First operand 151275 states and 270161 transitions. Second operand 7 states. [2019-09-08 03:57:42,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:57:42,279 INFO L93 Difference]: Finished difference Result 280783 states and 502430 transitions. [2019-09-08 03:57:42,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:57:42,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 201 [2019-09-08 03:57:42,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:57:43,980 INFO L225 Difference]: With dead ends: 280783 [2019-09-08 03:57:43,980 INFO L226 Difference]: Without dead ends: 156542 [2019-09-08 03:57:44,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:57:44,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156542 states. [2019-09-08 03:57:54,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156542 to 154987. [2019-09-08 03:57:54,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154987 states. [2019-09-08 03:58:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154987 states to 154987 states and 275216 transitions. [2019-09-08 03:58:04,352 INFO L78 Accepts]: Start accepts. Automaton has 154987 states and 275216 transitions. Word has length 201 [2019-09-08 03:58:04,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:58:04,352 INFO L475 AbstractCegarLoop]: Abstraction has 154987 states and 275216 transitions. [2019-09-08 03:58:04,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:58:04,352 INFO L276 IsEmpty]: Start isEmpty. Operand 154987 states and 275216 transitions. [2019-09-08 03:58:04,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-08 03:58:04,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:58:04,361 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:58:04,361 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:58:04,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:58:04,362 INFO L82 PathProgramCache]: Analyzing trace with hash -117138291, now seen corresponding path program 1 times [2019-09-08 03:58:04,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:58:04,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:58:04,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:58:04,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:58:04,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:58:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:58:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 03:58:04,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:58:04,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:58:04,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:58:04,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:58:04,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:58:04,505 INFO L87 Difference]: Start difference. First operand 154987 states and 275216 transitions. Second operand 6 states. [2019-09-08 03:58:21,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:58:21,096 INFO L93 Difference]: Finished difference Result 323398 states and 573368 transitions. [2019-09-08 03:58:21,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:58:21,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 207 [2019-09-08 03:58:21,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:58:22,295 INFO L225 Difference]: With dead ends: 323398 [2019-09-08 03:58:22,295 INFO L226 Difference]: Without dead ends: 195445 [2019-09-08 03:58:23,249 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:58:23,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195445 states. [2019-09-08 03:58:34,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195445 to 187247. [2019-09-08 03:58:34,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187247 states. [2019-09-08 03:58:44,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187247 states to 187247 states and 332352 transitions. [2019-09-08 03:58:44,213 INFO L78 Accepts]: Start accepts. Automaton has 187247 states and 332352 transitions. Word has length 207 [2019-09-08 03:58:44,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:58:44,213 INFO L475 AbstractCegarLoop]: Abstraction has 187247 states and 332352 transitions. [2019-09-08 03:58:44,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:58:44,213 INFO L276 IsEmpty]: Start isEmpty. Operand 187247 states and 332352 transitions. [2019-09-08 03:58:44,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-08 03:58:44,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:58:44,220 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:58:44,220 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:58:44,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:58:44,220 INFO L82 PathProgramCache]: Analyzing trace with hash 219003071, now seen corresponding path program 1 times [2019-09-08 03:58:44,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:58:44,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:58:44,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:58:44,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:58:44,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:58:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:58:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 03:58:44,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:58:44,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:58:44,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:58:44,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:58:44,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:58:44,360 INFO L87 Difference]: Start difference. First operand 187247 states and 332352 transitions. Second operand 4 states. [2019-09-08 03:59:03,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:59:03,447 INFO L93 Difference]: Finished difference Result 373712 states and 677322 transitions. [2019-09-08 03:59:03,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:59:03,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2019-09-08 03:59:03,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:59:05,211 INFO L225 Difference]: With dead ends: 373712 [2019-09-08 03:59:05,212 INFO L226 Difference]: Without dead ends: 186574 [2019-09-08 03:59:05,858 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:59:05,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186574 states. [2019-09-08 03:59:26,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186574 to 186574. [2019-09-08 03:59:26,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186574 states. [2019-09-08 03:59:28,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186574 states to 186574 states and 331006 transitions. [2019-09-08 03:59:28,547 INFO L78 Accepts]: Start accepts. Automaton has 186574 states and 331006 transitions. Word has length 206 [2019-09-08 03:59:28,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:59:28,548 INFO L475 AbstractCegarLoop]: Abstraction has 186574 states and 331006 transitions. [2019-09-08 03:59:28,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:59:28,548 INFO L276 IsEmpty]: Start isEmpty. Operand 186574 states and 331006 transitions. [2019-09-08 03:59:28,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-08 03:59:28,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:59:28,553 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:59:28,554 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:59:28,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:59:28,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1801142962, now seen corresponding path program 1 times [2019-09-08 03:59:28,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:59:28,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:59:28,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:59:28,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:59:28,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:59:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:59:29,487 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 03:59:29,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:59:29,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:59:29,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:59:29,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:59:29,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:59:29,488 INFO L87 Difference]: Start difference. First operand 186574 states and 331006 transitions. Second operand 6 states. [2019-09-08 03:59:46,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:59:46,250 INFO L93 Difference]: Finished difference Result 187031 states and 332795 transitions. [2019-09-08 03:59:46,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:59:46,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 207 [2019-09-08 03:59:46,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:59:47,335 INFO L225 Difference]: With dead ends: 187031 [2019-09-08 03:59:47,335 INFO L226 Difference]: Without dead ends: 187015 [2019-09-08 03:59:47,427 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:59:47,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187015 states. [2019-09-08 03:59:58,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187015 to 186676. [2019-09-08 03:59:58,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186676 states. [2019-09-08 04:00:00,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186676 states to 186676 states and 331108 transitions. [2019-09-08 04:00:00,776 INFO L78 Accepts]: Start accepts. Automaton has 186676 states and 331108 transitions. Word has length 207 [2019-09-08 04:00:00,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:00:00,777 INFO L475 AbstractCegarLoop]: Abstraction has 186676 states and 331108 transitions. [2019-09-08 04:00:00,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:00:00,777 INFO L276 IsEmpty]: Start isEmpty. Operand 186676 states and 331108 transitions. [2019-09-08 04:00:00,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-08 04:00:00,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:00:00,782 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:00:00,783 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:00:00,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:00:00,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1567176173, now seen corresponding path program 1 times [2019-09-08 04:00:00,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:00:00,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:00:00,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:00,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:00:00,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:00,964 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 04:00:00,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:00:00,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:00:00,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:00:00,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:00:00,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:00:00,969 INFO L87 Difference]: Start difference. First operand 186676 states and 331108 transitions. Second operand 8 states. [2019-09-08 04:00:17,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:00:17,499 INFO L93 Difference]: Finished difference Result 186760 states and 331228 transitions. [2019-09-08 04:00:17,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:00:17,499 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 213 [2019-09-08 04:00:17,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:00:18,964 INFO L225 Difference]: With dead ends: 186760 [2019-09-08 04:00:18,965 INFO L226 Difference]: Without dead ends: 186744 [2019-09-08 04:00:19,052 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 04:00:19,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186744 states. [2019-09-08 04:00:29,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186744 to 186676. [2019-09-08 04:00:29,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186676 states. [2019-09-08 04:00:31,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186676 states to 186676 states and 330916 transitions. [2019-09-08 04:00:31,478 INFO L78 Accepts]: Start accepts. Automaton has 186676 states and 330916 transitions. Word has length 213 [2019-09-08 04:00:31,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:00:31,478 INFO L475 AbstractCegarLoop]: Abstraction has 186676 states and 330916 transitions. [2019-09-08 04:00:31,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:00:31,479 INFO L276 IsEmpty]: Start isEmpty. Operand 186676 states and 330916 transitions. [2019-09-08 04:00:31,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 04:00:31,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:00:31,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:00:31,485 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:00:31,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:00:31,486 INFO L82 PathProgramCache]: Analyzing trace with hash -955140363, now seen corresponding path program 1 times [2019-09-08 04:00:31,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:00:31,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:00:31,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:31,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:00:31,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:31,667 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 04:00:31,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:00:31,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:00:31,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:00:31,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:00:31,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:00:31,669 INFO L87 Difference]: Start difference. First operand 186676 states and 330916 transitions. Second operand 9 states. [2019-09-08 04:00:57,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:00:57,040 INFO L93 Difference]: Finished difference Result 373683 states and 664253 transitions. [2019-09-08 04:00:57,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:00:57,040 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 231 [2019-09-08 04:00:57,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:00:58,643 INFO L225 Difference]: With dead ends: 373683 [2019-09-08 04:00:58,643 INFO L226 Difference]: Without dead ends: 187252 [2019-09-08 04:00:59,253 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 04:00:59,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187252 states. [2019-09-08 04:01:10,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187252 to 186676. [2019-09-08 04:01:10,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186676 states. [2019-09-08 04:01:12,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186676 states to 186676 states and 330724 transitions. [2019-09-08 04:01:12,612 INFO L78 Accepts]: Start accepts. Automaton has 186676 states and 330724 transitions. Word has length 231 [2019-09-08 04:01:12,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:01:12,613 INFO L475 AbstractCegarLoop]: Abstraction has 186676 states and 330724 transitions. [2019-09-08 04:01:12,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:01:12,613 INFO L276 IsEmpty]: Start isEmpty. Operand 186676 states and 330724 transitions. [2019-09-08 04:01:12,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 04:01:12,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:01:12,621 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, 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 04:01:12,621 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:01:12,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:01:12,623 INFO L82 PathProgramCache]: Analyzing trace with hash -959168253, now seen corresponding path program 1 times [2019-09-08 04:01:12,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:01:12,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:01:12,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:12,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:01:12,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:01:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:01:12,894 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 04:01:12,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:01:12,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:01:12,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:01:12,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:01:12,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:01:12,896 INFO L87 Difference]: Start difference. First operand 186676 states and 330724 transitions. Second operand 9 states. [2019-09-08 04:02:04,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:02:04,316 INFO L93 Difference]: Finished difference Result 597158 states and 1076680 transitions. [2019-09-08 04:02:04,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:02:04,316 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 241 [2019-09-08 04:02:04,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:02:08,052 INFO L225 Difference]: With dead ends: 597158 [2019-09-08 04:02:08,052 INFO L226 Difference]: Without dead ends: 410591 [2019-09-08 04:02:08,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:02:09,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410591 states. [2019-09-08 04:02:46,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410591 to 392637. [2019-09-08 04:02:46,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392637 states. [2019-09-08 04:02:50,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392637 states to 392637 states and 709347 transitions. [2019-09-08 04:02:50,591 INFO L78 Accepts]: Start accepts. Automaton has 392637 states and 709347 transitions. Word has length 241 [2019-09-08 04:02:50,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:02:50,592 INFO L475 AbstractCegarLoop]: Abstraction has 392637 states and 709347 transitions. [2019-09-08 04:02:50,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:02:50,592 INFO L276 IsEmpty]: Start isEmpty. Operand 392637 states and 709347 transitions. [2019-09-08 04:02:50,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 04:02:50,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:02:50,602 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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 04:02:50,603 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:02:50,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:02:50,603 INFO L82 PathProgramCache]: Analyzing trace with hash 679929366, now seen corresponding path program 1 times [2019-09-08 04:02:50,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:02:50,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:02:50,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:50,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:02:50,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:02:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:52,299 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 04:02:52,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:02:52,300 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 04:02:52,317 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 04:02:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:02:52,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 3459 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:02:52,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:02:52,988 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 04:02:52,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:02:52,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-09-08 04:02:52,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 04:02:52,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 04:02:52,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:02:52,998 INFO L87 Difference]: Start difference. First operand 392637 states and 709347 transitions. Second operand 14 states. [2019-09-08 04:03:54,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:03:54,964 INFO L93 Difference]: Finished difference Result 868877 states and 1620917 transitions. [2019-09-08 04:03:54,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:03:54,965 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 241 [2019-09-08 04:03:54,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:04:00,147 INFO L225 Difference]: With dead ends: 868877 [2019-09-08 04:04:00,147 INFO L226 Difference]: Without dead ends: 476349 [2019-09-08 04:04:02,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-09-08 04:04:03,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476349 states. [2019-09-08 04:04:49,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476349 to 439491. [2019-09-08 04:04:49,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439491 states.