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_product19.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 03:49:45,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 03:49:45,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 03:49:45,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 03:49:45,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 03:49:45,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 03:49:45,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 03:49:45,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 03:49:45,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 03:49:45,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 03:49:45,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 03:49:45,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 03:49:45,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 03:49:45,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 03:49:45,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 03:49:45,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 03:49:45,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 03:49:45,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 03:49:45,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 03:49:45,912 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 03:49:45,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 03:49:45,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 03:49:45,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 03:49:45,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 03:49:45,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 03:49:45,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 03:49:45,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 03:49:45,920 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 03:49:45,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 03:49:45,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 03:49:45,922 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 03:49:45,925 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 03:49:45,926 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 03:49:45,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 03:49:45,928 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 03:49:45,929 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 03:49:45,929 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 03:49:45,929 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 03:49:45,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 03:49:45,930 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 03:49:45,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 03:49:45,932 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:49:45,958 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 03:49:45,958 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 03:49:45,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 03:49:45,960 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 03:49:45,960 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 03:49:45,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 03:49:45,965 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 03:49:45,965 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 03:49:45,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 03:49:45,966 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 03:49:45,966 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 03:49:45,966 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 03:49:45,966 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 03:49:45,967 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 03:49:45,967 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 03:49:45,967 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 03:49:45,967 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 03:49:45,967 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 03:49:45,968 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 03:49:45,968 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 03:49:45,968 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 03:49:45,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:49:45,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 03:49:45,969 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 03:49:45,969 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 03:49:45,969 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 03:49:45,971 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 03:49:45,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 03:49:45,972 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 03:49:46,014 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 03:49:46,027 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 03:49:46,030 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 03:49:46,032 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 03:49:46,032 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 03:49:46,033 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product19.cil.c [2019-09-08 03:49:46,094 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0ef94212/1d8a4698962f4697a214e71e235d4680/FLAG09c0bd445 [2019-09-08 03:49:46,767 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 03:49:46,768 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product19.cil.c [2019-09-08 03:49:46,790 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0ef94212/1d8a4698962f4697a214e71e235d4680/FLAG09c0bd445 [2019-09-08 03:49:46,929 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0ef94212/1d8a4698962f4697a214e71e235d4680 [2019-09-08 03:49:46,939 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 03:49:46,941 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 03:49:46,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 03:49:46,942 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 03:49:46,944 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 03:49:46,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:49:46" (1/1) ... [2019-09-08 03:49:46,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@626530f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:49:46, skipping insertion in model container [2019-09-08 03:49:46,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:49:46" (1/1) ... [2019-09-08 03:49:46,954 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 03:49:47,033 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 03:49:47,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:49:47,822 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 03:49:47,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:49:48,051 INFO L192 MainTranslator]: Completed translation [2019-09-08 03:49:48,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:49:48 WrapperNode [2019-09-08 03:49:48,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 03:49:48,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 03:49:48,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 03:49:48,053 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 03:49:48,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:49:48" (1/1) ... [2019-09-08 03:49:48,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:49:48" (1/1) ... [2019-09-08 03:49:48,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:49:48" (1/1) ... [2019-09-08 03:49:48,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:49:48" (1/1) ... [2019-09-08 03:49:48,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:49:48" (1/1) ... [2019-09-08 03:49:48,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:49:48" (1/1) ... [2019-09-08 03:49:48,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:49:48" (1/1) ... [2019-09-08 03:49:48,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 03:49:48,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 03:49:48,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 03:49:48,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 03:49:48,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:49:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:49:48,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 03:49:48,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 03:49:48,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 03:49:48,333 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 03:49:48,333 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 03:49:48,333 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 03:49:48,333 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 03:49:48,334 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 03:49:48,334 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 03:49:48,334 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 03:49:48,334 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 03:49:48,334 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 03:49:48,335 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 03:49:48,335 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 03:49:48,335 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 03:49:48,335 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 03:49:48,335 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 03:49:48,336 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 03:49:48,336 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 03:49:48,337 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 03:49:48,338 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 03:49:48,338 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 03:49:48,338 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 03:49:48,338 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 03:49:48,338 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 03:49:48,339 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 03:49:48,339 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 03:49:48,339 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 03:49:48,340 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 03:49:48,340 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 03:49:48,340 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 03:49:48,340 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 03:49:48,340 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 03:49:48,340 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 03:49:48,341 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 03:49:48,341 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 03:49:48,341 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-09-08 03:49:48,341 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-09-08 03:49:48,341 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-09-08 03:49:48,341 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-09-08 03:49:48,341 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 03:49:48,342 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 03:49:48,342 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 03:49:48,342 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 03:49:48,342 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 03:49:48,343 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 03:49:48,343 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 03:49:48,343 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 03:49:48,343 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 03:49:48,343 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 03:49:48,343 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 03:49:48,344 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 03:49:48,344 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 03:49:48,344 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 03:49:48,344 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 03:49:48,344 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 03:49:48,345 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-09-08 03:49:48,345 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 03:49:48,345 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 03:49:48,345 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 03:49:48,345 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-09-08 03:49:48,345 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 03:49:48,346 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 03:49:48,346 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 03:49:48,346 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 03:49:48,346 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 03:49:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 03:49:48,347 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-08 03:49:48,348 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-08 03:49:48,348 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 03:49:48,348 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 03:49:48,348 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 03:49:48,348 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 03:49:48,349 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 03:49:48,350 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 03:49:48,350 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 03:49:48,350 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 03:49:48,350 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 03:49:48,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 03:49:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 03:49:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 03:49:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 03:49:48,352 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 03:49:48,352 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 03:49:48,352 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 03:49:48,353 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 03:49:48,353 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 03:49:48,354 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 03:49:48,354 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 03:49:48,354 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 03:49:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 03:49:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 03:49:48,355 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 03:49:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 03:49:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 03:49:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-09-08 03:49:48,356 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 03:49:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 03:49:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 03:49:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 03:49:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 03:49:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 03:49:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 03:49:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 03:49:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 03:49:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 03:49:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 03:49:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 03:49:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 03:49:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 03:49:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 03:49:48,359 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 03:49:48,360 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 03:49:48,360 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 03:49:48,360 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-09-08 03:49:48,361 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-09-08 03:49:48,361 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 03:49:48,361 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 03:49:48,361 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 03:49:48,361 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 03:49:48,362 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 03:49:48,362 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 03:49:48,362 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 03:49:48,362 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 03:49:48,364 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 03:49:48,364 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-09-08 03:49:48,364 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 03:49:48,364 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 03:49:48,364 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 03:49:48,365 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 03:49:48,365 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 03:49:48,366 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 03:49:48,366 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-08 03:49:48,366 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-08 03:49:48,366 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 03:49:48,367 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 03:49:48,367 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 03:49:48,367 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 03:49:48,367 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 03:49:48,368 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 03:49:48,371 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 03:49:48,372 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-09-08 03:49:48,372 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 03:49:48,373 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 03:49:48,379 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-09-08 03:49:48,379 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 03:49:48,379 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 03:49:48,379 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 03:49:48,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 03:49:48,380 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 03:49:48,380 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 03:49:48,381 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 03:49:48,381 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 03:49:48,381 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 03:49:48,381 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 03:49:48,381 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 03:49:48,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 03:49:48,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 03:49:48,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 03:49:48,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 03:49:48,382 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 03:49:48,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 03:49:48,382 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 03:49:48,383 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 03:49:48,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 03:49:48,383 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 03:49:48,383 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 03:49:48,383 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 03:49:48,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 03:49:48,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 03:49:48,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 03:49:50,811 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 03:49:50,812 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 03:49:50,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:49:50 BoogieIcfgContainer [2019-09-08 03:49:50,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 03:49:50,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 03:49:50,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 03:49:50,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 03:49:50,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 03:49:46" (1/3) ... [2019-09-08 03:49:50,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ffc094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:49:50, skipping insertion in model container [2019-09-08 03:49:50,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:49:48" (2/3) ... [2019-09-08 03:49:50,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53ffc094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:49:50, skipping insertion in model container [2019-09-08 03:49:50,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:49:50" (3/3) ... [2019-09-08 03:49:50,823 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product19.cil.c [2019-09-08 03:49:50,835 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 03:49:50,845 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 03:49:50,861 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 03:49:50,912 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 03:49:50,913 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 03:49:50,913 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 03:49:50,914 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 03:49:50,914 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 03:49:50,914 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 03:49:50,914 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 03:49:50,914 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 03:49:50,914 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 03:49:50,960 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states. [2019-09-08 03:49:50,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 03:49:50,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:50,996 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:49:51,002 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:51,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:51,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1279935943, now seen corresponding path program 1 times [2019-09-08 03:49:51,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:51,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:51,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:51,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:51,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 03:49:51,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:49:51,736 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:49:51,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:52,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 3289 conjuncts, 1 conjunts are in the unsatisfiable core [2019-09-08 03:49:52,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:49:52,467 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 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:49:52,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:49:52,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-09-08 03:49:52,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:49:52,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:49:52,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:49:52,508 INFO L87 Difference]: Start difference. First operand 771 states. Second operand 4 states. [2019-09-08 03:49:52,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:49:52,766 INFO L93 Difference]: Finished difference Result 1226 states and 1977 transitions. [2019-09-08 03:49:52,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:49:52,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-08 03:49:52,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:49:52,800 INFO L225 Difference]: With dead ends: 1226 [2019-09-08 03:49:52,801 INFO L226 Difference]: Without dead ends: 617 [2019-09-08 03:49:52,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 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:49:52,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-08 03:49:52,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-09-08 03:49:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-09-08 03:49:52,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 982 transitions. [2019-09-08 03:49:52,947 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 982 transitions. Word has length 164 [2019-09-08 03:49:52,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:52,948 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 982 transitions. [2019-09-08 03:49:52,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:49:52,948 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 982 transitions. [2019-09-08 03:49:52,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 03:49:52,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:52,959 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:49:52,960 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:52,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:52,963 INFO L82 PathProgramCache]: Analyzing trace with hash -699423164, now seen corresponding path program 1 times [2019-09-08 03:49:52,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:52,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:52,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:52,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:52,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 03:49:53,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:49:53,150 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:49:53,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:53,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 3294 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:49:53,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:49:53,797 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:49:53,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:49:53,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:49:53,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:49:53,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:49:53,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:49:53,821 INFO L87 Difference]: Start difference. First operand 617 states and 982 transitions. Second operand 6 states. [2019-09-08 03:49:54,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:49:54,007 INFO L93 Difference]: Finished difference Result 1206 states and 1937 transitions. [2019-09-08 03:49:54,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:49:54,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 168 [2019-09-08 03:49:54,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:49:54,015 INFO L225 Difference]: With dead ends: 1206 [2019-09-08 03:49:54,017 INFO L226 Difference]: Without dead ends: 617 [2019-09-08 03:49:54,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 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:49:54,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-08 03:49:54,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-09-08 03:49:54,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-09-08 03:49:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 981 transitions. [2019-09-08 03:49:54,070 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 981 transitions. Word has length 168 [2019-09-08 03:49:54,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:54,071 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 981 transitions. [2019-09-08 03:49:54,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:49:54,071 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 981 transitions. [2019-09-08 03:49:54,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 03:49:54,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:54,077 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:49:54,077 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:54,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:54,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1185296208, now seen corresponding path program 1 times [2019-09-08 03:49:54,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:54,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:54,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:54,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:54,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:54,244 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 03:49:54,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:49:54,245 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:49:54,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:54,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 3296 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:49:54,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:49:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 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:49:54,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:49:54,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:49:54,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:49:54,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:49:54,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:49:54,818 INFO L87 Difference]: Start difference. First operand 617 states and 981 transitions. Second operand 6 states. [2019-09-08 03:49:55,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:49:55,006 INFO L93 Difference]: Finished difference Result 1210 states and 1940 transitions. [2019-09-08 03:49:55,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:49:55,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2019-09-08 03:49:55,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:49:55,013 INFO L225 Difference]: With dead ends: 1210 [2019-09-08 03:49:55,013 INFO L226 Difference]: Without dead ends: 623 [2019-09-08 03:49:55,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 169 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:49:55,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-08 03:49:55,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-09-08 03:49:55,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-08 03:49:55,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 986 transitions. [2019-09-08 03:49:55,072 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 986 transitions. Word has length 170 [2019-09-08 03:49:55,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:55,073 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 986 transitions. [2019-09-08 03:49:55,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:49:55,074 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 986 transitions. [2019-09-08 03:49:55,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 03:49:55,081 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:55,082 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, 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] [2019-09-08 03:49:55,082 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:55,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:55,083 INFO L82 PathProgramCache]: Analyzing trace with hash -766305062, now seen corresponding path program 1 times [2019-09-08 03:49:55,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:55,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:55,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:55,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:55,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:55,244 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 03:49:55,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:49:55,245 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:49:55,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:55,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 3297 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:49:55,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:49:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:49:55,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:49:55,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:49:55,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:49:55,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:49:55,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:49:55,777 INFO L87 Difference]: Start difference. First operand 623 states and 986 transitions. Second operand 6 states. [2019-09-08 03:49:55,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:49:55,866 INFO L93 Difference]: Finished difference Result 1209 states and 1931 transitions. [2019-09-08 03:49:55,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:49:55,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 171 [2019-09-08 03:49:55,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:49:55,872 INFO L225 Difference]: With dead ends: 1209 [2019-09-08 03:49:55,872 INFO L226 Difference]: Without dead ends: 623 [2019-09-08 03:49:55,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 171 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:49:55,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-08 03:49:55,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-09-08 03:49:55,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-08 03:49:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 985 transitions. [2019-09-08 03:49:55,899 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 985 transitions. Word has length 171 [2019-09-08 03:49:55,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:55,900 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 985 transitions. [2019-09-08 03:49:55,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:49:55,900 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 985 transitions. [2019-09-08 03:49:55,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 03:49:55,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:55,905 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:49:55,905 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:55,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:55,906 INFO L82 PathProgramCache]: Analyzing trace with hash -523185676, now seen corresponding path program 1 times [2019-09-08 03:49:55,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:55,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:55,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:55,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:55,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:56,099 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 03:49:56,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:49:56,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:49:56,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:56,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 3298 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:49:56,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:49:56,649 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:49:56,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:49:56,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:49:56,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:49:56,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:49:56,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:49:56,670 INFO L87 Difference]: Start difference. First operand 623 states and 985 transitions. Second operand 6 states. [2019-09-08 03:49:56,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:49:56,754 INFO L93 Difference]: Finished difference Result 1209 states and 1930 transitions. [2019-09-08 03:49:56,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:49:56,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2019-09-08 03:49:56,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:49:56,760 INFO L225 Difference]: With dead ends: 1209 [2019-09-08 03:49:56,761 INFO L226 Difference]: Without dead ends: 623 [2019-09-08 03:49:56,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 172 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:49:56,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-08 03:49:56,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-09-08 03:49:56,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-08 03:49:56,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 984 transitions. [2019-09-08 03:49:56,788 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 984 transitions. Word has length 172 [2019-09-08 03:49:56,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:56,788 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 984 transitions. [2019-09-08 03:49:56,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:49:56,789 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 984 transitions. [2019-09-08 03:49:56,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 03:49:56,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:56,794 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:49:56,794 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:56,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:56,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1402299617, now seen corresponding path program 1 times [2019-09-08 03:49:56,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:56,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:56,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:56,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:56,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:56,926 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 03:49:56,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:49:56,927 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:49:56,951 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:49:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:57,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 3298 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:49:57,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:49:57,518 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 03:49:57,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:49:57,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:49:57,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:49:57,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:49:57,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:49:57,527 INFO L87 Difference]: Start difference. First operand 623 states and 984 transitions. Second operand 6 states. [2019-09-08 03:49:57,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:49:57,831 INFO L93 Difference]: Finished difference Result 1212 states and 1935 transitions. [2019-09-08 03:49:57,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:49:57,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 173 [2019-09-08 03:49:57,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:49:57,837 INFO L225 Difference]: With dead ends: 1212 [2019-09-08 03:49:57,837 INFO L226 Difference]: Without dead ends: 623 [2019-09-08 03:49:57,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:49:57,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-08 03:49:57,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-09-08 03:49:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-08 03:49:57,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 978 transitions. [2019-09-08 03:49:57,863 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 978 transitions. Word has length 173 [2019-09-08 03:49:57,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:57,863 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 978 transitions. [2019-09-08 03:49:57,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:49:57,863 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 978 transitions. [2019-09-08 03:49:57,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 03:49:57,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:57,868 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:49:57,868 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:57,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:57,869 INFO L82 PathProgramCache]: Analyzing trace with hash 731420686, now seen corresponding path program 1 times [2019-09-08 03:49:57,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:57,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:57,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:57,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:57,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:58,158 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 03:49:58,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:49:58,159 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:49:58,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:49:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:58,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 3301 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:49:58,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:49:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 03:49:58,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:49:58,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-09-08 03:49:58,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:49:58,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:49:58,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:49:58,668 INFO L87 Difference]: Start difference. First operand 623 states and 978 transitions. Second operand 12 states. [2019-09-08 03:49:59,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:49:59,241 INFO L93 Difference]: Finished difference Result 1214 states and 1929 transitions. [2019-09-08 03:49:59,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:49:59,241 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 175 [2019-09-08 03:49:59,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:49:59,248 INFO L225 Difference]: With dead ends: 1214 [2019-09-08 03:49:59,248 INFO L226 Difference]: Without dead ends: 626 [2019-09-08 03:49:59,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:49:59,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-08 03:49:59,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-08 03:49:59,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 03:49:59,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 977 transitions. [2019-09-08 03:49:59,279 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 977 transitions. Word has length 175 [2019-09-08 03:49:59,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:59,280 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 977 transitions. [2019-09-08 03:49:59,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:49:59,280 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 977 transitions. [2019-09-08 03:49:59,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 03:49:59,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:59,286 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, 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:49:59,286 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:59,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:59,286 INFO L82 PathProgramCache]: Analyzing trace with hash -837577245, now seen corresponding path program 1 times [2019-09-08 03:49:59,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:59,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:59,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:59,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:59,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 03:49:59,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:49:59,445 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:49:59,473 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:49:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:59,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 3304 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:49:59,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:49:59,986 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 03:50:00,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:50:00,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:50:00,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:50:00,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:50:00,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:50:00,005 INFO L87 Difference]: Start difference. First operand 626 states and 977 transitions. Second operand 8 states. [2019-09-08 03:50:00,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:00,297 INFO L93 Difference]: Finished difference Result 1238 states and 1952 transitions. [2019-09-08 03:50:00,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:50:00,298 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2019-09-08 03:50:00,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:00,303 INFO L225 Difference]: With dead ends: 1238 [2019-09-08 03:50:00,303 INFO L226 Difference]: Without dead ends: 644 [2019-09-08 03:50:00,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 179 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:50:00,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-09-08 03:50:00,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 641. [2019-09-08 03:50:00,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-09-08 03:50:00,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 990 transitions. [2019-09-08 03:50:00,327 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 990 transitions. Word has length 178 [2019-09-08 03:50:00,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:00,328 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 990 transitions. [2019-09-08 03:50:00,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:50:00,328 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 990 transitions. [2019-09-08 03:50:00,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 03:50:00,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:00,333 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, 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:50:00,334 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:00,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:00,334 INFO L82 PathProgramCache]: Analyzing trace with hash -206288541, now seen corresponding path program 1 times [2019-09-08 03:50:00,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:00,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:00,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:00,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:00,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 03:50:00,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:50:00,506 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:50:00,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:01,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 3300 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 03:50:01,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:50:01,206 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:50:01,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:50:01,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-09-08 03:50:01,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:50:01,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:50:01,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:50:01,223 INFO L87 Difference]: Start difference. First operand 641 states and 990 transitions. Second operand 14 states. [2019-09-08 03:50:01,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:01,516 INFO L93 Difference]: Finished difference Result 1228 states and 1917 transitions. [2019-09-08 03:50:01,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:50:01,517 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 178 [2019-09-08 03:50:01,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:01,523 INFO L225 Difference]: With dead ends: 1228 [2019-09-08 03:50:01,523 INFO L226 Difference]: Without dead ends: 635 [2019-09-08 03:50:01,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 174 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:50:01,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-09-08 03:50:01,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 630. [2019-09-08 03:50:01,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-09-08 03:50:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 970 transitions. [2019-09-08 03:50:01,555 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 970 transitions. Word has length 178 [2019-09-08 03:50:01,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:01,556 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 970 transitions. [2019-09-08 03:50:01,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:50:01,556 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 970 transitions. [2019-09-08 03:50:01,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 03:50:01,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:01,561 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:50:01,561 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:01,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:01,562 INFO L82 PathProgramCache]: Analyzing trace with hash 351986180, now seen corresponding path program 1 times [2019-09-08 03:50:01,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:01,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:01,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:01,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:01,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:01,751 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 03:50:01,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:50:01,752 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:50:01,786 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:50:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:02,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 3307 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:50:02,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:50:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:50:02,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:50:02,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:50:02,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:50:02,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:50:02,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:50:02,339 INFO L87 Difference]: Start difference. First operand 630 states and 970 transitions. Second operand 8 states. [2019-09-08 03:50:02,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:02,557 INFO L93 Difference]: Finished difference Result 1210 states and 1886 transitions. [2019-09-08 03:50:02,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:50:02,558 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 181 [2019-09-08 03:50:02,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:02,564 INFO L225 Difference]: With dead ends: 1210 [2019-09-08 03:50:02,564 INFO L226 Difference]: Without dead ends: 630 [2019-09-08 03:50:02,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 183 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:50:02,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-09-08 03:50:02,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-09-08 03:50:02,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-09-08 03:50:02,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 969 transitions. [2019-09-08 03:50:02,600 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 969 transitions. Word has length 181 [2019-09-08 03:50:02,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:02,600 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 969 transitions. [2019-09-08 03:50:02,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:50:02,601 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 969 transitions. [2019-09-08 03:50:02,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 03:50:02,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:02,606 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, 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:50:02,606 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:02,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:02,607 INFO L82 PathProgramCache]: Analyzing trace with hash 545192689, now seen corresponding path program 1 times [2019-09-08 03:50:02,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:02,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:02,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:02,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:02,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:02,779 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 03:50:02,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:50:02,780 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:50:02,793 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:50:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:03,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 3308 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:50:03,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:50:03,288 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 03:50:03,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:50:03,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:50:03,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:50:03,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:50:03,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:50:03,298 INFO L87 Difference]: Start difference. First operand 630 states and 969 transitions. Second operand 8 states. [2019-09-08 03:50:03,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:03,500 INFO L93 Difference]: Finished difference Result 1210 states and 1885 transitions. [2019-09-08 03:50:03,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:50:03,501 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 182 [2019-09-08 03:50:03,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:03,509 INFO L225 Difference]: With dead ends: 1210 [2019-09-08 03:50:03,509 INFO L226 Difference]: Without dead ends: 630 [2019-09-08 03:50:03,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 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:50:03,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-09-08 03:50:03,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-09-08 03:50:03,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-09-08 03:50:03,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 968 transitions. [2019-09-08 03:50:03,549 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 968 transitions. Word has length 182 [2019-09-08 03:50:03,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:03,549 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 968 transitions. [2019-09-08 03:50:03,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:50:03,549 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 968 transitions. [2019-09-08 03:50:03,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 03:50:03,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:03,563 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, 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:50:03,563 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:03,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:03,564 INFO L82 PathProgramCache]: Analyzing trace with hash 343509695, now seen corresponding path program 1 times [2019-09-08 03:50:03,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:03,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:03,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:03,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:03,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:03,904 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 03:50:03,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:50:03,906 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:50:03,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:04,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 3309 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 03:50:04,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:50:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 03:50:04,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:50:04,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2019-09-08 03:50:04,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 03:50:04,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 03:50:04,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-08 03:50:04,686 INFO L87 Difference]: Start difference. First operand 630 states and 968 transitions. Second operand 18 states. [2019-09-08 03:50:05,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:05,250 INFO L93 Difference]: Finished difference Result 1226 states and 1912 transitions. [2019-09-08 03:50:05,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 03:50:05,251 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 183 [2019-09-08 03:50:05,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:05,260 INFO L225 Difference]: With dead ends: 1226 [2019-09-08 03:50:05,260 INFO L226 Difference]: Without dead ends: 645 [2019-09-08 03:50:05,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-08 03:50:05,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2019-09-08 03:50:05,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 641. [2019-09-08 03:50:05,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-09-08 03:50:05,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 976 transitions. [2019-09-08 03:50:05,287 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 976 transitions. Word has length 183 [2019-09-08 03:50:05,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:05,288 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 976 transitions. [2019-09-08 03:50:05,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 03:50:05,288 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 976 transitions. [2019-09-08 03:50:05,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 03:50:05,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:05,293 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:50:05,293 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:05,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:05,293 INFO L82 PathProgramCache]: Analyzing trace with hash -2084842551, now seen corresponding path program 1 times [2019-09-08 03:50:05,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:05,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:05,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:05,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:05,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:05,444 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 03:50:05,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:05,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:50:05,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:50:05,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:50:05,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:50:05,447 INFO L87 Difference]: Start difference. First operand 641 states and 976 transitions. Second operand 9 states. [2019-09-08 03:50:05,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:05,609 INFO L93 Difference]: Finished difference Result 1157 states and 1808 transitions. [2019-09-08 03:50:05,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:50:05,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 184 [2019-09-08 03:50:05,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:05,617 INFO L225 Difference]: With dead ends: 1157 [2019-09-08 03:50:05,617 INFO L226 Difference]: Without dead ends: 638 [2019-09-08 03:50:05,620 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:50:05,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-09-08 03:50:05,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-09-08 03:50:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-09-08 03:50:05,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 971 transitions. [2019-09-08 03:50:05,642 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 971 transitions. Word has length 184 [2019-09-08 03:50:05,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:05,643 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 971 transitions. [2019-09-08 03:50:05,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:50:05,643 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 971 transitions. [2019-09-08 03:50:05,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 03:50:05,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:05,649 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] [2019-09-08 03:50:05,649 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:05,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:05,650 INFO L82 PathProgramCache]: Analyzing trace with hash -2077513911, now seen corresponding path program 1 times [2019-09-08 03:50:05,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:05,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:05,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:05,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:05,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:05,804 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 03:50:05,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:05,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:50:05,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:50:05,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:50:05,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:50:05,806 INFO L87 Difference]: Start difference. First operand 638 states and 971 transitions. Second operand 7 states. [2019-09-08 03:50:05,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:05,897 INFO L93 Difference]: Finished difference Result 1154 states and 1803 transitions. [2019-09-08 03:50:05,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:50:05,898 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 184 [2019-09-08 03:50:05,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:05,903 INFO L225 Difference]: With dead ends: 1154 [2019-09-08 03:50:05,903 INFO L226 Difference]: Without dead ends: 617 [2019-09-08 03:50:05,906 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:50:05,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-08 03:50:05,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 615. [2019-09-08 03:50:05,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-09-08 03:50:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 941 transitions. [2019-09-08 03:50:05,934 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 941 transitions. Word has length 184 [2019-09-08 03:50:05,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:05,934 INFO L475 AbstractCegarLoop]: Abstraction has 615 states and 941 transitions. [2019-09-08 03:50:05,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:50:05,934 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 941 transitions. [2019-09-08 03:50:05,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 03:50:05,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:05,939 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] [2019-09-08 03:50:05,939 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:05,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:05,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1615961084, now seen corresponding path program 1 times [2019-09-08 03:50:05,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:05,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:05,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:05,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:05,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:06,174 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 03:50:06,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:06,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 03:50:06,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:50:06,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:50:06,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:50:06,176 INFO L87 Difference]: Start difference. First operand 615 states and 941 transitions. Second operand 13 states. [2019-09-08 03:50:06,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:06,474 INFO L93 Difference]: Finished difference Result 1132 states and 1771 transitions. [2019-09-08 03:50:06,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:50:06,474 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 185 [2019-09-08 03:50:06,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:06,478 INFO L225 Difference]: With dead ends: 1132 [2019-09-08 03:50:06,478 INFO L226 Difference]: Without dead ends: 608 [2019-09-08 03:50:06,484 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:50:06,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-09-08 03:50:06,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2019-09-08 03:50:06,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-09-08 03:50:06,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 932 transitions. [2019-09-08 03:50:06,505 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 932 transitions. Word has length 185 [2019-09-08 03:50:06,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:06,505 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 932 transitions. [2019-09-08 03:50:06,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:50:06,505 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 932 transitions. [2019-09-08 03:50:06,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 03:50:06,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:06,511 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, 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:50:06,511 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:06,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:06,512 INFO L82 PathProgramCache]: Analyzing trace with hash -782115016, now seen corresponding path program 1 times [2019-09-08 03:50:06,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:06,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:06,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:06,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:06,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:06,727 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 03:50:06,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:06,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 03:50:06,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:50:06,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:50:06,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:50:06,729 INFO L87 Difference]: Start difference. First operand 608 states and 932 transitions. Second operand 13 states. [2019-09-08 03:50:07,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:07,197 INFO L93 Difference]: Finished difference Result 1183 states and 1839 transitions. [2019-09-08 03:50:07,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:50:07,198 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 186 [2019-09-08 03:50:07,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:07,208 INFO L225 Difference]: With dead ends: 1183 [2019-09-08 03:50:07,208 INFO L226 Difference]: Without dead ends: 622 [2019-09-08 03:50:07,211 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:50:07,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-09-08 03:50:07,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 620. [2019-09-08 03:50:07,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 03:50:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 947 transitions. [2019-09-08 03:50:07,240 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 947 transitions. Word has length 186 [2019-09-08 03:50:07,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:07,243 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 947 transitions. [2019-09-08 03:50:07,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:50:07,244 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 947 transitions. [2019-09-08 03:50:07,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-08 03:50:07,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:07,250 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, 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:50:07,250 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:07,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:07,251 INFO L82 PathProgramCache]: Analyzing trace with hash -994980215, now seen corresponding path program 1 times [2019-09-08 03:50:07,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:07,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:07,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:07,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:07,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:50:07,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:07,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:50:07,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:50:07,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:50:07,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:50:07,486 INFO L87 Difference]: Start difference. First operand 620 states and 947 transitions. Second operand 11 states. [2019-09-08 03:50:07,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:07,712 INFO L93 Difference]: Finished difference Result 1137 states and 1777 transitions. [2019-09-08 03:50:07,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:50:07,713 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 187 [2019-09-08 03:50:07,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:07,718 INFO L225 Difference]: With dead ends: 1137 [2019-09-08 03:50:07,718 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 03:50:07,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:50:07,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 03:50:07,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-08 03:50:07,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 03:50:07,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 946 transitions. [2019-09-08 03:50:07,748 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 946 transitions. Word has length 187 [2019-09-08 03:50:07,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:07,749 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 946 transitions. [2019-09-08 03:50:07,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:50:07,749 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 946 transitions. [2019-09-08 03:50:07,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-08 03:50:07,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:07,754 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, 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:50:07,754 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:07,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:07,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1376254513, now seen corresponding path program 1 times [2019-09-08 03:50:07,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:07,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:07,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:07,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:07,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:08,005 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:50:08,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:08,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:50:08,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:50:08,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:50:08,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:50:08,008 INFO L87 Difference]: Start difference. First operand 620 states and 946 transitions. Second operand 11 states. [2019-09-08 03:50:08,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:08,336 INFO L93 Difference]: Finished difference Result 1183 states and 1830 transitions. [2019-09-08 03:50:08,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:50:08,336 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 188 [2019-09-08 03:50:08,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:08,342 INFO L225 Difference]: With dead ends: 1183 [2019-09-08 03:50:08,342 INFO L226 Difference]: Without dead ends: 617 [2019-09-08 03:50:08,345 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:50:08,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-08 03:50:08,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-09-08 03:50:08,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-09-08 03:50:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 938 transitions. [2019-09-08 03:50:08,373 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 938 transitions. Word has length 188 [2019-09-08 03:50:08,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:08,374 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 938 transitions. [2019-09-08 03:50:08,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:50:08,374 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 938 transitions. [2019-09-08 03:50:08,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 03:50:08,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:08,382 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, 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:50:08,382 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:08,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:08,383 INFO L82 PathProgramCache]: Analyzing trace with hash -63325852, now seen corresponding path program 1 times [2019-09-08 03:50:08,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:08,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:08,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:08,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:08,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:08,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:08,607 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:50:08,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:50:08,608 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:50:08,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:09,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 3315 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:50:09,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:50:09,205 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:50:09,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:50:09,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 03:50:09,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:50:09,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:50:09,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:50:09,222 INFO L87 Difference]: Start difference. First operand 617 states and 938 transitions. Second operand 9 states. [2019-09-08 03:50:10,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:10,547 INFO L93 Difference]: Finished difference Result 1129 states and 1789 transitions. [2019-09-08 03:50:10,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:50:10,547 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 189 [2019-09-08 03:50:10,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:10,552 INFO L225 Difference]: With dead ends: 1129 [2019-09-08 03:50:10,552 INFO L226 Difference]: Without dead ends: 621 [2019-09-08 03:50:10,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:50:10,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-09-08 03:50:10,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-09-08 03:50:10,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-09-08 03:50:10,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 942 transitions. [2019-09-08 03:50:10,579 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 942 transitions. Word has length 189 [2019-09-08 03:50:10,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:10,584 INFO L475 AbstractCegarLoop]: Abstraction has 621 states and 942 transitions. [2019-09-08 03:50:10,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:50:10,585 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 942 transitions. [2019-09-08 03:50:10,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 03:50:10,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:10,588 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, 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:50:10,589 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:10,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:10,589 INFO L82 PathProgramCache]: Analyzing trace with hash -341143548, now seen corresponding path program 1 times [2019-09-08 03:50:10,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:10,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:10,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:10,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:10,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:10,762 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:50:10,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:50:10,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:50:10,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:50:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:11,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 3317 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:50:11,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:50:11,284 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:50:11,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:50:11,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 03:50:11,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:50:11,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:50:11,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:50:11,301 INFO L87 Difference]: Start difference. First operand 621 states and 942 transitions. Second operand 9 states. [2019-09-08 03:50:12,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:12,554 INFO L93 Difference]: Finished difference Result 1138 states and 1796 transitions. [2019-09-08 03:50:12,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:50:12,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 191 [2019-09-08 03:50:12,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:12,559 INFO L225 Difference]: With dead ends: 1138 [2019-09-08 03:50:12,559 INFO L226 Difference]: Without dead ends: 626 [2019-09-08 03:50:12,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:50:12,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-08 03:50:12,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-08 03:50:12,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 03:50:12,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 947 transitions. [2019-09-08 03:50:12,588 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 947 transitions. Word has length 191 [2019-09-08 03:50:12,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:12,589 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 947 transitions. [2019-09-08 03:50:12,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:50:12,589 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 947 transitions. [2019-09-08 03:50:12,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 03:50:12,592 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:12,592 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, 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:50:12,593 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:12,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:12,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1951912100, now seen corresponding path program 1 times [2019-09-08 03:50:12,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:12,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:12,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:12,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:12,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:12,727 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:50:12,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:50:12,728 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:50:12,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:13,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 3319 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:50:13,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:50:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Stream closed [2019-09-08 03:50:13,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:50:13,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 03:50:13,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:50:13,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:50:13,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:50:13,290 INFO L87 Difference]: Start difference. First operand 626 states and 947 transitions. Second operand 9 states. [2019-09-08 03:50:14,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:14,504 INFO L93 Difference]: Finished difference Result 1149 states and 1805 transitions. [2019-09-08 03:50:14,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:50:14,504 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 193 [2019-09-08 03:50:14,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:14,510 INFO L225 Difference]: With dead ends: 1149 [2019-09-08 03:50:14,510 INFO L226 Difference]: Without dead ends: 632 [2019-09-08 03:50:14,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:50:14,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-09-08 03:50:14,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-09-08 03:50:14,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-09-08 03:50:14,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 953 transitions. [2019-09-08 03:50:14,534 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 953 transitions. Word has length 193 [2019-09-08 03:50:14,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:14,534 INFO L475 AbstractCegarLoop]: Abstraction has 632 states and 953 transitions. [2019-09-08 03:50:14,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:50:14,535 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 953 transitions. [2019-09-08 03:50:14,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 03:50:14,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:14,538 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, 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:50:14,539 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:14,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:14,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1045392196, now seen corresponding path program 1 times [2019-09-08 03:50:14,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:14,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:14,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:14,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:14,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:50:14,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:50:14,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:50:14,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:15,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 3321 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:50:15,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:50:15,193 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:50:15,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:50:15,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 03:50:15,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:50:15,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:50:15,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:50:15,211 INFO L87 Difference]: Start difference. First operand 632 states and 953 transitions. Second operand 9 states. [2019-09-08 03:50:16,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:16,457 INFO L93 Difference]: Finished difference Result 1162 states and 1816 transitions. [2019-09-08 03:50:16,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:50:16,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2019-09-08 03:50:16,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:16,463 INFO L225 Difference]: With dead ends: 1162 [2019-09-08 03:50:16,463 INFO L226 Difference]: Without dead ends: 639 [2019-09-08 03:50:16,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:50:16,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-08 03:50:16,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-09-08 03:50:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 03:50:16,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 960 transitions. [2019-09-08 03:50:16,505 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 960 transitions. Word has length 195 [2019-09-08 03:50:16,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:16,506 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 960 transitions. [2019-09-08 03:50:16,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:50:16,506 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 960 transitions. [2019-09-08 03:50:16,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-08 03:50:16,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:16,510 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, 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:50:16,511 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:16,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:16,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1725880860, now seen corresponding path program 1 times [2019-09-08 03:50:16,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:16,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:16,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:16,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:16,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:16,731 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 03:50:16,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:50:16,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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:50:16,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:50:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:17,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 3323 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:50:17,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:50:17,361 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:50:17,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:50:17,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-08 03:50:17,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:50:17,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:50:17,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:50:17,370 INFO L87 Difference]: Start difference. First operand 639 states and 960 transitions. Second operand 14 states. [2019-09-08 03:50:27,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:27,830 INFO L93 Difference]: Finished difference Result 1827 states and 2858 transitions. [2019-09-08 03:50:27,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 03:50:27,831 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 197 [2019-09-08 03:50:27,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:27,842 INFO L225 Difference]: With dead ends: 1827 [2019-09-08 03:50:27,843 INFO L226 Difference]: Without dead ends: 1297 [2019-09-08 03:50:27,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 03:50:27,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2019-09-08 03:50:27,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1241. [2019-09-08 03:50:27,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2019-09-08 03:50:27,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1922 transitions. [2019-09-08 03:50:27,926 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1922 transitions. Word has length 197 [2019-09-08 03:50:27,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:27,926 INFO L475 AbstractCegarLoop]: Abstraction has 1241 states and 1922 transitions. [2019-09-08 03:50:27,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:50:27,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1922 transitions. [2019-09-08 03:50:27,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 03:50:27,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:27,935 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:50:27,936 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:27,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:27,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1187354950, now seen corresponding path program 1 times [2019-09-08 03:50:27,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:27,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:27,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:27,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:27,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:28,146 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:50:28,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:28,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:50:28,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:50:28,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:50:28,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:50:28,148 INFO L87 Difference]: Start difference. First operand 1241 states and 1922 transitions. Second operand 9 states. [2019-09-08 03:50:28,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:28,307 INFO L93 Difference]: Finished difference Result 1778 states and 2768 transitions. [2019-09-08 03:50:28,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:50:28,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 205 [2019-09-08 03:50:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:28,313 INFO L225 Difference]: With dead ends: 1778 [2019-09-08 03:50:28,313 INFO L226 Difference]: Without dead ends: 635 [2019-09-08 03:50:28,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:50:28,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-09-08 03:50:28,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-09-08 03:50:28,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-09-08 03:50:28,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 949 transitions. [2019-09-08 03:50:28,348 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 949 transitions. Word has length 205 [2019-09-08 03:50:28,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:28,348 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 949 transitions. [2019-09-08 03:50:28,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:50:28,348 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 949 transitions. [2019-09-08 03:50:28,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-08 03:50:28,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:28,352 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, 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:50:28,352 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:28,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:28,353 INFO L82 PathProgramCache]: Analyzing trace with hash 537020510, now seen corresponding path program 1 times [2019-09-08 03:50:28,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:28,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:28,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:28,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:28,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:28,608 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-08 03:50:28,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:50:28,609 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:50:28,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:29,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 3358 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 03:50:29,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:50:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:50:29,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:50:29,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-09-08 03:50:29,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:50:29,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:50:29,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:50:29,147 INFO L87 Difference]: Start difference. First operand 635 states and 949 transitions. Second operand 14 states. [2019-09-08 03:50:34,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:34,231 INFO L93 Difference]: Finished difference Result 1211 states and 1871 transitions. [2019-09-08 03:50:34,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 03:50:34,231 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 209 [2019-09-08 03:50:34,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:34,236 INFO L225 Difference]: With dead ends: 1211 [2019-09-08 03:50:34,236 INFO L226 Difference]: Without dead ends: 683 [2019-09-08 03:50:34,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-09-08 03:50:34,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-09-08 03:50:34,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 646. [2019-09-08 03:50:34,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-08 03:50:34,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 964 transitions. [2019-09-08 03:50:34,269 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 964 transitions. Word has length 209 [2019-09-08 03:50:34,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:34,269 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 964 transitions. [2019-09-08 03:50:34,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:50:34,269 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 964 transitions. [2019-09-08 03:50:34,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 03:50:34,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:34,273 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, 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:50:34,273 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:34,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:34,273 INFO L82 PathProgramCache]: Analyzing trace with hash 86984210, now seen corresponding path program 1 times [2019-09-08 03:50:34,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:34,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:34,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:34,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:34,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 03:50:34,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:34,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:50:34,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:50:34,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:50:34,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:50:34,462 INFO L87 Difference]: Start difference. First operand 646 states and 964 transitions. Second operand 11 states. [2019-09-08 03:50:38,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:38,715 INFO L93 Difference]: Finished difference Result 1183 states and 1816 transitions. [2019-09-08 03:50:38,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:50:38,716 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 216 [2019-09-08 03:50:38,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:38,721 INFO L225 Difference]: With dead ends: 1183 [2019-09-08 03:50:38,721 INFO L226 Difference]: Without dead ends: 644 [2019-09-08 03:50:38,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:50:38,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-09-08 03:50:38,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2019-09-08 03:50:38,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-09-08 03:50:38,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 960 transitions. [2019-09-08 03:50:38,752 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 960 transitions. Word has length 216 [2019-09-08 03:50:38,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:38,752 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 960 transitions. [2019-09-08 03:50:38,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:50:38,752 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 960 transitions. [2019-09-08 03:50:38,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-08 03:50:38,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:38,757 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, 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] [2019-09-08 03:50:38,757 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:38,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:38,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1717982349, now seen corresponding path program 1 times [2019-09-08 03:50:38,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:38,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:38,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:38,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:38,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 03:50:39,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:39,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:50:39,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:50:39,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:50:39,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:50:39,031 INFO L87 Difference]: Start difference. First operand 644 states and 960 transitions. Second operand 9 states. [2019-09-08 03:50:45,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:45,158 INFO L93 Difference]: Finished difference Result 1917 states and 2973 transitions. [2019-09-08 03:50:45,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 03:50:45,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 218 [2019-09-08 03:50:45,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:45,166 INFO L225 Difference]: With dead ends: 1917 [2019-09-08 03:50:45,167 INFO L226 Difference]: Without dead ends: 1380 [2019-09-08 03:50:45,170 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:50:45,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2019-09-08 03:50:45,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1336. [2019-09-08 03:50:45,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2019-09-08 03:50:45,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 2052 transitions. [2019-09-08 03:50:45,244 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 2052 transitions. Word has length 218 [2019-09-08 03:50:45,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:45,245 INFO L475 AbstractCegarLoop]: Abstraction has 1336 states and 2052 transitions. [2019-09-08 03:50:45,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:50:45,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 2052 transitions. [2019-09-08 03:50:45,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-08 03:50:45,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:45,252 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, 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:50:45,252 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:45,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:45,253 INFO L82 PathProgramCache]: Analyzing trace with hash -741242040, now seen corresponding path program 1 times [2019-09-08 03:50:45,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:45,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:45,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:45,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:45,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:45,467 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 03:50:45,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:45,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:50:45,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:50:45,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:50:45,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:50:45,468 INFO L87 Difference]: Start difference. First operand 1336 states and 2052 transitions. Second operand 7 states. [2019-09-08 03:50:45,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:45,574 INFO L93 Difference]: Finished difference Result 2608 states and 4053 transitions. [2019-09-08 03:50:45,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:50:45,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 223 [2019-09-08 03:50:45,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:45,584 INFO L225 Difference]: With dead ends: 2608 [2019-09-08 03:50:45,584 INFO L226 Difference]: Without dead ends: 1379 [2019-09-08 03:50:45,589 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:50:45,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2019-09-08 03:50:45,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1357. [2019-09-08 03:50:45,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1357 states. [2019-09-08 03:50:45,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 2076 transitions. [2019-09-08 03:50:45,651 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 2076 transitions. Word has length 223 [2019-09-08 03:50:45,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:45,652 INFO L475 AbstractCegarLoop]: Abstraction has 1357 states and 2076 transitions. [2019-09-08 03:50:45,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:50:45,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 2076 transitions. [2019-09-08 03:50:45,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-08 03:50:45,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:45,656 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, 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] [2019-09-08 03:50:45,656 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:45,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:45,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1362499568, now seen corresponding path program 1 times [2019-09-08 03:50:45,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:45,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:45,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:45,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:45,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:45,874 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 03:50:45,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:45,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 03:50:45,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:50:45,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:50:45,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:50:45,877 INFO L87 Difference]: Start difference. First operand 1357 states and 2076 transitions. Second operand 8 states. [2019-09-08 03:50:49,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:49,925 INFO L93 Difference]: Finished difference Result 4233 states and 6638 transitions. [2019-09-08 03:50:49,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:50:49,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 227 [2019-09-08 03:50:49,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:49,942 INFO L225 Difference]: With dead ends: 4233 [2019-09-08 03:50:49,942 INFO L226 Difference]: Without dead ends: 2981 [2019-09-08 03:50:49,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 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:50:49,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2019-09-08 03:50:50,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2944. [2019-09-08 03:50:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2944 states. [2019-09-08 03:50:50,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 4547 transitions. [2019-09-08 03:50:50,128 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 4547 transitions. Word has length 227 [2019-09-08 03:50:50,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:50,129 INFO L475 AbstractCegarLoop]: Abstraction has 2944 states and 4547 transitions. [2019-09-08 03:50:50,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:50:50,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 4547 transitions. [2019-09-08 03:50:50,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 03:50:50,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:50,137 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:50:50,137 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:50,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:50,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1473790793, now seen corresponding path program 1 times [2019-09-08 03:50:50,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:50,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:50,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:50,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:50,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:50,302 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 03:50:50,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:50,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:50:50,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:50:50,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:50:50,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:50:50,303 INFO L87 Difference]: Start difference. First operand 2944 states and 4547 transitions. Second operand 9 states. [2019-09-08 03:50:50,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:50,623 INFO L93 Difference]: Finished difference Result 5705 states and 8993 transitions. [2019-09-08 03:50:50,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:50:50,624 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 230 [2019-09-08 03:50:50,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:50,644 INFO L225 Difference]: With dead ends: 5705 [2019-09-08 03:50:50,644 INFO L226 Difference]: Without dead ends: 2944 [2019-09-08 03:50:50,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:50:50,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2019-09-08 03:50:50,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2944. [2019-09-08 03:50:50,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2944 states. [2019-09-08 03:50:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 4501 transitions. [2019-09-08 03:50:50,793 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 4501 transitions. Word has length 230 [2019-09-08 03:50:50,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:50,794 INFO L475 AbstractCegarLoop]: Abstraction has 2944 states and 4501 transitions. [2019-09-08 03:50:50,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:50:50,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 4501 transitions. [2019-09-08 03:50:50,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-08 03:50:50,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:50,798 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:50:50,798 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:50,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:50,799 INFO L82 PathProgramCache]: Analyzing trace with hash -482068595, now seen corresponding path program 1 times [2019-09-08 03:50:50,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:50,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:50,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:50,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:50,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:50,958 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-08 03:50:50,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:50,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:50:50,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:50:50,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:50:50,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:50:50,961 INFO L87 Difference]: Start difference. First operand 2944 states and 4501 transitions. Second operand 7 states. [2019-09-08 03:50:54,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:54,952 INFO L93 Difference]: Finished difference Result 5501 states and 8472 transitions. [2019-09-08 03:50:54,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:50:54,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 235 [2019-09-08 03:50:54,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:54,967 INFO L225 Difference]: With dead ends: 5501 [2019-09-08 03:50:54,967 INFO L226 Difference]: Without dead ends: 3127 [2019-09-08 03:50:54,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:50:54,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2019-09-08 03:50:55,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 3060. [2019-09-08 03:50:55,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3060 states. [2019-09-08 03:50:55,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 3060 states and 4658 transitions. [2019-09-08 03:50:55,103 INFO L78 Accepts]: Start accepts. Automaton has 3060 states and 4658 transitions. Word has length 235 [2019-09-08 03:50:55,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:55,104 INFO L475 AbstractCegarLoop]: Abstraction has 3060 states and 4658 transitions. [2019-09-08 03:50:55,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:50:55,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3060 states and 4658 transitions. [2019-09-08 03:50:55,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 03:50:55,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:55,109 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:50:55,109 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:55,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:55,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1868442518, now seen corresponding path program 1 times [2019-09-08 03:50:55,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:55,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:55,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:55,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:55,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:55,239 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 03:50:55,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:55,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:50:55,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:50:55,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:50:55,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:50:55,240 INFO L87 Difference]: Start difference. First operand 3060 states and 4658 transitions. Second operand 6 states. [2019-09-08 03:50:55,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:55,422 INFO L93 Difference]: Finished difference Result 6476 states and 9932 transitions. [2019-09-08 03:50:55,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:50:55,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-08 03:50:55,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:55,443 INFO L225 Difference]: With dead ends: 6476 [2019-09-08 03:50:55,443 INFO L226 Difference]: Without dead ends: 3986 [2019-09-08 03:50:55,451 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:50:55,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2019-09-08 03:50:55,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3688. [2019-09-08 03:50:55,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3688 states. [2019-09-08 03:50:55,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3688 states to 3688 states and 5616 transitions. [2019-09-08 03:50:55,607 INFO L78 Accepts]: Start accepts. Automaton has 3688 states and 5616 transitions. Word has length 240 [2019-09-08 03:50:55,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:55,608 INFO L475 AbstractCegarLoop]: Abstraction has 3688 states and 5616 transitions. [2019-09-08 03:50:55,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:50:55,608 INFO L276 IsEmpty]: Start isEmpty. Operand 3688 states and 5616 transitions. [2019-09-08 03:50:55,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 03:50:55,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:55,612 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:50:55,612 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:55,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:55,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1766993256, now seen corresponding path program 1 times [2019-09-08 03:50:55,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:55,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:55,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:55,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:55,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:55,761 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 03:50:55,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:55,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 03:50:55,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:50:55,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:50:55,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:50:55,762 INFO L87 Difference]: Start difference. First operand 3688 states and 5616 transitions. Second operand 8 states. [2019-09-08 03:50:55,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:55,892 INFO L93 Difference]: Finished difference Result 3711 states and 5645 transitions. [2019-09-08 03:50:55,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:50:55,893 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 240 [2019-09-08 03:50:55,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:55,912 INFO L225 Difference]: With dead ends: 3711 [2019-09-08 03:50:55,912 INFO L226 Difference]: Without dead ends: 3694 [2019-09-08 03:50:55,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:50:55,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3694 states. [2019-09-08 03:50:56,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3694 to 3688. [2019-09-08 03:50:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3688 states. [2019-09-08 03:50:56,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3688 states to 3688 states and 5610 transitions. [2019-09-08 03:50:56,070 INFO L78 Accepts]: Start accepts. Automaton has 3688 states and 5610 transitions. Word has length 240 [2019-09-08 03:50:56,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:56,070 INFO L475 AbstractCegarLoop]: Abstraction has 3688 states and 5610 transitions. [2019-09-08 03:50:56,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:50:56,071 INFO L276 IsEmpty]: Start isEmpty. Operand 3688 states and 5610 transitions. [2019-09-08 03:50:56,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-08 03:50:56,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:56,077 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:50:56,077 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:56,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:56,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1437701728, now seen corresponding path program 1 times [2019-09-08 03:50:56,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:56,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:56,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:56,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:56,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:56,294 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-08 03:50:56,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:56,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:50:56,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:50:56,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:50:56,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:50:56,297 INFO L87 Difference]: Start difference. First operand 3688 states and 5610 transitions. Second operand 9 states. [2019-09-08 03:50:59,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:59,626 INFO L93 Difference]: Finished difference Result 7263 states and 11116 transitions. [2019-09-08 03:50:59,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:50:59,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 258 [2019-09-08 03:50:59,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:59,647 INFO L225 Difference]: With dead ends: 7263 [2019-09-08 03:50:59,647 INFO L226 Difference]: Without dead ends: 3694 [2019-09-08 03:50:59,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:50:59,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3694 states. [2019-09-08 03:50:59,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3694 to 3688. [2019-09-08 03:50:59,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3688 states. [2019-09-08 03:50:59,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3688 states to 3688 states and 5604 transitions. [2019-09-08 03:50:59,816 INFO L78 Accepts]: Start accepts. Automaton has 3688 states and 5604 transitions. Word has length 258 [2019-09-08 03:50:59,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:59,816 INFO L475 AbstractCegarLoop]: Abstraction has 3688 states and 5604 transitions. [2019-09-08 03:50:59,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:50:59,817 INFO L276 IsEmpty]: Start isEmpty. Operand 3688 states and 5604 transitions. [2019-09-08 03:50:59,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-08 03:50:59,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:59,821 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:50:59,821 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:59,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:59,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1767697878, now seen corresponding path program 1 times [2019-09-08 03:50:59,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:59,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:59,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:59,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:59,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:59,962 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-08 03:50:59,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:50:59,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:50:59,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:50:59,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:50:59,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:50:59,963 INFO L87 Difference]: Start difference. First operand 3688 states and 5604 transitions. Second operand 6 states. [2019-09-08 03:51:03,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:03,600 INFO L93 Difference]: Finished difference Result 11450 states and 17925 transitions. [2019-09-08 03:51:03,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:51:03,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 259 [2019-09-08 03:51:03,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:03,636 INFO L225 Difference]: With dead ends: 11450 [2019-09-08 03:51:03,636 INFO L226 Difference]: Without dead ends: 7881 [2019-09-08 03:51:03,647 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:51:03,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7881 states. [2019-09-08 03:51:03,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7881 to 7478. [2019-09-08 03:51:03,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7478 states. [2019-09-08 03:51:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7478 states to 7478 states and 11440 transitions. [2019-09-08 03:51:04,018 INFO L78 Accepts]: Start accepts. Automaton has 7478 states and 11440 transitions. Word has length 259 [2019-09-08 03:51:04,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:04,018 INFO L475 AbstractCegarLoop]: Abstraction has 7478 states and 11440 transitions. [2019-09-08 03:51:04,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:51:04,019 INFO L276 IsEmpty]: Start isEmpty. Operand 7478 states and 11440 transitions. [2019-09-08 03:51:04,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 03:51:04,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:04,026 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:51:04,026 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:04,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:04,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1619443625, now seen corresponding path program 1 times [2019-09-08 03:51:04,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:04,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:04,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:04,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:04,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:04,202 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 03:51:04,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:51:04,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:51:04,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:51:04,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:51:04,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:51:04,204 INFO L87 Difference]: Start difference. First operand 7478 states and 11440 transitions. Second operand 4 states. [2019-09-08 03:51:04,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:04,975 INFO L93 Difference]: Finished difference Result 14806 states and 22843 transitions. [2019-09-08 03:51:04,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:51:04,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2019-09-08 03:51:04,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:05,009 INFO L225 Difference]: With dead ends: 14806 [2019-09-08 03:51:05,009 INFO L226 Difference]: Without dead ends: 7435 [2019-09-08 03:51:05,030 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:51:05,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2019-09-08 03:51:05,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 7435. [2019-09-08 03:51:05,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7435 states. [2019-09-08 03:51:05,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7435 states to 7435 states and 11354 transitions. [2019-09-08 03:51:05,417 INFO L78 Accepts]: Start accepts. Automaton has 7435 states and 11354 transitions. Word has length 267 [2019-09-08 03:51:05,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:05,417 INFO L475 AbstractCegarLoop]: Abstraction has 7435 states and 11354 transitions. [2019-09-08 03:51:05,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:51:05,418 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 11354 transitions. [2019-09-08 03:51:05,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-08 03:51:05,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:05,424 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:51:05,424 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:05,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:05,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1336563001, now seen corresponding path program 1 times [2019-09-08 03:51:05,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:05,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:05,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:05,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:05,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-08 03:51:05,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:51:05,770 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:51:05,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:06,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 3524 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 03:51:06,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:51:06,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:51:06,383 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 03:51:06,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:51:06,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2019-09-08 03:51:06,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 03:51:06,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 03:51:06,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-09-08 03:51:06,391 INFO L87 Difference]: Start difference. First operand 7435 states and 11354 transitions. Second operand 18 states. [2019-09-08 03:51:16,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:16,440 INFO L93 Difference]: Finished difference Result 14940 states and 22832 transitions. [2019-09-08 03:51:16,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 03:51:16,440 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 268 [2019-09-08 03:51:16,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:16,474 INFO L225 Difference]: With dead ends: 14940 [2019-09-08 03:51:16,475 INFO L226 Difference]: Without dead ends: 7612 [2019-09-08 03:51:16,495 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=1723, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 03:51:16,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7612 states. [2019-09-08 03:51:16,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7612 to 7545. [2019-09-08 03:51:16,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7545 states. [2019-09-08 03:51:16,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7545 states to 7545 states and 11444 transitions. [2019-09-08 03:51:16,848 INFO L78 Accepts]: Start accepts. Automaton has 7545 states and 11444 transitions. Word has length 268 [2019-09-08 03:51:16,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:16,849 INFO L475 AbstractCegarLoop]: Abstraction has 7545 states and 11444 transitions. [2019-09-08 03:51:16,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 03:51:16,849 INFO L276 IsEmpty]: Start isEmpty. Operand 7545 states and 11444 transitions. [2019-09-08 03:51:16,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-09-08 03:51:16,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:16,856 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:16,856 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:16,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:16,856 INFO L82 PathProgramCache]: Analyzing trace with hash -519368920, now seen corresponding path program 1 times [2019-09-08 03:51:16,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:16,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:16,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:16,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:16,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-09-08 03:51:17,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:51:17,192 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:51:17,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:17,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 4338 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:51:17,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:51:17,978 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-09-08 03:51:17,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:51:17,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2019-09-08 03:51:17,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:51:17,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:51:17,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:51:17,989 INFO L87 Difference]: Start difference. First operand 7545 states and 11444 transitions. Second operand 11 states. [2019-09-08 03:51:26,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:26,425 INFO L93 Difference]: Finished difference Result 15921 states and 24758 transitions. [2019-09-08 03:51:26,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 03:51:26,425 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 399 [2019-09-08 03:51:26,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:26,452 INFO L225 Difference]: With dead ends: 15921 [2019-09-08 03:51:26,453 INFO L226 Difference]: Without dead ends: 8487 [2019-09-08 03:51:26,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-09-08 03:51:26,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8487 states. [2019-09-08 03:51:26,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8487 to 8061. [2019-09-08 03:51:26,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8061 states. [2019-09-08 03:51:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8061 states to 8061 states and 12368 transitions. [2019-09-08 03:51:26,846 INFO L78 Accepts]: Start accepts. Automaton has 8061 states and 12368 transitions. Word has length 399 [2019-09-08 03:51:26,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:26,847 INFO L475 AbstractCegarLoop]: Abstraction has 8061 states and 12368 transitions. [2019-09-08 03:51:26,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:51:26,847 INFO L276 IsEmpty]: Start isEmpty. Operand 8061 states and 12368 transitions. [2019-09-08 03:51:26,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 03:51:26,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:26,851 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 7, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:51:26,852 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:26,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:26,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1397126011, now seen corresponding path program 1 times [2019-09-08 03:51:26,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:26,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:26,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:26,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:26,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:27,047 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-08 03:51:27,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:51:27,047 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:51:27,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:27,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 3605 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 03:51:27,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:51:28,395 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 108 proven. 10 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-08 03:51:28,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:51:28,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-09-08 03:51:28,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 03:51:28,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 03:51:28,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:51:28,403 INFO L87 Difference]: Start difference. First operand 8061 states and 12368 transitions. Second operand 19 states. [2019-09-08 03:51:39,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:39,247 INFO L93 Difference]: Finished difference Result 24817 states and 38499 transitions. [2019-09-08 03:51:39,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 03:51:39,247 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 302 [2019-09-08 03:51:39,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:39,306 INFO L225 Difference]: With dead ends: 24817 [2019-09-08 03:51:39,306 INFO L226 Difference]: Without dead ends: 16873 [2019-09-08 03:51:39,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2019-09-08 03:51:39,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16873 states. [2019-09-08 03:51:39,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16873 to 16841. [2019-09-08 03:51:39,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16841 states. [2019-09-08 03:51:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16841 states to 16841 states and 26161 transitions. [2019-09-08 03:51:39,959 INFO L78 Accepts]: Start accepts. Automaton has 16841 states and 26161 transitions. Word has length 302 [2019-09-08 03:51:39,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:39,960 INFO L475 AbstractCegarLoop]: Abstraction has 16841 states and 26161 transitions. [2019-09-08 03:51:39,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 03:51:39,960 INFO L276 IsEmpty]: Start isEmpty. Operand 16841 states and 26161 transitions. [2019-09-08 03:51:39,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-09-08 03:51:39,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:39,968 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:39,968 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:39,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:39,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1426278672, now seen corresponding path program 1 times [2019-09-08 03:51:39,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:39,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:39,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:39,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:39,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:40,282 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2019-09-08 03:51:40,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:51:40,282 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:51:40,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:51:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:40,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 4344 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:51:40,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:51:40,999 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-09-08 03:51:41,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:51:41,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-09-08 03:51:41,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:51:41,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:51:41,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:51:41,008 INFO L87 Difference]: Start difference. First operand 16841 states and 26161 transitions. Second operand 9 states. [2019-09-08 03:51:41,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:41,940 INFO L93 Difference]: Finished difference Result 34519 states and 54316 transitions. [2019-09-08 03:51:41,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:51:41,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 404 [2019-09-08 03:51:41,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:42,013 INFO L225 Difference]: With dead ends: 34519 [2019-09-08 03:51:42,013 INFO L226 Difference]: Without dead ends: 17789 [2019-09-08 03:51:42,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:51:42,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17789 states. [2019-09-08 03:51:42,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17789 to 17777. [2019-09-08 03:51:42,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17777 states. [2019-09-08 03:51:42,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17777 states to 17777 states and 27889 transitions. [2019-09-08 03:51:42,918 INFO L78 Accepts]: Start accepts. Automaton has 17777 states and 27889 transitions. Word has length 404 [2019-09-08 03:51:42,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:42,919 INFO L475 AbstractCegarLoop]: Abstraction has 17777 states and 27889 transitions. [2019-09-08 03:51:42,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:51:42,919 INFO L276 IsEmpty]: Start isEmpty. Operand 17777 states and 27889 transitions. [2019-09-08 03:51:42,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-09-08 03:51:42,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:42,929 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:42,929 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:42,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:42,929 INFO L82 PathProgramCache]: Analyzing trace with hash 2009380703, now seen corresponding path program 1 times [2019-09-08 03:51:42,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:42,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:42,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:42,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:42,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:43,236 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2019-09-08 03:51:43,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:51:43,236 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:51:43,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:51:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:43,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 4348 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 03:51:43,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:51:44,006 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-09-08 03:51:44,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:51:44,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-08 03:51:44,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:51:44,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:51:44,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:51:44,014 INFO L87 Difference]: Start difference. First operand 17777 states and 27889 transitions. Second operand 15 states. [2019-09-08 03:51:58,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:58,152 INFO L93 Difference]: Finished difference Result 57917 states and 94013 transitions. [2019-09-08 03:51:58,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 03:51:58,152 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 409 [2019-09-08 03:51:58,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:58,349 INFO L225 Difference]: With dead ends: 57917 [2019-09-08 03:51:58,350 INFO L226 Difference]: Without dead ends: 40199 [2019-09-08 03:51:58,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=407, Invalid=1573, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 03:51:58,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40199 states. [2019-09-08 03:51:59,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40199 to 39815. [2019-09-08 03:51:59,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39815 states. [2019-09-08 03:52:00,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39815 states to 39815 states and 63136 transitions. [2019-09-08 03:52:00,056 INFO L78 Accepts]: Start accepts. Automaton has 39815 states and 63136 transitions. Word has length 409 [2019-09-08 03:52:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:52:00,057 INFO L475 AbstractCegarLoop]: Abstraction has 39815 states and 63136 transitions. [2019-09-08 03:52:00,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:52:00,057 INFO L276 IsEmpty]: Start isEmpty. Operand 39815 states and 63136 transitions. [2019-09-08 03:52:00,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-08 03:52:00,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:52:00,062 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:52:00,062 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:52:00,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:52:00,062 INFO L82 PathProgramCache]: Analyzing trace with hash -602922725, now seen corresponding path program 1 times [2019-09-08 03:52:00,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:52:00,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:52:00,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:00,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:00,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 47 proven. 3 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2019-09-08 03:52:00,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:52:00,271 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:52:00,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:52:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:00,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 4072 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 03:52:00,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:52:00,899 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-09-08 03:52:00,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:52:00,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-09-08 03:52:00,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:52:00,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:52:00,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:52:00,908 INFO L87 Difference]: Start difference. First operand 39815 states and 63136 transitions. Second operand 8 states. [2019-09-08 03:52:04,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:52:04,479 INFO L93 Difference]: Finished difference Result 90479 states and 145128 transitions. [2019-09-08 03:52:04,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 03:52:04,479 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 387 [2019-09-08 03:52:04,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:52:04,678 INFO L225 Difference]: With dead ends: 90479 [2019-09-08 03:52:04,678 INFO L226 Difference]: Without dead ends: 50226 [2019-09-08 03:52:04,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 392 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2019-09-08 03:52:04,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50226 states. [2019-09-08 03:52:08,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50226 to 50018. [2019-09-08 03:52:08,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50018 states. [2019-09-08 03:52:08,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50018 states to 50018 states and 78689 transitions. [2019-09-08 03:52:08,892 INFO L78 Accepts]: Start accepts. Automaton has 50018 states and 78689 transitions. Word has length 387 [2019-09-08 03:52:08,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:52:08,893 INFO L475 AbstractCegarLoop]: Abstraction has 50018 states and 78689 transitions. [2019-09-08 03:52:08,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:52:08,893 INFO L276 IsEmpty]: Start isEmpty. Operand 50018 states and 78689 transitions. [2019-09-08 03:52:08,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-09-08 03:52:08,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:52:08,900 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:52:08,900 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:52:08,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:52:08,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1767070651, now seen corresponding path program 1 times [2019-09-08 03:52:08,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:52:08,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:52:08,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:08,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:08,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:09,188 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 32 proven. 19 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2019-09-08 03:52:09,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:52:09,188 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:52:09,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:09,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 4075 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 03:52:09,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:52:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:52:09,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:52:09,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2019-09-08 03:52:09,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:52:09,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:52:09,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:52:09,812 INFO L87 Difference]: Start difference. First operand 50018 states and 78689 transitions. Second operand 13 states. [2019-09-08 03:52:27,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:52:27,585 INFO L93 Difference]: Finished difference Result 104538 states and 166079 transitions. [2019-09-08 03:52:27,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 03:52:27,585 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 390 [2019-09-08 03:52:27,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:52:27,867 INFO L225 Difference]: With dead ends: 104538 [2019-09-08 03:52:27,868 INFO L226 Difference]: Without dead ends: 54752 [2019-09-08 03:52:27,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 413 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=1010, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 03:52:28,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54752 states. [2019-09-08 03:52:30,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54752 to 54424. [2019-09-08 03:52:30,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54424 states. [2019-09-08 03:52:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54424 states to 54424 states and 85584 transitions. [2019-09-08 03:52:30,446 INFO L78 Accepts]: Start accepts. Automaton has 54424 states and 85584 transitions. Word has length 390 [2019-09-08 03:52:30,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:52:30,447 INFO L475 AbstractCegarLoop]: Abstraction has 54424 states and 85584 transitions. [2019-09-08 03:52:30,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:52:30,447 INFO L276 IsEmpty]: Start isEmpty. Operand 54424 states and 85584 transitions. [2019-09-08 03:52:30,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-09-08 03:52:30,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:52:30,452 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:52:30,452 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:52:30,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:52:30,453 INFO L82 PathProgramCache]: Analyzing trace with hash 651564821, now seen corresponding path program 1 times [2019-09-08 03:52:30,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:52:30,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:52:30,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:30,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:30,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:30,706 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 28 proven. 15 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2019-09-08 03:52:30,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:52:30,706 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:52:30,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:31,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 4078 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 03:52:31,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:52:31,373 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-08 03:52:31,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:52:31,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2019-09-08 03:52:31,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:52:31,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:52:31,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:52:31,381 INFO L87 Difference]: Start difference. First operand 54424 states and 85584 transitions. Second operand 13 states. [2019-09-08 03:52:53,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:52:53,421 INFO L93 Difference]: Finished difference Result 181016 states and 290772 transitions. [2019-09-08 03:52:53,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 03:52:53,421 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 393 [2019-09-08 03:52:53,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:52:54,135 INFO L225 Difference]: With dead ends: 181016 [2019-09-08 03:52:54,135 INFO L226 Difference]: Without dead ends: 126792 [2019-09-08 03:52:54,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 410 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=1010, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 03:52:54,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126792 states. [2019-09-08 03:53:03,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126792 to 125860. [2019-09-08 03:53:03,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125860 states. [2019-09-08 03:53:03,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125860 states to 125860 states and 200633 transitions. [2019-09-08 03:53:03,984 INFO L78 Accepts]: Start accepts. Automaton has 125860 states and 200633 transitions. Word has length 393 [2019-09-08 03:53:03,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:03,985 INFO L475 AbstractCegarLoop]: Abstraction has 125860 states and 200633 transitions. [2019-09-08 03:53:03,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:53:03,985 INFO L276 IsEmpty]: Start isEmpty. Operand 125860 states and 200633 transitions. [2019-09-08 03:53:03,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2019-09-08 03:53:03,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:03,992 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 9, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:03,992 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:03,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:03,993 INFO L82 PathProgramCache]: Analyzing trace with hash 441194787, now seen corresponding path program 1 times [2019-09-08 03:53:03,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:03,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:03,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:03,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:03,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:04,289 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 57 proven. 17 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-09-08 03:53:04,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:53:04,290 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:53:04,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:04,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 4223 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:53:04,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:53:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 51 proven. 200 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-09-08 03:53:05,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:53:05,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-08 03:53:05,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:53:05,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:53:05,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:53:05,090 INFO L87 Difference]: Start difference. First operand 125860 states and 200633 transitions. Second operand 10 states. [2019-09-08 03:53:31,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:31,614 INFO L93 Difference]: Finished difference Result 386016 states and 636432 transitions. [2019-09-08 03:53:31,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 03:53:31,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 437 [2019-09-08 03:53:31,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:32,856 INFO L225 Difference]: With dead ends: 386016 [2019-09-08 03:53:32,856 INFO L226 Difference]: Without dead ends: 259054 [2019-09-08 03:53:33,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=1022, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 03:53:33,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259054 states. [2019-09-08 03:53:48,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259054 to 251696. [2019-09-08 03:53:48,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251696 states. [2019-09-08 03:53:49,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251696 states to 251696 states and 404212 transitions. [2019-09-08 03:53:49,977 INFO L78 Accepts]: Start accepts. Automaton has 251696 states and 404212 transitions. Word has length 437 [2019-09-08 03:53:49,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:49,978 INFO L475 AbstractCegarLoop]: Abstraction has 251696 states and 404212 transitions. [2019-09-08 03:53:49,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:53:49,978 INFO L276 IsEmpty]: Start isEmpty. Operand 251696 states and 404212 transitions. [2019-09-08 03:53:49,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-09-08 03:53:50,000 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:50,000 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 8, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:50,001 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:50,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:50,001 INFO L82 PathProgramCache]: Analyzing trace with hash 906562567, now seen corresponding path program 1 times [2019-09-08 03:53:50,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:50,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:50,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:50,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:50,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:50,205 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 58 proven. 11 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2019-09-08 03:53:50,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:53:50,206 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:53:50,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:56,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 4093 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:53:56,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:53:56,364 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 219 proven. 6 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-09-08 03:53:56,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:53:56,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-08 03:53:56,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:53:56,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:53:56,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:53:56,372 INFO L87 Difference]: Start difference. First operand 251696 states and 404212 transitions. Second operand 10 states. [2019-09-08 03:54:25,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:25,864 INFO L93 Difference]: Finished difference Result 635994 states and 1069578 transitions. [2019-09-08 03:54:25,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 03:54:25,865 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 398 [2019-09-08 03:54:25,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:27,890 INFO L225 Difference]: With dead ends: 635994 [2019-09-08 03:54:27,890 INFO L226 Difference]: Without dead ends: 382591 [2019-09-08 03:54:28,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 409 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2019-09-08 03:54:29,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382591 states. [2019-09-08 03:54:54,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382591 to 374848. [2019-09-08 03:54:54,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374848 states. [2019-09-08 03:54:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374848 states to 374848 states and 610064 transitions. [2019-09-08 03:54:58,968 INFO L78 Accepts]: Start accepts. Automaton has 374848 states and 610064 transitions. Word has length 398 [2019-09-08 03:54:58,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:58,969 INFO L475 AbstractCegarLoop]: Abstraction has 374848 states and 610064 transitions. [2019-09-08 03:54:58,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:54:58,969 INFO L276 IsEmpty]: Start isEmpty. Operand 374848 states and 610064 transitions. [2019-09-08 03:54:59,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2019-09-08 03:54:59,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:59,006 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:54:59,006 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:59,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:59,007 INFO L82 PathProgramCache]: Analyzing trace with hash -56623928, now seen corresponding path program 1 times [2019-09-08 03:54:59,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:59,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:59,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:59,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:59,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:59,324 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 48 proven. 26 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-09-08 03:54:59,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:59,325 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:54:59,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:59,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 4193 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 03:54:59,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:55:00,143 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 84 proven. 113 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-09-08 03:55:00,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:55:00,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2019-09-08 03:55:00,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 03:55:00,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 03:55:00,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:55:00,151 INFO L87 Difference]: Start difference. First operand 374848 states and 610064 transitions. Second operand 19 states. [2019-09-08 03:56:28,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:56:28,091 INFO L93 Difference]: Finished difference Result 1079910 states and 1909306 transitions. [2019-09-08 03:56:28,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-09-08 03:56:28,091 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 424 [2019-09-08 03:56:28,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:56:32,897 INFO L225 Difference]: With dead ends: 1079910 [2019-09-08 03:56:32,897 INFO L226 Difference]: Without dead ends: 688559 [2019-09-08 03:56:35,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 472 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2452 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1428, Invalid=6228, Unknown=0, NotChecked=0, Total=7656 [2019-09-08 03:56:36,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688559 states. [2019-09-08 03:57:42,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688559 to 674773. [2019-09-08 03:57:42,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674773 states. [2019-09-08 03:58:03,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674773 states to 674773 states and 1109998 transitions. [2019-09-08 03:58:03,276 INFO L78 Accepts]: Start accepts. Automaton has 674773 states and 1109998 transitions. Word has length 424 [2019-09-08 03:58:03,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:58:03,276 INFO L475 AbstractCegarLoop]: Abstraction has 674773 states and 1109998 transitions. [2019-09-08 03:58:03,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 03:58:03,277 INFO L276 IsEmpty]: Start isEmpty. Operand 674773 states and 1109998 transitions. [2019-09-08 03:58:03,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-09-08 03:58:03,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:58:03,298 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 8, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,298 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:58:03,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:58:03,299 INFO L82 PathProgramCache]: Analyzing trace with hash 486037569, now seen corresponding path program 1 times [2019-09-08 03:58:03,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:58:03,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:58:03,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:58:03,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:58:03,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:58:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:58:03,568 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2019-09-08 03:58:03,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:58:03,568 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:58:03,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:58:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:58:04,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 4094 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:58:04,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:58:06,562 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-09-08 03:58:06,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:58:06,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 03:58:06,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:58:06,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:58:06,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:58:06,571 INFO L87 Difference]: Start difference. First operand 674773 states and 1109998 transitions. Second operand 8 states.