java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec1_product29.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:10:24,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:10:24,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:10:24,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:10:24,878 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:10:24,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:10:24,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:10:24,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:10:24,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:10:24,885 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:10:24,886 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:10:24,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:10:24,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:10:24,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:10:24,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:10:24,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:10:24,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:10:24,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:10:24,895 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:10:24,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:10:24,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:10:24,900 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:10:24,901 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:10:24,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:10:24,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:10:24,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:10:24,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:10:24,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:10:24,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:10:24,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:10:24,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:10:24,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:10:24,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:10:24,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:10:24,922 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:10:24,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:10:24,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:10:24,924 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:10:24,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:10:24,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:10:24,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:10:24,930 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 12:10:24,958 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:10:24,958 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:10:24,959 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:10:24,959 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:10:24,960 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:10:24,960 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:10:24,960 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:10:24,960 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:10:24,960 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:10:24,961 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:10:24,961 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:10:24,961 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:10:24,961 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:10:24,961 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:10:24,962 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:10:24,962 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:10:24,962 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:10:24,962 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:10:24,963 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:10:24,963 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:10:24,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:10:24,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:10:24,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:10:24,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:10:24,964 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:10:24,964 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:10:24,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:10:24,964 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:10:24,965 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:10:25,008 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:10:25,020 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:10:25,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:10:25,025 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:10:25,025 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:10:25,026 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product29.cil.c [2019-10-02 12:10:25,107 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df6d718e/f998040326174cdba6e431bc328cb063/FLAG629b14744 [2019-10-02 12:10:25,722 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:10:25,723 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product29.cil.c [2019-10-02 12:10:25,744 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df6d718e/f998040326174cdba6e431bc328cb063/FLAG629b14744 [2019-10-02 12:10:25,944 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df6d718e/f998040326174cdba6e431bc328cb063 [2019-10-02 12:10:25,955 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:10:25,957 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:10:25,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:10:25,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:10:25,963 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:10:25,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:10:25" (1/1) ... [2019-10-02 12:10:25,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@103d845f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:10:25, skipping insertion in model container [2019-10-02 12:10:25,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:10:25" (1/1) ... [2019-10-02 12:10:25,975 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:10:26,063 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:10:26,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:10:26,845 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:10:26,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:10:27,060 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:10:27,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:10:27 WrapperNode [2019-10-02 12:10:27,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:10:27,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:10:27,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:10:27,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:10:27,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:10:27" (1/1) ... [2019-10-02 12:10:27,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:10:27" (1/1) ... [2019-10-02 12:10:27,114 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:10:27" (1/1) ... [2019-10-02 12:10:27,114 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:10:27" (1/1) ... [2019-10-02 12:10:27,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:10:27" (1/1) ... [2019-10-02 12:10:27,249 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:10:27" (1/1) ... [2019-10-02 12:10:27,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:10:27" (1/1) ... [2019-10-02 12:10:27,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:10:27,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:10:27,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:10:27,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:10:27,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:10:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:10:27,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:10:27,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:10:27,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:10:27,360 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:10:27,361 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:10:27,361 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:10:27,361 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:10:27,361 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:10:27,361 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:10:27,362 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:10:27,362 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:10:27,362 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:10:27,363 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:10:27,363 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:10:27,364 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:10:27,364 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:10:27,366 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:10:27,366 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:10:27,366 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:10:27,366 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:10:27,367 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:10:27,367 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:10:27,367 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:10:27,367 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:10:27,368 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:10:27,368 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:10:27,368 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:10:27,368 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:10:27,368 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:10:27,368 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:10:27,368 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:10:27,369 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:10:27,369 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:10:27,369 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:10:27,369 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:10:27,369 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:10:27,370 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:10:27,370 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:10:27,370 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:10:27,370 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:10:27,370 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:10:27,371 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:10:27,371 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:10:27,371 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:10:27,371 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:10:27,371 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:10:27,372 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:10:27,372 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:10:27,372 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-02 12:10:27,372 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:10:27,373 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:10:27,373 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:10:27,373 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:10:27,373 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:10:27,373 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:10:27,374 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:10:27,374 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:10:27,374 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:10:27,374 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:10:27,374 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:10:27,374 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:10:27,375 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:10:27,375 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:10:27,375 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:10:27,375 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:10:27,376 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:10:27,376 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:10:27,376 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:10:27,377 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:10:27,377 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:10:27,377 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:10:27,377 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:10:27,377 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:10:27,377 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:10:27,378 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:10:27,378 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:10:27,379 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:10:27,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:10:27,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:10:27,379 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:10:27,379 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:10:27,379 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:10:27,380 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:10:27,380 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:10:27,380 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:10:27,381 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:10:27,381 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:10:27,382 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:10:27,382 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:10:27,382 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:10:27,383 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:10:27,383 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:10:27,383 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:10:27,383 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:10:27,383 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:10:27,384 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:10:27,384 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:10:27,384 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:10:27,384 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:10:27,384 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:10:27,384 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:10:27,385 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:10:27,385 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:10:27,385 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:10:27,385 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:10:27,385 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:10:27,385 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:10:27,386 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:10:27,386 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:10:27,386 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:10:27,386 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:10:27,386 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:10:27,386 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:10:27,387 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:10:27,387 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:10:27,387 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:10:27,388 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:10:27,388 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:10:27,388 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:10:27,388 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:10:27,389 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:10:27,389 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:10:27,389 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:10:27,389 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:10:27,390 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:10:27,391 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:10:27,391 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:10:27,391 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:10:27,391 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:10:27,391 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:10:27,391 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:10:27,392 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:10:27,392 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:10:27,392 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:10:27,393 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:10:27,393 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-02 12:10:27,393 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:10:27,393 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:10:27,393 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:10:27,394 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:10:27,397 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:10:27,398 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:10:27,398 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:10:27,399 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:10:27,404 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:10:27,405 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:10:27,405 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:10:27,405 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:10:27,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:10:27,405 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:10:27,405 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:10:27,405 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:10:27,406 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:10:27,406 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:10:27,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:10:27,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:10:27,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:10:27,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:10:27,406 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:10:27,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:10:27,407 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:10:27,407 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:10:27,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:10:27,407 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:10:27,407 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:10:27,407 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:10:27,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:10:27,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:10:27,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:10:29,816 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:10:29,816 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:10:29,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:10:29 BoogieIcfgContainer [2019-10-02 12:10:29,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:10:29,820 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:10:29,820 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:10:29,823 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:10:29,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:10:25" (1/3) ... [2019-10-02 12:10:29,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236f56ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:10:29, skipping insertion in model container [2019-10-02 12:10:29,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:10:27" (2/3) ... [2019-10-02 12:10:29,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236f56ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:10:29, skipping insertion in model container [2019-10-02 12:10:29,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:10:29" (3/3) ... [2019-10-02 12:10:29,829 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product29.cil.c [2019-10-02 12:10:29,839 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:10:29,851 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:10:29,868 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:10:29,916 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:10:29,917 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:10:29,917 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:10:29,917 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:10:29,917 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:10:29,917 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:10:29,917 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:10:29,917 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:10:29,918 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:10:29,958 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states. [2019-10-02 12:10:29,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 12:10:29,984 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:29,986 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:29,988 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:29,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:29,994 INFO L82 PathProgramCache]: Analyzing trace with hash 902898907, now seen corresponding path program 1 times [2019-10-02 12:10:29,996 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:29,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:30,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:30,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:30,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:30,635 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:10:30,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:30,638 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:10:30,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:31,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 3273 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-02 12:10:31,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:31,446 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 12:10:31,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:31,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-10-02 12:10:31,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:10:31,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:10:31,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:10:31,485 INFO L87 Difference]: Start difference. First operand 790 states. Second operand 4 states. [2019-10-02 12:10:31,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:31,723 INFO L93 Difference]: Finished difference Result 1264 states and 2037 transitions. [2019-10-02 12:10:31,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:10:31,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-10-02 12:10:31,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:31,759 INFO L225 Difference]: With dead ends: 1264 [2019-10-02 12:10:31,759 INFO L226 Difference]: Without dead ends: 636 [2019-10-02 12:10:31,772 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:10:31,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2019-10-02 12:10:31,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2019-10-02 12:10:31,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-10-02 12:10:31,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1012 transitions. [2019-10-02 12:10:31,897 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1012 transitions. Word has length 155 [2019-10-02 12:10:31,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:31,898 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 1012 transitions. [2019-10-02 12:10:31,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:10:31,898 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1012 transitions. [2019-10-02 12:10:31,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 12:10:31,921 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:31,921 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:31,922 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:31,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:31,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1074530708, now seen corresponding path program 1 times [2019-10-02 12:10:31,922 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:31,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:31,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:31,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:31,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:32,170 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:10:32,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:32,170 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:10:32,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:32,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 3278 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:10:32,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:32,888 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:10:32,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:32,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:10:32,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:10:32,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:10:32,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:10:32,911 INFO L87 Difference]: Start difference. First operand 636 states and 1012 transitions. Second operand 6 states. [2019-10-02 12:10:33,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:33,018 INFO L93 Difference]: Finished difference Result 1244 states and 1997 transitions. [2019-10-02 12:10:33,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:10:33,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2019-10-02 12:10:33,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:33,026 INFO L225 Difference]: With dead ends: 1244 [2019-10-02 12:10:33,026 INFO L226 Difference]: Without dead ends: 636 [2019-10-02 12:10:33,031 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:10:33,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2019-10-02 12:10:33,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2019-10-02 12:10:33,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-10-02 12:10:33,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1011 transitions. [2019-10-02 12:10:33,074 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1011 transitions. Word has length 159 [2019-10-02 12:10:33,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:33,075 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 1011 transitions. [2019-10-02 12:10:33,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:10:33,075 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1011 transitions. [2019-10-02 12:10:33,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 12:10:33,081 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:33,082 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:33,082 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:33,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:33,082 INFO L82 PathProgramCache]: Analyzing trace with hash 480608966, now seen corresponding path program 1 times [2019-10-02 12:10:33,083 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:33,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:33,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:33,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:33,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:10:33,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:33,338 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:10:33,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:33,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 3280 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:10:33,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:34,006 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:10:34,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:34,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:10:34,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:10:34,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:10:34,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:10:34,027 INFO L87 Difference]: Start difference. First operand 636 states and 1011 transitions. Second operand 6 states. [2019-10-02 12:10:34,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:34,127 INFO L93 Difference]: Finished difference Result 1248 states and 2000 transitions. [2019-10-02 12:10:34,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:10:34,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-10-02 12:10:34,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:34,134 INFO L225 Difference]: With dead ends: 1248 [2019-10-02 12:10:34,134 INFO L226 Difference]: Without dead ends: 642 [2019-10-02 12:10:34,138 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:10:34,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-02 12:10:34,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-10-02 12:10:34,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-02 12:10:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1016 transitions. [2019-10-02 12:10:34,171 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1016 transitions. Word has length 161 [2019-10-02 12:10:34,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:34,171 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 1016 transitions. [2019-10-02 12:10:34,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:10:34,172 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1016 transitions. [2019-10-02 12:10:34,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 12:10:34,177 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:34,177 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:34,178 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:34,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:34,178 INFO L82 PathProgramCache]: Analyzing trace with hash 744578377, now seen corresponding path program 1 times [2019-10-02 12:10:34,178 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:34,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:34,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:34,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:34,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:34,326 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:10:34,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:34,326 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:10:34,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:34,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 3281 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:10:34,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:10:35,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:35,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:10:35,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:10:35,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:10:35,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:10:35,046 INFO L87 Difference]: Start difference. First operand 642 states and 1016 transitions. Second operand 6 states. [2019-10-02 12:10:35,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:35,167 INFO L93 Difference]: Finished difference Result 1247 states and 1991 transitions. [2019-10-02 12:10:35,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:10:35,167 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2019-10-02 12:10:35,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:35,174 INFO L225 Difference]: With dead ends: 1247 [2019-10-02 12:10:35,174 INFO L226 Difference]: Without dead ends: 642 [2019-10-02 12:10:35,179 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:10:35,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-02 12:10:35,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-10-02 12:10:35,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-02 12:10:35,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1015 transitions. [2019-10-02 12:10:35,219 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1015 transitions. Word has length 162 [2019-10-02 12:10:35,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:35,220 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 1015 transitions. [2019-10-02 12:10:35,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:10:35,220 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1015 transitions. [2019-10-02 12:10:35,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-02 12:10:35,229 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:35,229 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:35,230 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:35,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:35,230 INFO L82 PathProgramCache]: Analyzing trace with hash -831847774, now seen corresponding path program 1 times [2019-10-02 12:10:35,230 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:35,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:35,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:35,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:35,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:35,394 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:10:35,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:35,397 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:10:35,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:35,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 3282 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:10:35,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:36,042 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:10:36,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:36,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:10:36,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:10:36,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:10:36,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:10:36,057 INFO L87 Difference]: Start difference. First operand 642 states and 1015 transitions. Second operand 6 states. [2019-10-02 12:10:36,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:36,136 INFO L93 Difference]: Finished difference Result 1247 states and 1990 transitions. [2019-10-02 12:10:36,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:10:36,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-10-02 12:10:36,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:36,143 INFO L225 Difference]: With dead ends: 1247 [2019-10-02 12:10:36,143 INFO L226 Difference]: Without dead ends: 642 [2019-10-02 12:10:36,153 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:10:36,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-02 12:10:36,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-10-02 12:10:36,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-02 12:10:36,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1014 transitions. [2019-10-02 12:10:36,179 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1014 transitions. Word has length 163 [2019-10-02 12:10:36,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:36,180 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 1014 transitions. [2019-10-02 12:10:36,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:10:36,180 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1014 transitions. [2019-10-02 12:10:36,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 12:10:36,184 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:36,185 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:36,185 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:36,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:36,185 INFO L82 PathProgramCache]: Analyzing trace with hash 669005797, now seen corresponding path program 1 times [2019-10-02 12:10:36,185 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:36,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:36,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:36,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:36,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:36,422 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 12:10:36,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:36,422 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:10:36,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:36,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 3283 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:10:36,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:37,037 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:10:37,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:37,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-10-02 12:10:37,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:10:37,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:10:37,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:10:37,059 INFO L87 Difference]: Start difference. First operand 642 states and 1014 transitions. Second operand 12 states. [2019-10-02 12:10:37,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:37,883 INFO L93 Difference]: Finished difference Result 1258 states and 2010 transitions. [2019-10-02 12:10:37,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:10:37,884 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 164 [2019-10-02 12:10:37,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:37,889 INFO L225 Difference]: With dead ends: 1258 [2019-10-02 12:10:37,889 INFO L226 Difference]: Without dead ends: 651 [2019-10-02 12:10:37,893 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:10:37,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-02 12:10:37,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 649. [2019-10-02 12:10:37,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2019-10-02 12:10:37,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1019 transitions. [2019-10-02 12:10:37,920 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1019 transitions. Word has length 164 [2019-10-02 12:10:37,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:37,921 INFO L475 AbstractCegarLoop]: Abstraction has 649 states and 1019 transitions. [2019-10-02 12:10:37,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:10:37,921 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1019 transitions. [2019-10-02 12:10:37,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 12:10:37,926 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:37,927 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:37,927 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:37,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:37,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1098388375, now seen corresponding path program 1 times [2019-10-02 12:10:37,928 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:37,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:37,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:37,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:37,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:38,091 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:10:38,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:38,091 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:10:38,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:38,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 3286 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:10:38,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:10:38,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:38,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:10:38,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:10:38,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:10:38,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:10:38,665 INFO L87 Difference]: Start difference. First operand 649 states and 1019 transitions. Second operand 8 states. [2019-10-02 12:10:38,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:38,986 INFO L93 Difference]: Finished difference Result 1259 states and 2000 transitions. [2019-10-02 12:10:38,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:10:38,987 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 167 [2019-10-02 12:10:38,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:38,993 INFO L225 Difference]: With dead ends: 1259 [2019-10-02 12:10:38,993 INFO L226 Difference]: Without dead ends: 649 [2019-10-02 12:10:38,996 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:10:38,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-10-02 12:10:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2019-10-02 12:10:39,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2019-10-02 12:10:39,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1014 transitions. [2019-10-02 12:10:39,022 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1014 transitions. Word has length 167 [2019-10-02 12:10:39,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:39,022 INFO L475 AbstractCegarLoop]: Abstraction has 649 states and 1014 transitions. [2019-10-02 12:10:39,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:10:39,022 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1014 transitions. [2019-10-02 12:10:39,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 12:10:39,027 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:39,028 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:39,028 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:39,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:39,028 INFO L82 PathProgramCache]: Analyzing trace with hash -372621191, now seen corresponding path program 1 times [2019-10-02 12:10:39,029 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:39,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:39,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:39,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:39,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:10:39,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:39,167 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:10:39,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:39,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 3288 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:10:39,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:39,851 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:10:39,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:39,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:10:39,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:10:39,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:10:39,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:10:39,863 INFO L87 Difference]: Start difference. First operand 649 states and 1014 transitions. Second operand 8 states. [2019-10-02 12:10:40,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:40,189 INFO L93 Difference]: Finished difference Result 1280 states and 2021 transitions. [2019-10-02 12:10:40,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:10:40,190 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 169 [2019-10-02 12:10:40,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:40,198 INFO L225 Difference]: With dead ends: 1280 [2019-10-02 12:10:40,198 INFO L226 Difference]: Without dead ends: 676 [2019-10-02 12:10:40,202 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:10:40,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2019-10-02 12:10:40,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 673. [2019-10-02 12:10:40,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-10-02 12:10:40,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1041 transitions. [2019-10-02 12:10:40,229 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1041 transitions. Word has length 169 [2019-10-02 12:10:40,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:40,231 INFO L475 AbstractCegarLoop]: Abstraction has 673 states and 1041 transitions. [2019-10-02 12:10:40,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:10:40,231 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1041 transitions. [2019-10-02 12:10:40,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 12:10:40,236 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:40,236 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:40,236 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:40,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:40,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1530831994, now seen corresponding path program 1 times [2019-10-02 12:10:40,237 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:40,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:40,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:40,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:40,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:40,394 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:10:40,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:40,395 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:10:40,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:40,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 3283 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 12:10:40,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:41,084 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 12:10:41,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:41,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2019-10-02 12:10:41,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:10:41,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:10:41,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:10:41,104 INFO L87 Difference]: Start difference. First operand 673 states and 1041 transitions. Second operand 9 states. [2019-10-02 12:10:41,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:41,379 INFO L93 Difference]: Finished difference Result 1304 states and 2038 transitions. [2019-10-02 12:10:41,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:10:41,380 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 169 [2019-10-02 12:10:41,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:41,387 INFO L225 Difference]: With dead ends: 1304 [2019-10-02 12:10:41,387 INFO L226 Difference]: Without dead ends: 657 [2019-10-02 12:10:41,391 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:10:41,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-02 12:10:41,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-02 12:10:41,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-02 12:10:41,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1016 transitions. [2019-10-02 12:10:41,423 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1016 transitions. Word has length 169 [2019-10-02 12:10:41,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:41,424 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1016 transitions. [2019-10-02 12:10:41,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:10:41,424 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1016 transitions. [2019-10-02 12:10:41,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 12:10:41,430 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:41,431 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:41,431 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:41,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:41,432 INFO L82 PathProgramCache]: Analyzing trace with hash -2092547535, now seen corresponding path program 1 times [2019-10-02 12:10:41,432 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:41,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:41,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:41,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:41,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:41,612 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 12:10:41,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:41,613 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:10:41,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:42,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 3285 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 12:10:42,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:42,365 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:10:42,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:42,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 12:10:42,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:10:42,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:10:42,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:10:42,383 INFO L87 Difference]: Start difference. First operand 657 states and 1016 transitions. Second operand 14 states. [2019-10-02 12:10:42,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:42,633 INFO L93 Difference]: Finished difference Result 1252 states and 1954 transitions. [2019-10-02 12:10:42,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:10:42,634 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 170 [2019-10-02 12:10:42,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:42,638 INFO L225 Difference]: With dead ends: 1252 [2019-10-02 12:10:42,639 INFO L226 Difference]: Without dead ends: 643 [2019-10-02 12:10:42,642 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:10:42,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-10-02 12:10:42,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 638. [2019-10-02 12:10:42,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-10-02 12:10:42,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 981 transitions. [2019-10-02 12:10:42,664 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 981 transitions. Word has length 170 [2019-10-02 12:10:42,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:42,664 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 981 transitions. [2019-10-02 12:10:42,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:10:42,665 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 981 transitions. [2019-10-02 12:10:42,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 12:10:42,670 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:42,670 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:42,670 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:42,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:42,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1610301341, now seen corresponding path program 1 times [2019-10-02 12:10:42,671 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:42,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:42,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:42,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:42,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:42,818 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:10:42,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:42,819 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:10:42,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:43,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 3291 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:10:43,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:43,470 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:10:43,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:43,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:10:43,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:10:43,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:10:43,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:10:43,489 INFO L87 Difference]: Start difference. First operand 638 states and 981 transitions. Second operand 8 states. [2019-10-02 12:10:43,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:43,681 INFO L93 Difference]: Finished difference Result 1226 states and 1908 transitions. [2019-10-02 12:10:43,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:10:43,682 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 172 [2019-10-02 12:10:43,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:43,688 INFO L225 Difference]: With dead ends: 1226 [2019-10-02 12:10:43,689 INFO L226 Difference]: Without dead ends: 638 [2019-10-02 12:10:43,692 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:10:43,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-02 12:10:43,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-10-02 12:10:43,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-10-02 12:10:43,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 980 transitions. [2019-10-02 12:10:43,719 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 980 transitions. Word has length 172 [2019-10-02 12:10:43,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:43,720 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 980 transitions. [2019-10-02 12:10:43,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:10:43,720 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 980 transitions. [2019-10-02 12:10:43,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 12:10:43,728 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:43,728 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:43,729 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:43,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:43,729 INFO L82 PathProgramCache]: Analyzing trace with hash 307723721, now seen corresponding path program 1 times [2019-10-02 12:10:43,730 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:43,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:43,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:43,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:43,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:43,882 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:10:43,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:43,883 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:10:43,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:44,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 3292 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:10:44,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:44,494 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:10:44,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:44,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:10:44,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:10:44,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:10:44,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:10:44,504 INFO L87 Difference]: Start difference. First operand 638 states and 980 transitions. Second operand 8 states. [2019-10-02 12:10:44,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:44,708 INFO L93 Difference]: Finished difference Result 1226 states and 1907 transitions. [2019-10-02 12:10:44,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:10:44,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 173 [2019-10-02 12:10:44,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:44,715 INFO L225 Difference]: With dead ends: 1226 [2019-10-02 12:10:44,715 INFO L226 Difference]: Without dead ends: 638 [2019-10-02 12:10:44,720 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:10:44,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-02 12:10:44,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-10-02 12:10:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-10-02 12:10:44,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 979 transitions. [2019-10-02 12:10:44,751 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 979 transitions. Word has length 173 [2019-10-02 12:10:44,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:44,752 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 979 transitions. [2019-10-02 12:10:44,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:10:44,753 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 979 transitions. [2019-10-02 12:10:44,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 12:10:44,757 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:44,758 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:44,758 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:44,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:44,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1036484702, now seen corresponding path program 1 times [2019-10-02 12:10:44,759 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:44,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:44,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:44,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:44,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 12:10:45,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:45,020 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:10:45,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:45,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 3293 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 12:10:45,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:45,762 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:10:45,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:45,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2019-10-02 12:10:45,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 12:10:45,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 12:10:45,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:10:45,773 INFO L87 Difference]: Start difference. First operand 638 states and 979 transitions. Second operand 18 states. [2019-10-02 12:10:46,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:46,285 INFO L93 Difference]: Finished difference Result 1240 states and 1929 transitions. [2019-10-02 12:10:46,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:10:46,285 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 174 [2019-10-02 12:10:46,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:46,290 INFO L225 Difference]: With dead ends: 1240 [2019-10-02 12:10:46,291 INFO L226 Difference]: Without dead ends: 651 [2019-10-02 12:10:46,294 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:10:46,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-02 12:10:46,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 645. [2019-10-02 12:10:46,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-10-02 12:10:46,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 987 transitions. [2019-10-02 12:10:46,316 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 987 transitions. Word has length 174 [2019-10-02 12:10:46,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:46,317 INFO L475 AbstractCegarLoop]: Abstraction has 645 states and 987 transitions. [2019-10-02 12:10:46,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 12:10:46,317 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 987 transitions. [2019-10-02 12:10:46,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:10:46,322 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:46,322 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:46,322 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:46,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:46,323 INFO L82 PathProgramCache]: Analyzing trace with hash -39301917, now seen corresponding path program 1 times [2019-10-02 12:10:46,323 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:46,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:46,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:46,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:46,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:46,487 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:10:46,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:10:46,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:10:46,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:10:46,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:10:46,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:10:46,489 INFO L87 Difference]: Start difference. First operand 645 states and 987 transitions. Second operand 9 states. [2019-10-02 12:10:46,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:46,705 INFO L93 Difference]: Finished difference Result 1180 states and 1848 transitions. [2019-10-02 12:10:46,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:10:46,706 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 175 [2019-10-02 12:10:46,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:46,711 INFO L225 Difference]: With dead ends: 1180 [2019-10-02 12:10:46,711 INFO L226 Difference]: Without dead ends: 642 [2019-10-02 12:10:46,715 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:10:46,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-02 12:10:46,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-10-02 12:10:46,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-02 12:10:46,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 982 transitions. [2019-10-02 12:10:46,745 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 982 transitions. Word has length 175 [2019-10-02 12:10:46,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:46,746 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 982 transitions. [2019-10-02 12:10:46,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:10:46,746 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 982 transitions. [2019-10-02 12:10:46,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:10:46,753 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:46,754 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:46,754 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:46,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:46,755 INFO L82 PathProgramCache]: Analyzing trace with hash -302741149, now seen corresponding path program 1 times [2019-10-02 12:10:46,755 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:46,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:46,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:46,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:46,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:46,965 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 12:10:46,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:10:46,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:10:46,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:10:46,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:10:46,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:10:46,967 INFO L87 Difference]: Start difference. First operand 642 states and 982 transitions. Second operand 7 states. [2019-10-02 12:10:47,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:47,060 INFO L93 Difference]: Finished difference Result 1177 states and 1843 transitions. [2019-10-02 12:10:47,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:10:47,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 175 [2019-10-02 12:10:47,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:47,065 INFO L225 Difference]: With dead ends: 1177 [2019-10-02 12:10:47,065 INFO L226 Difference]: Without dead ends: 634 [2019-10-02 12:10:47,068 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:10:47,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-10-02 12:10:47,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2019-10-02 12:10:47,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-10-02 12:10:47,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 971 transitions. [2019-10-02 12:10:47,089 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 971 transitions. Word has length 175 [2019-10-02 12:10:47,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:47,090 INFO L475 AbstractCegarLoop]: Abstraction has 634 states and 971 transitions. [2019-10-02 12:10:47,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:10:47,090 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 971 transitions. [2019-10-02 12:10:47,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 12:10:47,094 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:47,095 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:47,095 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:47,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:47,096 INFO L82 PathProgramCache]: Analyzing trace with hash -906587733, now seen corresponding path program 1 times [2019-10-02 12:10:47,096 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:47,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:47,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:47,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:47,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:47,318 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:10:47,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:10:47,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:10:47,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:10:47,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:10:47,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:10:47,320 INFO L87 Difference]: Start difference. First operand 634 states and 971 transitions. Second operand 13 states. [2019-10-02 12:10:47,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:47,663 INFO L93 Difference]: Finished difference Result 1170 states and 1831 transitions. [2019-10-02 12:10:47,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:10:47,664 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 176 [2019-10-02 12:10:47,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:47,668 INFO L225 Difference]: With dead ends: 1170 [2019-10-02 12:10:47,668 INFO L226 Difference]: Without dead ends: 627 [2019-10-02 12:10:47,671 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:10:47,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-10-02 12:10:47,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2019-10-02 12:10:47,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-02 12:10:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 962 transitions. [2019-10-02 12:10:47,692 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 962 transitions. Word has length 176 [2019-10-02 12:10:47,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:47,692 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 962 transitions. [2019-10-02 12:10:47,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:10:47,693 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 962 transitions. [2019-10-02 12:10:47,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-02 12:10:47,697 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:47,698 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:47,698 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:47,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:47,698 INFO L82 PathProgramCache]: Analyzing trace with hash 242506502, now seen corresponding path program 1 times [2019-10-02 12:10:47,698 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:47,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:47,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:47,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:47,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:47,959 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:10:47,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:10:47,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:10:47,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:10:47,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:10:47,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:10:47,961 INFO L87 Difference]: Start difference. First operand 627 states and 962 transitions. Second operand 13 states. [2019-10-02 12:10:48,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:48,370 INFO L93 Difference]: Finished difference Result 1221 states and 1899 transitions. [2019-10-02 12:10:48,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:10:48,371 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 177 [2019-10-02 12:10:48,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:48,377 INFO L225 Difference]: With dead ends: 1221 [2019-10-02 12:10:48,378 INFO L226 Difference]: Without dead ends: 641 [2019-10-02 12:10:48,381 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:10:48,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-10-02 12:10:48,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 639. [2019-10-02 12:10:48,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-02 12:10:48,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 977 transitions. [2019-10-02 12:10:48,405 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 977 transitions. Word has length 177 [2019-10-02 12:10:48,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:48,405 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 977 transitions. [2019-10-02 12:10:48,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:10:48,406 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 977 transitions. [2019-10-02 12:10:48,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 12:10:48,411 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:48,411 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:48,411 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:48,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:48,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1165438822, now seen corresponding path program 1 times [2019-10-02 12:10:48,412 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:48,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:48,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:48,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:48,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:48,613 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:10:48,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:10:48,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:10:48,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:10:48,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:10:48,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:10:48,615 INFO L87 Difference]: Start difference. First operand 639 states and 977 transitions. Second operand 11 states. [2019-10-02 12:10:48,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:48,845 INFO L93 Difference]: Finished difference Result 1175 states and 1837 transitions. [2019-10-02 12:10:48,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:10:48,846 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 178 [2019-10-02 12:10:48,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:48,850 INFO L225 Difference]: With dead ends: 1175 [2019-10-02 12:10:48,850 INFO L226 Difference]: Without dead ends: 639 [2019-10-02 12:10:48,853 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:10:48,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-10-02 12:10:48,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-10-02 12:10:48,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-02 12:10:48,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 976 transitions. [2019-10-02 12:10:48,873 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 976 transitions. Word has length 178 [2019-10-02 12:10:48,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:48,873 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 976 transitions. [2019-10-02 12:10:48,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:10:48,873 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 976 transitions. [2019-10-02 12:10:48,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 12:10:48,877 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:48,878 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:48,878 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:48,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:48,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1675024101, now seen corresponding path program 1 times [2019-10-02 12:10:48,878 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:48,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:48,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:48,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:48,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:49,090 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:10:49,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:10:49,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:10:49,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:10:49,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:10:49,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:10:49,093 INFO L87 Difference]: Start difference. First operand 639 states and 976 transitions. Second operand 11 states. [2019-10-02 12:10:49,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:49,354 INFO L93 Difference]: Finished difference Result 1221 states and 1890 transitions. [2019-10-02 12:10:49,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:10:49,355 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 179 [2019-10-02 12:10:49,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:49,359 INFO L225 Difference]: With dead ends: 1221 [2019-10-02 12:10:49,359 INFO L226 Difference]: Without dead ends: 636 [2019-10-02 12:10:49,362 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:10:49,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2019-10-02 12:10:49,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2019-10-02 12:10:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-10-02 12:10:49,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 968 transitions. [2019-10-02 12:10:49,382 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 968 transitions. Word has length 179 [2019-10-02 12:10:49,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:49,382 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 968 transitions. [2019-10-02 12:10:49,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:10:49,382 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 968 transitions. [2019-10-02 12:10:49,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 12:10:49,387 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:49,388 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:49,388 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:49,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:49,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1286305397, now seen corresponding path program 1 times [2019-10-02 12:10:49,388 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:49,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:49,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:49,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:49,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:49,543 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:10:49,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:10:49,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:10:49,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:10:49,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:10:49,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:10:49,545 INFO L87 Difference]: Start difference. First operand 636 states and 968 transitions. Second operand 6 states. [2019-10-02 12:10:53,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:53,695 INFO L93 Difference]: Finished difference Result 1820 states and 2933 transitions. [2019-10-02 12:10:53,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:10:53,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-10-02 12:10:53,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:53,715 INFO L225 Difference]: With dead ends: 1820 [2019-10-02 12:10:53,715 INFO L226 Difference]: Without dead ends: 1293 [2019-10-02 12:10:53,719 INFO L640 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-10-02 12:10:53,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2019-10-02 12:10:53,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1210. [2019-10-02 12:10:53,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-10-02 12:10:53,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1908 transitions. [2019-10-02 12:10:53,779 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1908 transitions. Word has length 180 [2019-10-02 12:10:53,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:53,779 INFO L475 AbstractCegarLoop]: Abstraction has 1210 states and 1908 transitions. [2019-10-02 12:10:53,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:10:53,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1908 transitions. [2019-10-02 12:10:53,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 12:10:53,784 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:53,784 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:53,784 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:53,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:53,785 INFO L82 PathProgramCache]: Analyzing trace with hash 496043897, now seen corresponding path program 1 times [2019-10-02 12:10:53,785 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:53,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:53,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:53,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:53,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:53,950 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:10:53,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:10:53,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:10:53,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:10:53,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:10:53,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:10:53,952 INFO L87 Difference]: Start difference. First operand 1210 states and 1908 transitions. Second operand 6 states. [2019-10-02 12:10:58,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:58,672 INFO L93 Difference]: Finished difference Result 3767 states and 6212 transitions. [2019-10-02 12:10:58,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:10:58,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2019-10-02 12:10:58,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:58,702 INFO L225 Difference]: With dead ends: 3767 [2019-10-02 12:10:58,702 INFO L226 Difference]: Without dead ends: 2667 [2019-10-02 12:10:58,713 INFO L640 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-10-02 12:10:58,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2019-10-02 12:10:58,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2471. [2019-10-02 12:10:58,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2471 states. [2019-10-02 12:10:58,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 4001 transitions. [2019-10-02 12:10:58,909 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 4001 transitions. Word has length 181 [2019-10-02 12:10:58,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:58,910 INFO L475 AbstractCegarLoop]: Abstraction has 2471 states and 4001 transitions. [2019-10-02 12:10:58,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:10:58,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 4001 transitions. [2019-10-02 12:10:58,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 12:10:58,916 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:58,917 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:58,917 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:58,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:58,918 INFO L82 PathProgramCache]: Analyzing trace with hash 152092239, now seen corresponding path program 1 times [2019-10-02 12:10:58,918 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:58,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:58,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:58,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:58,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:59,177 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:10:59,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:10:59,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:10:59,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:10:59,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:10:59,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:10:59,180 INFO L87 Difference]: Start difference. First operand 2471 states and 4001 transitions. Second operand 6 states. [2019-10-02 12:11:04,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:11:04,190 INFO L93 Difference]: Finished difference Result 8206 states and 13868 transitions. [2019-10-02 12:11:04,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:11:04,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 182 [2019-10-02 12:11:04,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:11:04,259 INFO L225 Difference]: With dead ends: 8206 [2019-10-02 12:11:04,259 INFO L226 Difference]: Without dead ends: 5847 [2019-10-02 12:11:04,287 INFO L640 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-10-02 12:11:04,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5847 states. [2019-10-02 12:11:04,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5847 to 5326. [2019-10-02 12:11:04,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5326 states. [2019-10-02 12:11:04,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5326 states to 5326 states and 8852 transitions. [2019-10-02 12:11:04,798 INFO L78 Accepts]: Start accepts. Automaton has 5326 states and 8852 transitions. Word has length 182 [2019-10-02 12:11:04,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:04,799 INFO L475 AbstractCegarLoop]: Abstraction has 5326 states and 8852 transitions. [2019-10-02 12:11:04,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:11:04,799 INFO L276 IsEmpty]: Start isEmpty. Operand 5326 states and 8852 transitions. [2019-10-02 12:11:04,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 12:11:04,806 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:04,806 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:11:04,806 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:04,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:04,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1682679491, now seen corresponding path program 1 times [2019-10-02 12:11:04,807 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:04,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:04,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:04,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:04,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:05,062 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:11:05,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:05,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:11:05,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:11:05,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:11:05,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:11:05,064 INFO L87 Difference]: Start difference. First operand 5326 states and 8852 transitions. Second operand 6 states. [2019-10-02 12:11:10,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:11:10,210 INFO L93 Difference]: Finished difference Result 18751 states and 32708 transitions. [2019-10-02 12:11:10,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:11:10,210 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2019-10-02 12:11:10,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:11:10,316 INFO L225 Difference]: With dead ends: 18751 [2019-10-02 12:11:10,317 INFO L226 Difference]: Without dead ends: 13541 [2019-10-02 12:11:10,351 INFO L640 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-10-02 12:11:10,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13541 states. [2019-10-02 12:11:11,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13541 to 12065. [2019-10-02 12:11:11,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12065 states. [2019-10-02 12:11:11,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12065 states to 12065 states and 20733 transitions. [2019-10-02 12:11:11,246 INFO L78 Accepts]: Start accepts. Automaton has 12065 states and 20733 transitions. Word has length 183 [2019-10-02 12:11:11,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:11,247 INFO L475 AbstractCegarLoop]: Abstraction has 12065 states and 20733 transitions. [2019-10-02 12:11:11,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:11:11,247 INFO L276 IsEmpty]: Start isEmpty. Operand 12065 states and 20733 transitions. [2019-10-02 12:11:11,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-02 12:11:11,254 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:11,254 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:11:11,255 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:11,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:11,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1355042604, now seen corresponding path program 1 times [2019-10-02 12:11:11,255 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:11,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:11,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:11,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:11,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:11,458 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:11:11,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:11,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:11:11,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:11:11,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:11:11,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:11:11,460 INFO L87 Difference]: Start difference. First operand 12065 states and 20733 transitions. Second operand 9 states. [2019-10-02 12:11:19,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:11:19,206 INFO L93 Difference]: Finished difference Result 38892 states and 67027 transitions. [2019-10-02 12:11:19,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 12:11:19,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 184 [2019-10-02 12:11:19,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:11:19,466 INFO L225 Difference]: With dead ends: 38892 [2019-10-02 12:11:19,466 INFO L226 Difference]: Without dead ends: 26951 [2019-10-02 12:11:19,548 INFO L640 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-10-02 12:11:19,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26951 states. [2019-10-02 12:11:20,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26951 to 26532. [2019-10-02 12:11:20,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26532 states. [2019-10-02 12:11:21,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26532 states to 26532 states and 45363 transitions. [2019-10-02 12:11:21,156 INFO L78 Accepts]: Start accepts. Automaton has 26532 states and 45363 transitions. Word has length 184 [2019-10-02 12:11:21,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:21,157 INFO L475 AbstractCegarLoop]: Abstraction has 26532 states and 45363 transitions. [2019-10-02 12:11:21,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:11:21,157 INFO L276 IsEmpty]: Start isEmpty. Operand 26532 states and 45363 transitions. [2019-10-02 12:11:21,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 12:11:21,164 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:21,164 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:11:21,165 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:21,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:21,165 INFO L82 PathProgramCache]: Analyzing trace with hash -206315708, now seen corresponding path program 1 times [2019-10-02 12:11:21,165 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:21,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:21,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:21,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:21,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:21,308 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:11:21,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:21,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:11:21,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:11:21,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:11:21,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:11:21,310 INFO L87 Difference]: Start difference. First operand 26532 states and 45363 transitions. Second operand 7 states. [2019-10-02 12:11:22,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:11:22,290 INFO L93 Difference]: Finished difference Result 53628 states and 91685 transitions. [2019-10-02 12:11:22,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:11:22,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 190 [2019-10-02 12:11:22,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:11:22,528 INFO L225 Difference]: With dead ends: 53628 [2019-10-02 12:11:22,529 INFO L226 Difference]: Without dead ends: 27220 [2019-10-02 12:11:22,661 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:11:22,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27220 states. [2019-10-02 12:11:25,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27220 to 26868. [2019-10-02 12:11:25,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26868 states. [2019-10-02 12:11:25,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26868 states to 26868 states and 45843 transitions. [2019-10-02 12:11:25,392 INFO L78 Accepts]: Start accepts. Automaton has 26868 states and 45843 transitions. Word has length 190 [2019-10-02 12:11:25,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:25,392 INFO L475 AbstractCegarLoop]: Abstraction has 26868 states and 45843 transitions. [2019-10-02 12:11:25,393 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:11:25,393 INFO L276 IsEmpty]: Start isEmpty. Operand 26868 states and 45843 transitions. [2019-10-02 12:11:25,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 12:11:25,401 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:25,401 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:11:25,402 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:25,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:25,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1519253740, now seen corresponding path program 1 times [2019-10-02 12:11:25,402 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:25,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:25,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:25,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:25,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:25,558 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:11:25,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:25,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:11:25,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:11:25,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:11:25,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:11:25,560 INFO L87 Difference]: Start difference. First operand 26868 states and 45843 transitions. Second operand 7 states. [2019-10-02 12:11:26,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:11:26,755 INFO L93 Difference]: Finished difference Result 54204 states and 92453 transitions. [2019-10-02 12:11:26,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:11:26,756 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 189 [2019-10-02 12:11:26,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:11:26,954 INFO L225 Difference]: With dead ends: 54204 [2019-10-02 12:11:26,954 INFO L226 Difference]: Without dead ends: 27460 [2019-10-02 12:11:27,084 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:11:27,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27460 states. [2019-10-02 12:11:28,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27460 to 26916. [2019-10-02 12:11:28,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26916 states. [2019-10-02 12:11:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26916 states to 26916 states and 45891 transitions. [2019-10-02 12:11:28,816 INFO L78 Accepts]: Start accepts. Automaton has 26916 states and 45891 transitions. Word has length 189 [2019-10-02 12:11:28,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:28,816 INFO L475 AbstractCegarLoop]: Abstraction has 26916 states and 45891 transitions. [2019-10-02 12:11:28,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:11:28,817 INFO L276 IsEmpty]: Start isEmpty. Operand 26916 states and 45891 transitions. [2019-10-02 12:11:28,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 12:11:28,822 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:28,822 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:11:28,823 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:28,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:28,823 INFO L82 PathProgramCache]: Analyzing trace with hash -998659066, now seen corresponding path program 1 times [2019-10-02 12:11:28,823 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:28,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:28,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:28,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:28,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:28,963 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:11:28,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:28,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:11:28,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:11:28,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:11:28,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:11:28,966 INFO L87 Difference]: Start difference. First operand 26916 states and 45891 transitions. Second operand 5 states. [2019-10-02 12:11:30,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:11:30,048 INFO L93 Difference]: Finished difference Result 53990 states and 92040 transitions. [2019-10-02 12:11:30,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:11:30,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2019-10-02 12:11:30,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:11:30,208 INFO L225 Difference]: With dead ends: 53990 [2019-10-02 12:11:30,208 INFO L226 Difference]: Without dead ends: 27198 [2019-10-02 12:11:30,302 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:11:30,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27198 states. [2019-10-02 12:11:32,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27198 to 26931. [2019-10-02 12:11:32,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26931 states. [2019-10-02 12:11:33,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26931 states to 26931 states and 45909 transitions. [2019-10-02 12:11:33,065 INFO L78 Accepts]: Start accepts. Automaton has 26931 states and 45909 transitions. Word has length 190 [2019-10-02 12:11:33,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:33,065 INFO L475 AbstractCegarLoop]: Abstraction has 26931 states and 45909 transitions. [2019-10-02 12:11:33,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:11:33,065 INFO L276 IsEmpty]: Start isEmpty. Operand 26931 states and 45909 transitions. [2019-10-02 12:11:33,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 12:11:33,071 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:33,071 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:11:33,072 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:33,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:33,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1629117691, now seen corresponding path program 1 times [2019-10-02 12:11:33,072 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:33,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:33,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:33,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:33,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:33,227 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:11:33,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:33,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:11:33,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:11:33,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:11:33,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:11:33,229 INFO L87 Difference]: Start difference. First operand 26931 states and 45909 transitions. Second operand 6 states. [2019-10-02 12:11:40,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:11:40,519 INFO L93 Difference]: Finished difference Result 98851 states and 178533 transitions. [2019-10-02 12:11:40,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:11:40,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 190 [2019-10-02 12:11:40,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:11:41,006 INFO L225 Difference]: With dead ends: 98851 [2019-10-02 12:11:41,006 INFO L226 Difference]: Without dead ends: 72044 [2019-10-02 12:11:41,110 INFO L640 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-10-02 12:11:41,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72044 states. [2019-10-02 12:11:46,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72044 to 63377. [2019-10-02 12:11:46,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63377 states. [2019-10-02 12:11:46,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63377 states to 63377 states and 112740 transitions. [2019-10-02 12:11:46,960 INFO L78 Accepts]: Start accepts. Automaton has 63377 states and 112740 transitions. Word has length 190 [2019-10-02 12:11:46,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:46,961 INFO L475 AbstractCegarLoop]: Abstraction has 63377 states and 112740 transitions. [2019-10-02 12:11:46,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:11:46,961 INFO L276 IsEmpty]: Start isEmpty. Operand 63377 states and 112740 transitions. [2019-10-02 12:11:46,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 12:11:46,968 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:46,969 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:11:46,969 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:46,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:46,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1045985972, now seen corresponding path program 1 times [2019-10-02 12:11:46,969 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:46,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:46,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:46,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:46,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:47,240 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:11:47,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:47,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:11:47,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:11:47,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:11:47,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:11:47,242 INFO L87 Difference]: Start difference. First operand 63377 states and 112740 transitions. Second operand 8 states. [2019-10-02 12:12:00,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:12:00,934 INFO L93 Difference]: Finished difference Result 213874 states and 385343 transitions. [2019-10-02 12:12:00,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:12:00,934 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 199 [2019-10-02 12:12:00,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:12:01,926 INFO L225 Difference]: With dead ends: 213874 [2019-10-02 12:12:01,926 INFO L226 Difference]: Without dead ends: 150637 [2019-10-02 12:12:02,225 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:12:02,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150637 states. [2019-10-02 12:12:13,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150637 to 150507. [2019-10-02 12:12:13,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150507 states. [2019-10-02 12:12:14,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150507 states to 150507 states and 269457 transitions. [2019-10-02 12:12:14,506 INFO L78 Accepts]: Start accepts. Automaton has 150507 states and 269457 transitions. Word has length 199 [2019-10-02 12:12:14,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:12:14,506 INFO L475 AbstractCegarLoop]: Abstraction has 150507 states and 269457 transitions. [2019-10-02 12:12:14,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:12:14,506 INFO L276 IsEmpty]: Start isEmpty. Operand 150507 states and 269457 transitions. [2019-10-02 12:12:14,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 12:12:14,511 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:12:14,511 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:12:14,512 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:12:14,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:12:14,512 INFO L82 PathProgramCache]: Analyzing trace with hash 287273289, now seen corresponding path program 1 times [2019-10-02 12:12:14,512 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:12:14,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:12:14,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:12:14,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:12:14,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:12:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:12:14,651 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:12:14,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:12:14,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:12:14,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:12:14,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:12:14,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:12:14,653 INFO L87 Difference]: Start difference. First operand 150507 states and 269457 transitions. Second operand 7 states. [2019-10-02 12:12:27,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:12:27,600 INFO L93 Difference]: Finished difference Result 301705 states and 545837 transitions. [2019-10-02 12:12:27,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:12:27,600 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 201 [2019-10-02 12:12:27,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:12:28,532 INFO L225 Difference]: With dead ends: 301705 [2019-10-02 12:12:28,532 INFO L226 Difference]: Without dead ends: 151275 [2019-10-02 12:12:29,043 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:12:29,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151275 states. [2019-10-02 12:12:43,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151275 to 151275. [2019-10-02 12:12:43,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151275 states. [2019-10-02 12:12:45,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151275 states to 151275 states and 270161 transitions. [2019-10-02 12:12:45,353 INFO L78 Accepts]: Start accepts. Automaton has 151275 states and 270161 transitions. Word has length 201 [2019-10-02 12:12:45,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:12:45,354 INFO L475 AbstractCegarLoop]: Abstraction has 151275 states and 270161 transitions. [2019-10-02 12:12:45,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:12:45,354 INFO L276 IsEmpty]: Start isEmpty. Operand 151275 states and 270161 transitions. [2019-10-02 12:12:45,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-02 12:12:45,361 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:12:45,362 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:12:45,362 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:12:45,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:12:45,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1742138121, now seen corresponding path program 1 times [2019-10-02 12:12:45,363 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:12:45,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:12:45,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:12:45,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:12:45,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:12:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:12:45,550 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:12:45,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:12:45,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:12:45,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:12:45,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:12:45,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:12:45,553 INFO L87 Difference]: Start difference. First operand 151275 states and 270161 transitions. Second operand 7 states. [2019-10-02 12:13:04,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:04,936 INFO L93 Difference]: Finished difference Result 280783 states and 502430 transitions. [2019-10-02 12:13:04,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:13:04,936 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 202 [2019-10-02 12:13:04,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:05,816 INFO L225 Difference]: With dead ends: 280783 [2019-10-02 12:13:05,817 INFO L226 Difference]: Without dead ends: 156542 [2019-10-02 12:13:06,200 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:13:06,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156542 states. [2019-10-02 12:13:14,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156542 to 154987. [2019-10-02 12:13:14,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154987 states. [2019-10-02 12:13:23,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154987 states to 154987 states and 275216 transitions. [2019-10-02 12:13:23,426 INFO L78 Accepts]: Start accepts. Automaton has 154987 states and 275216 transitions. Word has length 202 [2019-10-02 12:13:23,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:23,426 INFO L475 AbstractCegarLoop]: Abstraction has 154987 states and 275216 transitions. [2019-10-02 12:13:23,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:13:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 154987 states and 275216 transitions. [2019-10-02 12:13:23,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-02 12:13:23,434 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:23,435 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:13:23,435 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:23,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:23,436 INFO L82 PathProgramCache]: Analyzing trace with hash -117138291, now seen corresponding path program 1 times [2019-10-02 12:13:23,436 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:23,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:23,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:23,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:23,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:23,568 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:13:23,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:23,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:13:23,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:13:23,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:13:23,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:13:23,569 INFO L87 Difference]: Start difference. First operand 154987 states and 275216 transitions. Second operand 6 states. [2019-10-02 12:13:34,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:34,199 INFO L93 Difference]: Finished difference Result 323398 states and 573368 transitions. [2019-10-02 12:13:34,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:13:34,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 207 [2019-10-02 12:13:34,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:35,303 INFO L225 Difference]: With dead ends: 323398 [2019-10-02 12:13:35,304 INFO L226 Difference]: Without dead ends: 195445 [2019-10-02 12:13:35,729 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:13:35,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195445 states. [2019-10-02 12:13:52,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195445 to 187247. [2019-10-02 12:13:52,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187247 states. [2019-10-02 12:13:54,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187247 states to 187247 states and 332352 transitions. [2019-10-02 12:13:54,142 INFO L78 Accepts]: Start accepts. Automaton has 187247 states and 332352 transitions. Word has length 207 [2019-10-02 12:13:54,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:54,143 INFO L475 AbstractCegarLoop]: Abstraction has 187247 states and 332352 transitions. [2019-10-02 12:13:54,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:13:54,143 INFO L276 IsEmpty]: Start isEmpty. Operand 187247 states and 332352 transitions. [2019-10-02 12:13:54,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-02 12:13:54,149 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:54,149 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:13:54,150 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:54,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:54,150 INFO L82 PathProgramCache]: Analyzing trace with hash 584461583, now seen corresponding path program 1 times [2019-10-02 12:13:54,150 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:54,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:54,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:54,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:54,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:54,286 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:13:54,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:54,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:13:54,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:13:54,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:13:54,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:13:54,288 INFO L87 Difference]: Start difference. First operand 187247 states and 332352 transitions. Second operand 4 states. [2019-10-02 12:14:14,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:14,643 INFO L93 Difference]: Finished difference Result 373712 states and 677322 transitions. [2019-10-02 12:14:14,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:14:14,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 207 [2019-10-02 12:14:14,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:15,775 INFO L225 Difference]: With dead ends: 373712 [2019-10-02 12:14:15,775 INFO L226 Difference]: Without dead ends: 186574 [2019-10-02 12:14:16,404 INFO L640 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-10-02 12:14:16,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186574 states. [2019-10-02 12:14:32,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186574 to 186574. [2019-10-02 12:14:32,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186574 states. [2019-10-02 12:14:33,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186574 states to 186574 states and 331006 transitions. [2019-10-02 12:14:33,749 INFO L78 Accepts]: Start accepts. Automaton has 186574 states and 331006 transitions. Word has length 207 [2019-10-02 12:14:33,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:14:33,750 INFO L475 AbstractCegarLoop]: Abstraction has 186574 states and 331006 transitions. [2019-10-02 12:14:33,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:14:33,750 INFO L276 IsEmpty]: Start isEmpty. Operand 186574 states and 331006 transitions. [2019-10-02 12:14:33,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-02 12:14:33,756 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:14:33,756 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:14:33,756 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:14:33,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:14:33,757 INFO L82 PathProgramCache]: Analyzing trace with hash 938136318, now seen corresponding path program 1 times [2019-10-02 12:14:33,757 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:14:33,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:14:33,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:33,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:14:33,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:14:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:14:34,949 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:14:34,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:14:34,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:14:34,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:14:34,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:14:34,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:14:34,951 INFO L87 Difference]: Start difference. First operand 186574 states and 331006 transitions. Second operand 6 states. [2019-10-02 12:14:51,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:51,659 INFO L93 Difference]: Finished difference Result 187031 states and 332795 transitions. [2019-10-02 12:14:51,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:14:51,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 208 [2019-10-02 12:14:51,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:52,620 INFO L225 Difference]: With dead ends: 187031 [2019-10-02 12:14:52,621 INFO L226 Difference]: Without dead ends: 187015 [2019-10-02 12:14:53,063 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:14:53,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187015 states. [2019-10-02 12:15:02,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187015 to 186676. [2019-10-02 12:15:02,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186676 states. [2019-10-02 12:15:04,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186676 states to 186676 states and 331108 transitions. [2019-10-02 12:15:04,893 INFO L78 Accepts]: Start accepts. Automaton has 186676 states and 331108 transitions. Word has length 208 [2019-10-02 12:15:04,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:04,893 INFO L475 AbstractCegarLoop]: Abstraction has 186676 states and 331108 transitions. [2019-10-02 12:15:04,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:15:04,893 INFO L276 IsEmpty]: Start isEmpty. Operand 186676 states and 331108 transitions. [2019-10-02 12:15:04,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-02 12:15:04,898 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:04,898 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:15:04,898 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:04,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:04,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1567176173, now seen corresponding path program 1 times [2019-10-02 12:15:04,899 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:04,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:04,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:04,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:04,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:05,050 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:15:05,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:05,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:15:05,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:15:05,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:15:05,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:15:05,051 INFO L87 Difference]: Start difference. First operand 186676 states and 331108 transitions. Second operand 8 states. [2019-10-02 12:15:20,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:20,773 INFO L93 Difference]: Finished difference Result 186760 states and 331228 transitions. [2019-10-02 12:15:20,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:15:20,773 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 213 [2019-10-02 12:15:20,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:22,022 INFO L225 Difference]: With dead ends: 186760 [2019-10-02 12:15:22,023 INFO L226 Difference]: Without dead ends: 186744 [2019-10-02 12:15:22,121 INFO L640 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-10-02 12:15:22,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186744 states. [2019-10-02 12:15:32,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186744 to 186676. [2019-10-02 12:15:32,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186676 states. [2019-10-02 12:15:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186676 states to 186676 states and 330916 transitions. [2019-10-02 12:15:34,235 INFO L78 Accepts]: Start accepts. Automaton has 186676 states and 330916 transitions. Word has length 213 [2019-10-02 12:15:34,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:34,235 INFO L475 AbstractCegarLoop]: Abstraction has 186676 states and 330916 transitions. [2019-10-02 12:15:34,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:15:34,235 INFO L276 IsEmpty]: Start isEmpty. Operand 186676 states and 330916 transitions. [2019-10-02 12:15:34,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-02 12:15:34,243 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:34,243 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:15:34,243 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:34,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:34,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1339931813, now seen corresponding path program 1 times [2019-10-02 12:15:34,244 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:34,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:34,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:34,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:34,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:34,414 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 12:15:34,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:34,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:15:34,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:15:34,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:15:34,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:15:34,416 INFO L87 Difference]: Start difference. First operand 186676 states and 330916 transitions. Second operand 9 states. [2019-10-02 12:15:58,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:58,510 INFO L93 Difference]: Finished difference Result 373683 states and 664253 transitions. [2019-10-02 12:15:58,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:15:58,510 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 232 [2019-10-02 12:15:58,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:59,720 INFO L225 Difference]: With dead ends: 373683 [2019-10-02 12:15:59,720 INFO L226 Difference]: Without dead ends: 187252 [2019-10-02 12:16:00,818 INFO L640 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-10-02 12:16:00,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187252 states. [2019-10-02 12:16:11,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187252 to 186676. [2019-10-02 12:16:11,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186676 states. [2019-10-02 12:16:12,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186676 states to 186676 states and 330724 transitions. [2019-10-02 12:16:12,966 INFO L78 Accepts]: Start accepts. Automaton has 186676 states and 330724 transitions. Word has length 232 [2019-10-02 12:16:12,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:12,967 INFO L475 AbstractCegarLoop]: Abstraction has 186676 states and 330724 transitions. [2019-10-02 12:16:12,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:16:12,967 INFO L276 IsEmpty]: Start isEmpty. Operand 186676 states and 330724 transitions. [2019-10-02 12:16:12,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-02 12:16:12,976 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:12,976 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:16:12,977 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:12,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:12,977 INFO L82 PathProgramCache]: Analyzing trace with hash -959168253, now seen corresponding path program 1 times [2019-10-02 12:16:12,977 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:12,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:12,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:12,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:12,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 12:16:14,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:14,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:16:14,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:16:14,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:16:14,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:16:14,506 INFO L87 Difference]: Start difference. First operand 186676 states and 330724 transitions. Second operand 9 states. [2019-10-02 12:17:01,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:17:01,059 INFO L93 Difference]: Finished difference Result 597158 states and 1076680 transitions. [2019-10-02 12:17:01,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:17:01,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 241 [2019-10-02 12:17:01,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:17:03,760 INFO L225 Difference]: With dead ends: 597158 [2019-10-02 12:17:03,760 INFO L226 Difference]: Without dead ends: 410591 [2019-10-02 12:17:05,175 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:17:05,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410591 states. [2019-10-02 12:17:41,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410591 to 392637. [2019-10-02 12:17:41,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392637 states. [2019-10-02 12:17:46,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392637 states to 392637 states and 709347 transitions. [2019-10-02 12:17:46,999 INFO L78 Accepts]: Start accepts. Automaton has 392637 states and 709347 transitions. Word has length 241 [2019-10-02 12:17:46,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:17:46,999 INFO L475 AbstractCegarLoop]: Abstraction has 392637 states and 709347 transitions. [2019-10-02 12:17:46,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:17:47,000 INFO L276 IsEmpty]: Start isEmpty. Operand 392637 states and 709347 transitions. [2019-10-02 12:17:47,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-02 12:17:47,011 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:17:47,012 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:17:47,012 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:17:47,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:17:47,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1778051072, now seen corresponding path program 1 times [2019-10-02 12:17:47,012 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:17:47,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:17:47,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:47,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:17:47,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:17:47,204 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 12:17:47,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:17:47,205 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:17:47,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:17:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:17:47,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 3460 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:17:47,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:17:47,945 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 12:17:47,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:17:47,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-10-02 12:17:47,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:17:47,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:17:47,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:17:47,956 INFO L87 Difference]: Start difference. First operand 392637 states and 709347 transitions. Second operand 14 states. [2019-10-02 12:18:49,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:18:49,134 INFO L93 Difference]: Finished difference Result 868877 states and 1620917 transitions. [2019-10-02 12:18:49,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:18:49,135 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 242 [2019-10-02 12:18:49,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:18:52,586 INFO L225 Difference]: With dead ends: 868877 [2019-10-02 12:18:52,586 INFO L226 Difference]: Without dead ends: 476349 [2019-10-02 12:18:55,464 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:18:55,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476349 states. [2019-10-02 12:19:44,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476349 to 439491. [2019-10-02 12:19:44,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439491 states.