/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:11:10,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:11:10,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:11:10,902 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:11:10,902 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:11:10,904 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:11:10,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:11:10,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:11:10,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:11:10,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:11:10,911 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:11:10,912 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:11:10,912 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:11:10,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:11:10,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:11:10,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:11:10,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:11:10,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:11:10,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:11:10,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:11:10,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:11:10,923 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:11:10,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:11:10,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:11:10,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:11:10,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:11:10,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:11:10,931 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:11:10,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:11:10,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:11:10,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:11:10,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:11:10,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:11:10,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:11:10,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:11:10,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:11:10,943 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:11:10,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:11:10,944 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:11:10,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:11:10,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:11:10,949 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-12-26 23:11:10,973 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:11:10,974 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:11:10,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:11:10,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:11:10,978 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:11:10,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:11:10,979 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:11:10,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:11:10,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:11:10,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:11:10,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:11:10,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:11:10,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:11:10,981 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:11:10,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:11:10,982 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:11:10,982 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:11:10,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:11:10,983 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:11:10,983 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:11:10,983 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:11:10,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:11:10,984 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:11:10,984 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:11:10,984 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:11:10,984 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:11:10,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:11:10,985 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:11:10,985 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:11:10,985 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:11:11,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:11:11,278 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:11:11,282 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:11:11,284 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:11:11,284 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:11:11,285 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_rmo.opt.i [2019-12-26 23:11:11,348 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c81d7faf/e1a17437f4fa4177ae20a384ad1b4c3a/FLAGefab5c5aa [2019-12-26 23:11:11,895 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:11:11,896 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_rmo.opt.i [2019-12-26 23:11:11,910 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c81d7faf/e1a17437f4fa4177ae20a384ad1b4c3a/FLAGefab5c5aa [2019-12-26 23:11:12,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c81d7faf/e1a17437f4fa4177ae20a384ad1b4c3a [2019-12-26 23:11:12,132 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:11:12,134 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:11:12,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:11:12,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:11:12,139 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:11:12,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:11:12" (1/1) ... [2019-12-26 23:11:12,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@736da25c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:12, skipping insertion in model container [2019-12-26 23:11:12,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:11:12" (1/1) ... [2019-12-26 23:11:12,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:11:12,203 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:11:12,753 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:11:12,765 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:11:12,874 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:11:12,951 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:11:12,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:12 WrapperNode [2019-12-26 23:11:12,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:11:12,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:11:12,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:11:12,952 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:11:12,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:12" (1/1) ... [2019-12-26 23:11:12,991 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:12" (1/1) ... [2019-12-26 23:11:13,035 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:11:13,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:11:13,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:11:13,036 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:11:13,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:12" (1/1) ... [2019-12-26 23:11:13,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:12" (1/1) ... [2019-12-26 23:11:13,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:12" (1/1) ... [2019-12-26 23:11:13,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:12" (1/1) ... [2019-12-26 23:11:13,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:12" (1/1) ... [2019-12-26 23:11:13,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:12" (1/1) ... [2019-12-26 23:11:13,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:12" (1/1) ... [2019-12-26 23:11:13,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:11:13,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:11:13,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:11:13,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:11:13,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:12" (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-12-26 23:11:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:11:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:11:13,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:11:13,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:11:13,168 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:11:13,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:11:13,169 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:11:13,170 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:11:13,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:11:13,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:11:13,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:11:13,174 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:11:14,270 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:11:14,270 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:11:14,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:11:14 BoogieIcfgContainer [2019-12-26 23:11:14,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:11:14,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:11:14,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:11:14,277 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:11:14,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:11:12" (1/3) ... [2019-12-26 23:11:14,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4411df08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:11:14, skipping insertion in model container [2019-12-26 23:11:14,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:12" (2/3) ... [2019-12-26 23:11:14,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4411df08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:11:14, skipping insertion in model container [2019-12-26 23:11:14,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:11:14" (3/3) ... [2019-12-26 23:11:14,284 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_rmo.opt.i [2019-12-26 23:11:14,295 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:11:14,295 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:11:14,308 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:11:14,309 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:11:14,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,362 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,362 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,393 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,393 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,393 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,394 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,394 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,421 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,423 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,425 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,426 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,427 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,431 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,433 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,435 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:14,450 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 23:11:14,471 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:11:14,471 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:11:14,471 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:11:14,471 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:11:14,471 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:11:14,472 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:11:14,472 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:11:14,472 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:11:14,490 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-26 23:11:14,492 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-26 23:11:14,677 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-26 23:11:14,678 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:11:14,734 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-26 23:11:14,844 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-26 23:11:14,965 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-26 23:11:14,966 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:11:14,988 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-26 23:11:15,038 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-26 23:11:15,039 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:11:22,724 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-26 23:11:22,835 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-26 23:11:22,969 INFO L206 etLargeBlockEncoding]: Checked pairs total: 326763 [2019-12-26 23:11:22,969 INFO L214 etLargeBlockEncoding]: Total number of compositions: 143 [2019-12-26 23:11:22,973 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 193 transitions [2019-12-26 23:11:37,918 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 116492 states. [2019-12-26 23:11:37,920 INFO L276 IsEmpty]: Start isEmpty. Operand 116492 states. [2019-12-26 23:11:37,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:11:37,927 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:37,927 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:11:37,928 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:37,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:37,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1351330582, now seen corresponding path program 1 times [2019-12-26 23:11:37,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:37,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737045408] [2019-12-26 23:11:37,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:38,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:11:38,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737045408] [2019-12-26 23:11:38,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:38,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:11:38,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438969956] [2019-12-26 23:11:38,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:11:38,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:38,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:11:38,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:11:38,196 INFO L87 Difference]: Start difference. First operand 116492 states. Second operand 3 states. [2019-12-26 23:11:41,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:41,693 INFO L93 Difference]: Finished difference Result 116456 states and 442542 transitions. [2019-12-26 23:11:41,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:11:41,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:11:41,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:42,563 INFO L225 Difference]: With dead ends: 116456 [2019-12-26 23:11:42,563 INFO L226 Difference]: Without dead ends: 114036 [2019-12-26 23:11:42,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:11:48,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114036 states. [2019-12-26 23:11:52,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114036 to 114036. [2019-12-26 23:11:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114036 states. [2019-12-26 23:11:53,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114036 states to 114036 states and 433940 transitions. [2019-12-26 23:11:53,428 INFO L78 Accepts]: Start accepts. Automaton has 114036 states and 433940 transitions. Word has length 5 [2019-12-26 23:11:53,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:53,429 INFO L462 AbstractCegarLoop]: Abstraction has 114036 states and 433940 transitions. [2019-12-26 23:11:53,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:11:53,429 INFO L276 IsEmpty]: Start isEmpty. Operand 114036 states and 433940 transitions. [2019-12-26 23:11:53,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:11:53,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:53,432 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:11:53,434 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:53,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:53,434 INFO L82 PathProgramCache]: Analyzing trace with hash -168516540, now seen corresponding path program 1 times [2019-12-26 23:11:53,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:53,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880097023] [2019-12-26 23:11:53,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:11:53,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880097023] [2019-12-26 23:11:53,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:53,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:11:53,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480898373] [2019-12-26 23:11:53,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:11:53,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:53,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:11:53,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:11:53,531 INFO L87 Difference]: Start difference. First operand 114036 states and 433940 transitions. Second operand 4 states. [2019-12-26 23:11:58,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:58,020 INFO L93 Difference]: Finished difference Result 152998 states and 565528 transitions. [2019-12-26 23:11:58,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:11:58,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:11:58,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:58,550 INFO L225 Difference]: With dead ends: 152998 [2019-12-26 23:11:58,550 INFO L226 Difference]: Without dead ends: 152998 [2019-12-26 23:11:58,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-26 23:12:04,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152998 states. [2019-12-26 23:12:07,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152998 to 152836. [2019-12-26 23:12:07,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152836 states. [2019-12-26 23:12:08,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152836 states to 152836 states and 565076 transitions. [2019-12-26 23:12:08,092 INFO L78 Accepts]: Start accepts. Automaton has 152836 states and 565076 transitions. Word has length 11 [2019-12-26 23:12:08,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:08,093 INFO L462 AbstractCegarLoop]: Abstraction has 152836 states and 565076 transitions. [2019-12-26 23:12:08,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:12:08,093 INFO L276 IsEmpty]: Start isEmpty. Operand 152836 states and 565076 transitions. [2019-12-26 23:12:08,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:12:08,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:08,096 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:12:08,096 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:08,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:08,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1184191968, now seen corresponding path program 1 times [2019-12-26 23:12:08,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:08,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046937712] [2019-12-26 23:12:08,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:08,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:08,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046937712] [2019-12-26 23:12:08,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:08,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:12:08,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176680370] [2019-12-26 23:12:08,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:12:08,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:08,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:12:08,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:12:08,172 INFO L87 Difference]: Start difference. First operand 152836 states and 565076 transitions. Second operand 4 states. [2019-12-26 23:12:14,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:14,868 INFO L93 Difference]: Finished difference Result 198503 states and 719540 transitions. [2019-12-26 23:12:14,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:12:14,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:12:14,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:15,710 INFO L225 Difference]: With dead ends: 198503 [2019-12-26 23:12:15,710 INFO L226 Difference]: Without dead ends: 198503 [2019-12-26 23:12:15,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-26 23:12:22,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198503 states. [2019-12-26 23:12:25,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198503 to 184484. [2019-12-26 23:12:25,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184484 states. [2019-12-26 23:12:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184484 states to 184484 states and 671271 transitions. [2019-12-26 23:12:25,988 INFO L78 Accepts]: Start accepts. Automaton has 184484 states and 671271 transitions. Word has length 11 [2019-12-26 23:12:25,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:25,989 INFO L462 AbstractCegarLoop]: Abstraction has 184484 states and 671271 transitions. [2019-12-26 23:12:25,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:12:25,989 INFO L276 IsEmpty]: Start isEmpty. Operand 184484 states and 671271 transitions. [2019-12-26 23:12:25,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 23:12:25,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:25,996 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:12:25,996 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:25,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:25,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1389779890, now seen corresponding path program 1 times [2019-12-26 23:12:25,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:25,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178769911] [2019-12-26 23:12:25,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:26,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178769911] [2019-12-26 23:12:26,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:26,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:12:26,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635475141] [2019-12-26 23:12:26,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:12:26,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:26,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:12:26,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:12:26,119 INFO L87 Difference]: Start difference. First operand 184484 states and 671271 transitions. Second operand 4 states. [2019-12-26 23:12:26,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:26,195 INFO L93 Difference]: Finished difference Result 11993 states and 33125 transitions. [2019-12-26 23:12:26,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:12:26,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-26 23:12:26,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:26,206 INFO L225 Difference]: With dead ends: 11993 [2019-12-26 23:12:26,206 INFO L226 Difference]: Without dead ends: 8737 [2019-12-26 23:12:26,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-26 23:12:26,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8737 states. [2019-12-26 23:12:26,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8737 to 8729. [2019-12-26 23:12:26,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8729 states. [2019-12-26 23:12:26,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8729 states to 8729 states and 21886 transitions. [2019-12-26 23:12:26,310 INFO L78 Accepts]: Start accepts. Automaton has 8729 states and 21886 transitions. Word has length 17 [2019-12-26 23:12:26,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:26,311 INFO L462 AbstractCegarLoop]: Abstraction has 8729 states and 21886 transitions. [2019-12-26 23:12:26,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:12:26,311 INFO L276 IsEmpty]: Start isEmpty. Operand 8729 states and 21886 transitions. [2019-12-26 23:12:26,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:12:26,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:26,313 INFO L411 BasicCegarLoop]: trace histogram [1, 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-12-26 23:12:26,313 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:26,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:26,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1044109860, now seen corresponding path program 1 times [2019-12-26 23:12:26,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:26,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065429933] [2019-12-26 23:12:26,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:26,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:26,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065429933] [2019-12-26 23:12:26,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:26,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:12:26,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954300524] [2019-12-26 23:12:26,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:12:26,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:26,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:12:26,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:12:26,471 INFO L87 Difference]: Start difference. First operand 8729 states and 21886 transitions. Second operand 6 states. [2019-12-26 23:12:27,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:27,709 INFO L93 Difference]: Finished difference Result 10286 states and 25434 transitions. [2019-12-26 23:12:27,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:12:27,709 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-26 23:12:27,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:27,720 INFO L225 Difference]: With dead ends: 10286 [2019-12-26 23:12:27,720 INFO L226 Difference]: Without dead ends: 10286 [2019-12-26 23:12:27,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:12:27,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10286 states. [2019-12-26 23:12:27,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10286 to 10191. [2019-12-26 23:12:27,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10191 states. [2019-12-26 23:12:27,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10191 states to 10191 states and 25249 transitions. [2019-12-26 23:12:27,837 INFO L78 Accepts]: Start accepts. Automaton has 10191 states and 25249 transitions. Word has length 25 [2019-12-26 23:12:27,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:27,838 INFO L462 AbstractCegarLoop]: Abstraction has 10191 states and 25249 transitions. [2019-12-26 23:12:27,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:12:27,838 INFO L276 IsEmpty]: Start isEmpty. Operand 10191 states and 25249 transitions. [2019-12-26 23:12:27,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-26 23:12:27,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:27,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:27,845 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:27,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:27,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1864535946, now seen corresponding path program 1 times [2019-12-26 23:12:27,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:27,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531511298] [2019-12-26 23:12:27,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:27,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:27,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531511298] [2019-12-26 23:12:27,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:27,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:12:27,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72126725] [2019-12-26 23:12:27,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:12:27,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:27,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:12:27,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:12:27,956 INFO L87 Difference]: Start difference. First operand 10191 states and 25249 transitions. Second operand 6 states. [2019-12-26 23:12:28,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:28,885 INFO L93 Difference]: Finished difference Result 11186 states and 27316 transitions. [2019-12-26 23:12:28,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:12:28,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-26 23:12:28,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:28,898 INFO L225 Difference]: With dead ends: 11186 [2019-12-26 23:12:28,899 INFO L226 Difference]: Without dead ends: 11138 [2019-12-26 23:12:28,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:12:28,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11138 states. [2019-12-26 23:12:29,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11138 to 10951. [2019-12-26 23:12:29,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10951 states. [2019-12-26 23:12:29,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10951 states to 10951 states and 26866 transitions. [2019-12-26 23:12:29,038 INFO L78 Accepts]: Start accepts. Automaton has 10951 states and 26866 transitions. Word has length 38 [2019-12-26 23:12:29,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:29,038 INFO L462 AbstractCegarLoop]: Abstraction has 10951 states and 26866 transitions. [2019-12-26 23:12:29,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:12:29,039 INFO L276 IsEmpty]: Start isEmpty. Operand 10951 states and 26866 transitions. [2019-12-26 23:12:29,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-26 23:12:29,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:29,048 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:29,048 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:29,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:29,049 INFO L82 PathProgramCache]: Analyzing trace with hash -555471960, now seen corresponding path program 1 times [2019-12-26 23:12:29,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:29,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16114398] [2019-12-26 23:12:29,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:29,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:29,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16114398] [2019-12-26 23:12:29,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:29,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:12:29,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667501297] [2019-12-26 23:12:29,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:12:29,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:29,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:12:29,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:12:29,187 INFO L87 Difference]: Start difference. First operand 10951 states and 26866 transitions. Second operand 7 states. [2019-12-26 23:12:30,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:30,460 INFO L93 Difference]: Finished difference Result 13021 states and 31545 transitions. [2019-12-26 23:12:30,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 23:12:30,461 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-26 23:12:30,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:30,479 INFO L225 Difference]: With dead ends: 13021 [2019-12-26 23:12:30,479 INFO L226 Difference]: Without dead ends: 13021 [2019-12-26 23:12:30,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:12:30,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13021 states. [2019-12-26 23:12:30,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13021 to 11791. [2019-12-26 23:12:30,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11791 states. [2019-12-26 23:12:30,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11791 states to 11791 states and 28782 transitions. [2019-12-26 23:12:30,631 INFO L78 Accepts]: Start accepts. Automaton has 11791 states and 28782 transitions. Word has length 50 [2019-12-26 23:12:30,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:30,632 INFO L462 AbstractCegarLoop]: Abstraction has 11791 states and 28782 transitions. [2019-12-26 23:12:30,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:12:30,632 INFO L276 IsEmpty]: Start isEmpty. Operand 11791 states and 28782 transitions. [2019-12-26 23:12:30,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 23:12:30,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:30,644 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:30,645 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:30,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:30,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1176117867, now seen corresponding path program 1 times [2019-12-26 23:12:30,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:30,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022109961] [2019-12-26 23:12:30,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:30,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022109961] [2019-12-26 23:12:30,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:30,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:12:30,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059945038] [2019-12-26 23:12:30,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:12:30,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:30,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:12:30,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:12:30,788 INFO L87 Difference]: Start difference. First operand 11791 states and 28782 transitions. Second operand 5 states. [2019-12-26 23:12:31,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:31,722 INFO L93 Difference]: Finished difference Result 13152 states and 31669 transitions. [2019-12-26 23:12:31,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:12:31,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-26 23:12:31,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:31,738 INFO L225 Difference]: With dead ends: 13152 [2019-12-26 23:12:31,738 INFO L226 Difference]: Without dead ends: 13152 [2019-12-26 23:12:31,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:12:31,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13152 states. [2019-12-26 23:12:31,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13152 to 12781. [2019-12-26 23:12:31,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12781 states. [2019-12-26 23:12:31,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12781 states to 12781 states and 30933 transitions. [2019-12-26 23:12:31,883 INFO L78 Accepts]: Start accepts. Automaton has 12781 states and 30933 transitions. Word has length 57 [2019-12-26 23:12:31,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:31,884 INFO L462 AbstractCegarLoop]: Abstraction has 12781 states and 30933 transitions. [2019-12-26 23:12:31,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:12:31,884 INFO L276 IsEmpty]: Start isEmpty. Operand 12781 states and 30933 transitions. [2019-12-26 23:12:31,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 23:12:31,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:31,893 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:31,893 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:31,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:31,893 INFO L82 PathProgramCache]: Analyzing trace with hash -313859631, now seen corresponding path program 1 times [2019-12-26 23:12:31,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:31,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594371581] [2019-12-26 23:12:31,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:32,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:32,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594371581] [2019-12-26 23:12:32,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:32,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:12:32,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520874663] [2019-12-26 23:12:32,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:12:32,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:32,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:12:32,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:12:32,048 INFO L87 Difference]: Start difference. First operand 12781 states and 30933 transitions. Second operand 5 states. [2019-12-26 23:12:32,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:32,503 INFO L93 Difference]: Finished difference Result 13209 states and 31846 transitions. [2019-12-26 23:12:32,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:12:32,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-26 23:12:32,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:32,517 INFO L225 Difference]: With dead ends: 13209 [2019-12-26 23:12:32,517 INFO L226 Difference]: Without dead ends: 13009 [2019-12-26 23:12:32,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:12:32,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13009 states. [2019-12-26 23:12:32,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13009 to 12709. [2019-12-26 23:12:32,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12709 states. [2019-12-26 23:12:32,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12709 states to 12709 states and 30712 transitions. [2019-12-26 23:12:32,668 INFO L78 Accepts]: Start accepts. Automaton has 12709 states and 30712 transitions. Word has length 58 [2019-12-26 23:12:32,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:32,669 INFO L462 AbstractCegarLoop]: Abstraction has 12709 states and 30712 transitions. [2019-12-26 23:12:32,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:12:32,669 INFO L276 IsEmpty]: Start isEmpty. Operand 12709 states and 30712 transitions. [2019-12-26 23:12:32,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:12:32,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:32,680 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:32,680 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:32,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:32,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1587335685, now seen corresponding path program 1 times [2019-12-26 23:12:32,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:32,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178516860] [2019-12-26 23:12:32,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:32,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178516860] [2019-12-26 23:12:32,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:32,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:12:32,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187714751] [2019-12-26 23:12:32,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:12:32,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:32,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:12:32,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:12:32,789 INFO L87 Difference]: Start difference. First operand 12709 states and 30712 transitions. Second operand 5 states. [2019-12-26 23:12:32,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:32,842 INFO L93 Difference]: Finished difference Result 5405 states and 12587 transitions. [2019-12-26 23:12:32,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:12:32,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-26 23:12:32,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:32,849 INFO L225 Difference]: With dead ends: 5405 [2019-12-26 23:12:32,849 INFO L226 Difference]: Without dead ends: 5151 [2019-12-26 23:12:32,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:12:32,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5151 states. [2019-12-26 23:12:32,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5151 to 4998. [2019-12-26 23:12:32,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4998 states. [2019-12-26 23:12:32,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4998 states to 4998 states and 11757 transitions. [2019-12-26 23:12:32,903 INFO L78 Accepts]: Start accepts. Automaton has 4998 states and 11757 transitions. Word has length 64 [2019-12-26 23:12:32,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:32,904 INFO L462 AbstractCegarLoop]: Abstraction has 4998 states and 11757 transitions. [2019-12-26 23:12:32,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:12:32,904 INFO L276 IsEmpty]: Start isEmpty. Operand 4998 states and 11757 transitions. [2019-12-26 23:12:32,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:12:32,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:32,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:32,911 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:32,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:32,911 INFO L82 PathProgramCache]: Analyzing trace with hash 608253419, now seen corresponding path program 1 times [2019-12-26 23:12:32,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:32,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689363587] [2019-12-26 23:12:32,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:33,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689363587] [2019-12-26 23:12:33,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:33,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:12:33,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364468052] [2019-12-26 23:12:33,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:12:33,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:33,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:12:33,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:12:33,013 INFO L87 Difference]: Start difference. First operand 4998 states and 11757 transitions. Second operand 6 states. [2019-12-26 23:12:33,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:33,840 INFO L93 Difference]: Finished difference Result 6626 states and 15449 transitions. [2019-12-26 23:12:33,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:12:33,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-26 23:12:33,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:33,848 INFO L225 Difference]: With dead ends: 6626 [2019-12-26 23:12:33,849 INFO L226 Difference]: Without dead ends: 6626 [2019-12-26 23:12:33,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:12:33,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6626 states. [2019-12-26 23:12:33,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6626 to 6177. [2019-12-26 23:12:33,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6177 states. [2019-12-26 23:12:33,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6177 states to 6177 states and 14495 transitions. [2019-12-26 23:12:33,917 INFO L78 Accepts]: Start accepts. Automaton has 6177 states and 14495 transitions. Word has length 94 [2019-12-26 23:12:33,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:33,918 INFO L462 AbstractCegarLoop]: Abstraction has 6177 states and 14495 transitions. [2019-12-26 23:12:33,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:12:33,918 INFO L276 IsEmpty]: Start isEmpty. Operand 6177 states and 14495 transitions. [2019-12-26 23:12:33,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:12:33,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:33,926 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:33,926 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:33,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:33,926 INFO L82 PathProgramCache]: Analyzing trace with hash 577720363, now seen corresponding path program 2 times [2019-12-26 23:12:33,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:33,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221890135] [2019-12-26 23:12:33,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:34,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:34,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221890135] [2019-12-26 23:12:34,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:34,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:12:34,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253214791] [2019-12-26 23:12:34,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:12:34,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:34,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:12:34,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:12:34,064 INFO L87 Difference]: Start difference. First operand 6177 states and 14495 transitions. Second operand 7 states. [2019-12-26 23:12:35,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:35,047 INFO L93 Difference]: Finished difference Result 7484 states and 17393 transitions. [2019-12-26 23:12:35,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:12:35,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-26 23:12:35,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:35,057 INFO L225 Difference]: With dead ends: 7484 [2019-12-26 23:12:35,057 INFO L226 Difference]: Without dead ends: 7484 [2019-12-26 23:12:35,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:12:35,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7484 states. [2019-12-26 23:12:35,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7484 to 6666. [2019-12-26 23:12:35,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6666 states. [2019-12-26 23:12:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6666 states to 6666 states and 15594 transitions. [2019-12-26 23:12:35,133 INFO L78 Accepts]: Start accepts. Automaton has 6666 states and 15594 transitions. Word has length 94 [2019-12-26 23:12:35,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:35,134 INFO L462 AbstractCegarLoop]: Abstraction has 6666 states and 15594 transitions. [2019-12-26 23:12:35,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:12:35,134 INFO L276 IsEmpty]: Start isEmpty. Operand 6666 states and 15594 transitions. [2019-12-26 23:12:35,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:12:35,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:35,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:35,142 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:35,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:35,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1726596845, now seen corresponding path program 3 times [2019-12-26 23:12:35,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:35,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208154543] [2019-12-26 23:12:35,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:35,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:35,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208154543] [2019-12-26 23:12:35,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:35,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:12:35,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069365990] [2019-12-26 23:12:35,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:12:35,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:35,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:12:35,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:12:35,245 INFO L87 Difference]: Start difference. First operand 6666 states and 15594 transitions. Second operand 5 states. [2019-12-26 23:12:35,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:35,743 INFO L93 Difference]: Finished difference Result 7181 states and 16661 transitions. [2019-12-26 23:12:35,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:12:35,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-26 23:12:35,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:35,752 INFO L225 Difference]: With dead ends: 7181 [2019-12-26 23:12:35,752 INFO L226 Difference]: Without dead ends: 7181 [2019-12-26 23:12:35,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:12:35,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7181 states. [2019-12-26 23:12:35,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7181 to 6807. [2019-12-26 23:12:35,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6807 states. [2019-12-26 23:12:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6807 states to 6807 states and 15915 transitions. [2019-12-26 23:12:35,827 INFO L78 Accepts]: Start accepts. Automaton has 6807 states and 15915 transitions. Word has length 94 [2019-12-26 23:12:35,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:35,827 INFO L462 AbstractCegarLoop]: Abstraction has 6807 states and 15915 transitions. [2019-12-26 23:12:35,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:12:35,827 INFO L276 IsEmpty]: Start isEmpty. Operand 6807 states and 15915 transitions. [2019-12-26 23:12:35,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:12:35,835 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:35,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:35,836 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:35,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:35,836 INFO L82 PathProgramCache]: Analyzing trace with hash 2017255555, now seen corresponding path program 4 times [2019-12-26 23:12:35,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:35,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667509163] [2019-12-26 23:12:35,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:36,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:36,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667509163] [2019-12-26 23:12:36,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:36,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:12:36,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110132556] [2019-12-26 23:12:36,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:12:36,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:36,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:12:36,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:12:36,086 INFO L87 Difference]: Start difference. First operand 6807 states and 15915 transitions. Second operand 9 states. [2019-12-26 23:12:36,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:36,891 INFO L93 Difference]: Finished difference Result 11764 states and 27394 transitions. [2019-12-26 23:12:36,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 23:12:36,891 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-12-26 23:12:36,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:36,903 INFO L225 Difference]: With dead ends: 11764 [2019-12-26 23:12:36,903 INFO L226 Difference]: Without dead ends: 9643 [2019-12-26 23:12:36,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-12-26 23:12:36,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9643 states. [2019-12-26 23:12:36,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9643 to 8114. [2019-12-26 23:12:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8114 states. [2019-12-26 23:12:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8114 states to 8114 states and 19148 transitions. [2019-12-26 23:12:37,002 INFO L78 Accepts]: Start accepts. Automaton has 8114 states and 19148 transitions. Word has length 94 [2019-12-26 23:12:37,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:37,002 INFO L462 AbstractCegarLoop]: Abstraction has 8114 states and 19148 transitions. [2019-12-26 23:12:37,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:12:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand 8114 states and 19148 transitions. [2019-12-26 23:12:37,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:12:37,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:37,014 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:37,014 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:37,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:37,015 INFO L82 PathProgramCache]: Analyzing trace with hash 644265771, now seen corresponding path program 5 times [2019-12-26 23:12:37,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:37,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356132324] [2019-12-26 23:12:37,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:37,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:37,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356132324] [2019-12-26 23:12:37,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:37,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:12:37,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159941751] [2019-12-26 23:12:37,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:12:37,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:37,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:12:37,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:12:37,121 INFO L87 Difference]: Start difference. First operand 8114 states and 19148 transitions. Second operand 6 states. [2019-12-26 23:12:37,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:37,772 INFO L93 Difference]: Finished difference Result 8538 states and 19980 transitions. [2019-12-26 23:12:37,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:12:37,773 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-26 23:12:37,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:37,786 INFO L225 Difference]: With dead ends: 8538 [2019-12-26 23:12:37,786 INFO L226 Difference]: Without dead ends: 8538 [2019-12-26 23:12:37,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:12:37,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8538 states. [2019-12-26 23:12:38,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8538 to 8226. [2019-12-26 23:12:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8226 states. [2019-12-26 23:12:38,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8226 states to 8226 states and 19377 transitions. [2019-12-26 23:12:38,264 INFO L78 Accepts]: Start accepts. Automaton has 8226 states and 19377 transitions. Word has length 94 [2019-12-26 23:12:38,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:38,265 INFO L462 AbstractCegarLoop]: Abstraction has 8226 states and 19377 transitions. [2019-12-26 23:12:38,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:12:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand 8226 states and 19377 transitions. [2019-12-26 23:12:38,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:12:38,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:38,280 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:38,280 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:38,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:38,281 INFO L82 PathProgramCache]: Analyzing trace with hash 12884261, now seen corresponding path program 6 times [2019-12-26 23:12:38,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:38,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659169303] [2019-12-26 23:12:38,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:38,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:38,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659169303] [2019-12-26 23:12:38,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:38,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:12:38,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321241584] [2019-12-26 23:12:38,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:12:38,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:38,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:12:38,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:12:38,406 INFO L87 Difference]: Start difference. First operand 8226 states and 19377 transitions. Second operand 6 states. [2019-12-26 23:12:39,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:39,454 INFO L93 Difference]: Finished difference Result 13999 states and 32368 transitions. [2019-12-26 23:12:39,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:12:39,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-26 23:12:39,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:39,473 INFO L225 Difference]: With dead ends: 13999 [2019-12-26 23:12:39,473 INFO L226 Difference]: Without dead ends: 13999 [2019-12-26 23:12:39,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:12:39,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13999 states. [2019-12-26 23:12:39,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13999 to 10884. [2019-12-26 23:12:39,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10884 states. [2019-12-26 23:12:39,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10884 states to 10884 states and 25960 transitions. [2019-12-26 23:12:39,613 INFO L78 Accepts]: Start accepts. Automaton has 10884 states and 25960 transitions. Word has length 94 [2019-12-26 23:12:39,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:39,613 INFO L462 AbstractCegarLoop]: Abstraction has 10884 states and 25960 transitions. [2019-12-26 23:12:39,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:12:39,613 INFO L276 IsEmpty]: Start isEmpty. Operand 10884 states and 25960 transitions. [2019-12-26 23:12:39,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:12:39,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:39,622 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:39,622 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:39,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:39,623 INFO L82 PathProgramCache]: Analyzing trace with hash -734364891, now seen corresponding path program 7 times [2019-12-26 23:12:39,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:39,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409285014] [2019-12-26 23:12:39,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:39,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:39,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409285014] [2019-12-26 23:12:39,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:39,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:12:39,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093531945] [2019-12-26 23:12:39,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:12:39,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:39,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:12:39,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:12:39,727 INFO L87 Difference]: Start difference. First operand 10884 states and 25960 transitions. Second operand 7 states. [2019-12-26 23:12:40,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:40,722 INFO L93 Difference]: Finished difference Result 13626 states and 31580 transitions. [2019-12-26 23:12:40,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:12:40,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-26 23:12:40,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:40,739 INFO L225 Difference]: With dead ends: 13626 [2019-12-26 23:12:40,739 INFO L226 Difference]: Without dead ends: 13626 [2019-12-26 23:12:40,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:12:40,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13626 states. [2019-12-26 23:12:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13626 to 10968. [2019-12-26 23:12:40,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10968 states. [2019-12-26 23:12:40,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10968 states to 10968 states and 26132 transitions. [2019-12-26 23:12:40,882 INFO L78 Accepts]: Start accepts. Automaton has 10968 states and 26132 transitions. Word has length 94 [2019-12-26 23:12:40,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:40,882 INFO L462 AbstractCegarLoop]: Abstraction has 10968 states and 26132 transitions. [2019-12-26 23:12:40,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:12:40,882 INFO L276 IsEmpty]: Start isEmpty. Operand 10968 states and 26132 transitions. [2019-12-26 23:12:40,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:12:40,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:40,893 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:40,893 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:40,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:40,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1719939527, now seen corresponding path program 8 times [2019-12-26 23:12:40,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:40,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884518059] [2019-12-26 23:12:40,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:40,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:40,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884518059] [2019-12-26 23:12:40,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:40,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:12:40,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158455789] [2019-12-26 23:12:40,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:12:40,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:40,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:12:40,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:12:40,994 INFO L87 Difference]: Start difference. First operand 10968 states and 26132 transitions. Second operand 7 states. [2019-12-26 23:12:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:41,835 INFO L93 Difference]: Finished difference Result 25974 states and 61526 transitions. [2019-12-26 23:12:41,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:12:41,835 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-26 23:12:41,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:41,865 INFO L225 Difference]: With dead ends: 25974 [2019-12-26 23:12:41,865 INFO L226 Difference]: Without dead ends: 25974 [2019-12-26 23:12:41,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:12:41,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25974 states. [2019-12-26 23:12:42,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25974 to 11006. [2019-12-26 23:12:42,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11006 states. [2019-12-26 23:12:42,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11006 states to 11006 states and 26222 transitions. [2019-12-26 23:12:42,056 INFO L78 Accepts]: Start accepts. Automaton has 11006 states and 26222 transitions. Word has length 94 [2019-12-26 23:12:42,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:42,056 INFO L462 AbstractCegarLoop]: Abstraction has 11006 states and 26222 transitions. [2019-12-26 23:12:42,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:12:42,057 INFO L276 IsEmpty]: Start isEmpty. Operand 11006 states and 26222 transitions. [2019-12-26 23:12:42,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:12:42,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:42,068 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:42,068 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:42,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:42,069 INFO L82 PathProgramCache]: Analyzing trace with hash 724908229, now seen corresponding path program 9 times [2019-12-26 23:12:42,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:42,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133967031] [2019-12-26 23:12:42,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:42,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:42,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133967031] [2019-12-26 23:12:42,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:42,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:12:42,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362310977] [2019-12-26 23:12:42,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:12:42,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:42,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:12:42,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:12:42,164 INFO L87 Difference]: Start difference. First operand 11006 states and 26222 transitions. Second operand 7 states. [2019-12-26 23:12:43,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:43,127 INFO L93 Difference]: Finished difference Result 15101 states and 35406 transitions. [2019-12-26 23:12:43,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:12:43,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-26 23:12:43,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:43,145 INFO L225 Difference]: With dead ends: 15101 [2019-12-26 23:12:43,145 INFO L226 Difference]: Without dead ends: 15101 [2019-12-26 23:12:43,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:12:43,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15101 states. [2019-12-26 23:12:43,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15101 to 11093. [2019-12-26 23:12:43,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11093 states. [2019-12-26 23:12:43,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11093 states to 11093 states and 26432 transitions. [2019-12-26 23:12:43,579 INFO L78 Accepts]: Start accepts. Automaton has 11093 states and 26432 transitions. Word has length 94 [2019-12-26 23:12:43,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:43,579 INFO L462 AbstractCegarLoop]: Abstraction has 11093 states and 26432 transitions. [2019-12-26 23:12:43,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:12:43,579 INFO L276 IsEmpty]: Start isEmpty. Operand 11093 states and 26432 transitions. [2019-12-26 23:12:43,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:12:43,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:43,593 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:43,593 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:43,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:43,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1585913151, now seen corresponding path program 10 times [2019-12-26 23:12:43,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:43,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354082977] [2019-12-26 23:12:43,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:43,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:43,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354082977] [2019-12-26 23:12:43,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:43,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:12:43,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215406697] [2019-12-26 23:12:43,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:12:43,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:43,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:12:43,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:12:43,691 INFO L87 Difference]: Start difference. First operand 11093 states and 26432 transitions. Second operand 7 states. [2019-12-26 23:12:44,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:44,672 INFO L93 Difference]: Finished difference Result 14445 states and 33895 transitions. [2019-12-26 23:12:44,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:12:44,677 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-26 23:12:44,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:44,692 INFO L225 Difference]: With dead ends: 14445 [2019-12-26 23:12:44,692 INFO L226 Difference]: Without dead ends: 14445 [2019-12-26 23:12:44,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:12:44,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14445 states. [2019-12-26 23:12:44,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14445 to 11011. [2019-12-26 23:12:44,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11011 states. [2019-12-26 23:12:44,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11011 states to 11011 states and 26259 transitions. [2019-12-26 23:12:44,830 INFO L78 Accepts]: Start accepts. Automaton has 11011 states and 26259 transitions. Word has length 94 [2019-12-26 23:12:44,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:44,830 INFO L462 AbstractCegarLoop]: Abstraction has 11011 states and 26259 transitions. [2019-12-26 23:12:44,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:12:44,830 INFO L276 IsEmpty]: Start isEmpty. Operand 11011 states and 26259 transitions. [2019-12-26 23:12:44,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-26 23:12:44,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:44,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:44,841 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:44,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:44,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1986577122, now seen corresponding path program 1 times [2019-12-26 23:12:44,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:44,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370851715] [2019-12-26 23:12:44,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:44,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:44,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370851715] [2019-12-26 23:12:44,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:44,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:12:44,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417911731] [2019-12-26 23:12:44,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:12:44,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:44,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:12:44,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:12:44,958 INFO L87 Difference]: Start difference. First operand 11011 states and 26259 transitions. Second operand 7 states. [2019-12-26 23:12:45,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:45,714 INFO L93 Difference]: Finished difference Result 12306 states and 28970 transitions. [2019-12-26 23:12:45,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:12:45,715 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-26 23:12:45,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:45,730 INFO L225 Difference]: With dead ends: 12306 [2019-12-26 23:12:45,730 INFO L226 Difference]: Without dead ends: 12306 [2019-12-26 23:12:45,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:12:45,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12306 states. [2019-12-26 23:12:45,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12306 to 11086. [2019-12-26 23:12:45,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11086 states. [2019-12-26 23:12:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11086 states to 11086 states and 26442 transitions. [2019-12-26 23:12:45,890 INFO L78 Accepts]: Start accepts. Automaton has 11086 states and 26442 transitions. Word has length 95 [2019-12-26 23:12:45,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:45,890 INFO L462 AbstractCegarLoop]: Abstraction has 11086 states and 26442 transitions. [2019-12-26 23:12:45,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:12:45,891 INFO L276 IsEmpty]: Start isEmpty. Operand 11086 states and 26442 transitions. [2019-12-26 23:12:45,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-26 23:12:45,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:45,900 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:45,900 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:45,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:45,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1018864798, now seen corresponding path program 2 times [2019-12-26 23:12:45,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:45,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954880796] [2019-12-26 23:12:45,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:46,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:46,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954880796] [2019-12-26 23:12:46,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:46,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:12:46,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547818391] [2019-12-26 23:12:46,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:12:46,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:46,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:12:46,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:12:46,023 INFO L87 Difference]: Start difference. First operand 11086 states and 26442 transitions. Second operand 7 states. [2019-12-26 23:12:46,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:46,926 INFO L93 Difference]: Finished difference Result 12242 states and 28811 transitions. [2019-12-26 23:12:46,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:12:46,926 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-26 23:12:46,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:46,940 INFO L225 Difference]: With dead ends: 12242 [2019-12-26 23:12:46,940 INFO L226 Difference]: Without dead ends: 12242 [2019-12-26 23:12:46,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:12:46,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12242 states. [2019-12-26 23:12:47,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12242 to 11044. [2019-12-26 23:12:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11044 states. [2019-12-26 23:12:47,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11044 states to 11044 states and 26346 transitions. [2019-12-26 23:12:47,072 INFO L78 Accepts]: Start accepts. Automaton has 11044 states and 26346 transitions. Word has length 95 [2019-12-26 23:12:47,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:47,072 INFO L462 AbstractCegarLoop]: Abstraction has 11044 states and 26346 transitions. [2019-12-26 23:12:47,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:12:47,072 INFO L276 IsEmpty]: Start isEmpty. Operand 11044 states and 26346 transitions. [2019-12-26 23:12:47,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-26 23:12:47,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:47,083 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:47,083 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:47,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:47,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1103429564, now seen corresponding path program 3 times [2019-12-26 23:12:47,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:47,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575698545] [2019-12-26 23:12:47,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:47,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:47,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575698545] [2019-12-26 23:12:47,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:47,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:12:47,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343118485] [2019-12-26 23:12:47,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:12:47,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:47,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:12:47,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:12:47,162 INFO L87 Difference]: Start difference. First operand 11044 states and 26346 transitions. Second operand 3 states. [2019-12-26 23:12:47,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:47,248 INFO L93 Difference]: Finished difference Result 11044 states and 26345 transitions. [2019-12-26 23:12:47,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:12:47,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-26 23:12:47,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:47,264 INFO L225 Difference]: With dead ends: 11044 [2019-12-26 23:12:47,264 INFO L226 Difference]: Without dead ends: 11044 [2019-12-26 23:12:47,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:12:47,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11044 states. [2019-12-26 23:12:47,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11044 to 10665. [2019-12-26 23:12:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10665 states. [2019-12-26 23:12:47,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10665 states to 10665 states and 25586 transitions. [2019-12-26 23:12:47,445 INFO L78 Accepts]: Start accepts. Automaton has 10665 states and 25586 transitions. Word has length 95 [2019-12-26 23:12:47,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:47,446 INFO L462 AbstractCegarLoop]: Abstraction has 10665 states and 25586 transitions. [2019-12-26 23:12:47,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:12:47,446 INFO L276 IsEmpty]: Start isEmpty. Operand 10665 states and 25586 transitions. [2019-12-26 23:12:47,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-26 23:12:47,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:47,459 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:47,459 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:47,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:47,459 INFO L82 PathProgramCache]: Analyzing trace with hash 283458299, now seen corresponding path program 1 times [2019-12-26 23:12:47,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:47,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955764291] [2019-12-26 23:12:47,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:47,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:47,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955764291] [2019-12-26 23:12:47,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:47,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:12:47,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545887155] [2019-12-26 23:12:47,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:12:47,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:47,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:12:47,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:12:47,529 INFO L87 Difference]: Start difference. First operand 10665 states and 25586 transitions. Second operand 3 states. [2019-12-26 23:12:47,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:47,616 INFO L93 Difference]: Finished difference Result 7594 states and 18151 transitions. [2019-12-26 23:12:47,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:12:47,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-26 23:12:47,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:47,629 INFO L225 Difference]: With dead ends: 7594 [2019-12-26 23:12:47,630 INFO L226 Difference]: Without dead ends: 7594 [2019-12-26 23:12:47,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:12:47,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7594 states. [2019-12-26 23:12:47,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7594 to 7580. [2019-12-26 23:12:47,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7580 states. [2019-12-26 23:12:47,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7580 states to 7580 states and 18125 transitions. [2019-12-26 23:12:47,764 INFO L78 Accepts]: Start accepts. Automaton has 7580 states and 18125 transitions. Word has length 95 [2019-12-26 23:12:47,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:47,764 INFO L462 AbstractCegarLoop]: Abstraction has 7580 states and 18125 transitions. [2019-12-26 23:12:47,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:12:47,765 INFO L276 IsEmpty]: Start isEmpty. Operand 7580 states and 18125 transitions. [2019-12-26 23:12:47,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:12:47,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:47,775 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:47,775 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:47,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:47,776 INFO L82 PathProgramCache]: Analyzing trace with hash -2024800108, now seen corresponding path program 1 times [2019-12-26 23:12:47,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:47,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962934322] [2019-12-26 23:12:47,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:47,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:47,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962934322] [2019-12-26 23:12:47,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:47,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:12:47,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266104180] [2019-12-26 23:12:47,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:12:47,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:47,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:12:47,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:12:47,859 INFO L87 Difference]: Start difference. First operand 7580 states and 18125 transitions. Second operand 6 states. [2019-12-26 23:12:48,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:48,543 INFO L93 Difference]: Finished difference Result 8143 states and 19272 transitions. [2019-12-26 23:12:48,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:12:48,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-26 23:12:48,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:48,559 INFO L225 Difference]: With dead ends: 8143 [2019-12-26 23:12:48,560 INFO L226 Difference]: Without dead ends: 8143 [2019-12-26 23:12:48,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:12:48,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8143 states. [2019-12-26 23:12:48,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8143 to 7706. [2019-12-26 23:12:48,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7706 states. [2019-12-26 23:12:48,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7706 states to 7706 states and 18399 transitions. [2019-12-26 23:12:48,964 INFO L78 Accepts]: Start accepts. Automaton has 7706 states and 18399 transitions. Word has length 96 [2019-12-26 23:12:48,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:48,965 INFO L462 AbstractCegarLoop]: Abstraction has 7706 states and 18399 transitions. [2019-12-26 23:12:48,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:12:48,965 INFO L276 IsEmpty]: Start isEmpty. Operand 7706 states and 18399 transitions. [2019-12-26 23:12:48,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:12:48,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:48,973 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:48,974 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:48,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:48,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1261239740, now seen corresponding path program 2 times [2019-12-26 23:12:48,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:48,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238980119] [2019-12-26 23:12:48,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:49,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:49,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238980119] [2019-12-26 23:12:49,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:49,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:12:49,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394966029] [2019-12-26 23:12:49,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:12:49,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:49,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:12:49,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:12:49,125 INFO L87 Difference]: Start difference. First operand 7706 states and 18399 transitions. Second operand 10 states. [2019-12-26 23:12:50,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:50,063 INFO L93 Difference]: Finished difference Result 18147 states and 42299 transitions. [2019-12-26 23:12:50,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 23:12:50,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-26 23:12:50,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:50,082 INFO L225 Difference]: With dead ends: 18147 [2019-12-26 23:12:50,082 INFO L226 Difference]: Without dead ends: 16431 [2019-12-26 23:12:50,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-26 23:12:50,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16431 states. [2019-12-26 23:12:50,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16431 to 10461. [2019-12-26 23:12:50,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10461 states. [2019-12-26 23:12:50,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10461 states to 10461 states and 25523 transitions. [2019-12-26 23:12:50,238 INFO L78 Accepts]: Start accepts. Automaton has 10461 states and 25523 transitions. Word has length 96 [2019-12-26 23:12:50,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:50,239 INFO L462 AbstractCegarLoop]: Abstraction has 10461 states and 25523 transitions. [2019-12-26 23:12:50,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:12:50,239 INFO L276 IsEmpty]: Start isEmpty. Operand 10461 states and 25523 transitions. [2019-12-26 23:12:50,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:12:50,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:50,248 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:50,248 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:50,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:50,249 INFO L82 PathProgramCache]: Analyzing trace with hash -382325470, now seen corresponding path program 3 times [2019-12-26 23:12:50,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:50,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808996961] [2019-12-26 23:12:50,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:50,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:50,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808996961] [2019-12-26 23:12:50,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:50,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:12:50,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116224005] [2019-12-26 23:12:50,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:12:50,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:50,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:12:50,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:12:50,416 INFO L87 Difference]: Start difference. First operand 10461 states and 25523 transitions. Second operand 9 states. [2019-12-26 23:12:51,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:51,320 INFO L93 Difference]: Finished difference Result 20930 states and 50651 transitions. [2019-12-26 23:12:51,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 23:12:51,320 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-26 23:12:51,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:51,342 INFO L225 Difference]: With dead ends: 20930 [2019-12-26 23:12:51,342 INFO L226 Difference]: Without dead ends: 16205 [2019-12-26 23:12:51,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-12-26 23:12:51,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16205 states. [2019-12-26 23:12:51,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16205 to 14380. [2019-12-26 23:12:51,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14380 states. [2019-12-26 23:12:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14380 states to 14380 states and 35233 transitions. [2019-12-26 23:12:51,522 INFO L78 Accepts]: Start accepts. Automaton has 14380 states and 35233 transitions. Word has length 96 [2019-12-26 23:12:51,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:51,522 INFO L462 AbstractCegarLoop]: Abstraction has 14380 states and 35233 transitions. [2019-12-26 23:12:51,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:12:51,523 INFO L276 IsEmpty]: Start isEmpty. Operand 14380 states and 35233 transitions. [2019-12-26 23:12:51,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:12:51,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:51,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:51,535 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:51,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:51,535 INFO L82 PathProgramCache]: Analyzing trace with hash -478635746, now seen corresponding path program 4 times [2019-12-26 23:12:51,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:51,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528782790] [2019-12-26 23:12:51,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:51,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:51,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528782790] [2019-12-26 23:12:51,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:51,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:12:51,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573798369] [2019-12-26 23:12:51,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:12:51,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:51,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:12:51,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:12:51,614 INFO L87 Difference]: Start difference. First operand 14380 states and 35233 transitions. Second operand 4 states. [2019-12-26 23:12:51,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:51,895 INFO L93 Difference]: Finished difference Result 15268 states and 37375 transitions. [2019-12-26 23:12:51,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:12:51,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-26 23:12:51,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:51,914 INFO L225 Difference]: With dead ends: 15268 [2019-12-26 23:12:51,914 INFO L226 Difference]: Without dead ends: 15268 [2019-12-26 23:12:51,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:12:51,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15268 states. [2019-12-26 23:12:52,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15268 to 13945. [2019-12-26 23:12:52,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13945 states. [2019-12-26 23:12:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13945 states to 13945 states and 34153 transitions. [2019-12-26 23:12:52,089 INFO L78 Accepts]: Start accepts. Automaton has 13945 states and 34153 transitions. Word has length 96 [2019-12-26 23:12:52,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:52,090 INFO L462 AbstractCegarLoop]: Abstraction has 13945 states and 34153 transitions. [2019-12-26 23:12:52,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:12:52,090 INFO L276 IsEmpty]: Start isEmpty. Operand 13945 states and 34153 transitions. [2019-12-26 23:12:52,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:12:52,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:52,104 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:52,104 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:52,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:52,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1607730014, now seen corresponding path program 5 times [2019-12-26 23:12:52,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:52,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845066182] [2019-12-26 23:12:52,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:52,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:52,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845066182] [2019-12-26 23:12:52,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:52,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:12:52,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362816775] [2019-12-26 23:12:52,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:12:52,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:52,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:12:52,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:12:52,193 INFO L87 Difference]: Start difference. First operand 13945 states and 34153 transitions. Second operand 5 states. [2019-12-26 23:12:52,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:52,740 INFO L93 Difference]: Finished difference Result 17229 states and 42315 transitions. [2019-12-26 23:12:52,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:12:52,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-26 23:12:52,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:52,764 INFO L225 Difference]: With dead ends: 17229 [2019-12-26 23:12:52,765 INFO L226 Difference]: Without dead ends: 17229 [2019-12-26 23:12:52,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:12:52,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17229 states. [2019-12-26 23:12:52,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17229 to 14627. [2019-12-26 23:12:52,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14627 states. [2019-12-26 23:12:53,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14627 states to 14627 states and 35865 transitions. [2019-12-26 23:12:53,005 INFO L78 Accepts]: Start accepts. Automaton has 14627 states and 35865 transitions. Word has length 96 [2019-12-26 23:12:53,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:53,005 INFO L462 AbstractCegarLoop]: Abstraction has 14627 states and 35865 transitions. [2019-12-26 23:12:53,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:12:53,006 INFO L276 IsEmpty]: Start isEmpty. Operand 14627 states and 35865 transitions. [2019-12-26 23:12:53,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:12:53,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:53,020 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:53,020 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:53,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:53,020 INFO L82 PathProgramCache]: Analyzing trace with hash 798116452, now seen corresponding path program 6 times [2019-12-26 23:12:53,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:53,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593553488] [2019-12-26 23:12:53,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:53,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:53,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593553488] [2019-12-26 23:12:53,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:53,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:12:53,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047724645] [2019-12-26 23:12:53,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:12:53,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:53,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:12:53,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:12:53,226 INFO L87 Difference]: Start difference. First operand 14627 states and 35865 transitions. Second operand 10 states. [2019-12-26 23:12:54,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:54,484 INFO L93 Difference]: Finished difference Result 23797 states and 57631 transitions. [2019-12-26 23:12:54,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 23:12:54,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-26 23:12:54,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:54,508 INFO L225 Difference]: With dead ends: 23797 [2019-12-26 23:12:54,509 INFO L226 Difference]: Without dead ends: 22553 [2019-12-26 23:12:54,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:12:54,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22553 states. [2019-12-26 23:12:54,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22553 to 17595. [2019-12-26 23:12:54,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17595 states. [2019-12-26 23:12:54,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17595 states to 17595 states and 43852 transitions. [2019-12-26 23:12:54,741 INFO L78 Accepts]: Start accepts. Automaton has 17595 states and 43852 transitions. Word has length 96 [2019-12-26 23:12:54,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:54,741 INFO L462 AbstractCegarLoop]: Abstraction has 17595 states and 43852 transitions. [2019-12-26 23:12:54,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:12:54,741 INFO L276 IsEmpty]: Start isEmpty. Operand 17595 states and 43852 transitions. [2019-12-26 23:12:54,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:12:54,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:54,757 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:54,757 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:54,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:54,757 INFO L82 PathProgramCache]: Analyzing trace with hash -517412620, now seen corresponding path program 7 times [2019-12-26 23:12:54,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:54,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315695745] [2019-12-26 23:12:54,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:54,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:54,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315695745] [2019-12-26 23:12:54,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:54,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:12:54,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20909879] [2019-12-26 23:12:54,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:12:54,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:54,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:12:54,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:12:54,856 INFO L87 Difference]: Start difference. First operand 17595 states and 43852 transitions. Second operand 6 states. [2019-12-26 23:12:55,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:55,054 INFO L93 Difference]: Finished difference Result 19535 states and 48085 transitions. [2019-12-26 23:12:55,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:12:55,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-26 23:12:55,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:55,078 INFO L225 Difference]: With dead ends: 19535 [2019-12-26 23:12:55,078 INFO L226 Difference]: Without dead ends: 18198 [2019-12-26 23:12:55,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:12:55,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18198 states. [2019-12-26 23:12:55,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18198 to 17459. [2019-12-26 23:12:55,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17459 states. [2019-12-26 23:12:55,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17459 states to 17459 states and 43534 transitions. [2019-12-26 23:12:55,297 INFO L78 Accepts]: Start accepts. Automaton has 17459 states and 43534 transitions. Word has length 96 [2019-12-26 23:12:55,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:55,297 INFO L462 AbstractCegarLoop]: Abstraction has 17459 states and 43534 transitions. [2019-12-26 23:12:55,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:12:55,298 INFO L276 IsEmpty]: Start isEmpty. Operand 17459 states and 43534 transitions. [2019-12-26 23:12:55,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:12:55,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:55,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:12:55,313 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:55,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:55,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1281102864, now seen corresponding path program 8 times [2019-12-26 23:12:55,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:55,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721358547] [2019-12-26 23:12:55,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:12:55,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721358547] [2019-12-26 23:12:55,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:55,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-26 23:12:55,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034554737] [2019-12-26 23:12:55,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-26 23:12:55,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:55,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-26 23:12:55,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-12-26 23:12:55,767 INFO L87 Difference]: Start difference. First operand 17459 states and 43534 transitions. Second operand 19 states. [2019-12-26 23:13:00,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:00,228 INFO L93 Difference]: Finished difference Result 35502 states and 88902 transitions. [2019-12-26 23:13:00,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-26 23:13:00,228 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 96 [2019-12-26 23:13:00,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:00,265 INFO L225 Difference]: With dead ends: 35502 [2019-12-26 23:13:00,265 INFO L226 Difference]: Without dead ends: 30732 [2019-12-26 23:13:00,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=265, Invalid=1991, Unknown=0, NotChecked=0, Total=2256 [2019-12-26 23:13:00,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30732 states. [2019-12-26 23:13:00,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30732 to 21913. [2019-12-26 23:13:00,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21913 states. [2019-12-26 23:13:00,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21913 states to 21913 states and 55268 transitions. [2019-12-26 23:13:00,910 INFO L78 Accepts]: Start accepts. Automaton has 21913 states and 55268 transitions. Word has length 96 [2019-12-26 23:13:00,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:00,910 INFO L462 AbstractCegarLoop]: Abstraction has 21913 states and 55268 transitions. [2019-12-26 23:13:00,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-26 23:13:00,910 INFO L276 IsEmpty]: Start isEmpty. Operand 21913 states and 55268 transitions. [2019-12-26 23:13:00,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:00,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:00,929 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:13:00,930 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:00,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:00,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1267480048, now seen corresponding path program 9 times [2019-12-26 23:13:00,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:00,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751928575] [2019-12-26 23:13:00,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:01,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:13:01,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751928575] [2019-12-26 23:13:01,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:01,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:13:01,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058570818] [2019-12-26 23:13:01,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:13:01,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:01,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:13:01,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:13:01,013 INFO L87 Difference]: Start difference. First operand 21913 states and 55268 transitions. Second operand 6 states. [2019-12-26 23:13:01,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:01,705 INFO L93 Difference]: Finished difference Result 26601 states and 66810 transitions. [2019-12-26 23:13:01,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:13:01,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-26 23:13:01,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:01,746 INFO L225 Difference]: With dead ends: 26601 [2019-12-26 23:13:01,747 INFO L226 Difference]: Without dead ends: 26601 [2019-12-26 23:13:01,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:13:01,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26601 states. [2019-12-26 23:13:02,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26601 to 21974. [2019-12-26 23:13:02,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21974 states. [2019-12-26 23:13:02,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21974 states to 21974 states and 55411 transitions. [2019-12-26 23:13:02,050 INFO L78 Accepts]: Start accepts. Automaton has 21974 states and 55411 transitions. Word has length 96 [2019-12-26 23:13:02,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:02,050 INFO L462 AbstractCegarLoop]: Abstraction has 21974 states and 55411 transitions. [2019-12-26 23:13:02,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:13:02,050 INFO L276 IsEmpty]: Start isEmpty. Operand 21974 states and 55411 transitions. [2019-12-26 23:13:02,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:02,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:02,071 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:13:02,071 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:02,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:02,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1061893144, now seen corresponding path program 10 times [2019-12-26 23:13:02,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:02,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106349835] [2019-12-26 23:13:02,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:02,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:13:02,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106349835] [2019-12-26 23:13:02,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:02,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 23:13:02,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312203524] [2019-12-26 23:13:02,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 23:13:02,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:02,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 23:13:02,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:13:02,382 INFO L87 Difference]: Start difference. First operand 21974 states and 55411 transitions. Second operand 14 states. [2019-12-26 23:13:03,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:03,662 INFO L93 Difference]: Finished difference Result 28049 states and 69925 transitions. [2019-12-26 23:13:03,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 23:13:03,663 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-26 23:13:03,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:03,694 INFO L225 Difference]: With dead ends: 28049 [2019-12-26 23:13:03,695 INFO L226 Difference]: Without dead ends: 28019 [2019-12-26 23:13:03,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2019-12-26 23:13:03,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28019 states. [2019-12-26 23:13:03,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28019 to 25247. [2019-12-26 23:13:03,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25247 states. [2019-12-26 23:13:04,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25247 states to 25247 states and 63771 transitions. [2019-12-26 23:13:04,037 INFO L78 Accepts]: Start accepts. Automaton has 25247 states and 63771 transitions. Word has length 96 [2019-12-26 23:13:04,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:04,037 INFO L462 AbstractCegarLoop]: Abstraction has 25247 states and 63771 transitions. [2019-12-26 23:13:04,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 23:13:04,038 INFO L276 IsEmpty]: Start isEmpty. Operand 25247 states and 63771 transitions. [2019-12-26 23:13:04,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:04,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:04,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:13:04,067 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:04,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:04,067 INFO L82 PathProgramCache]: Analyzing trace with hash -952141892, now seen corresponding path program 11 times [2019-12-26 23:13:04,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:04,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101878794] [2019-12-26 23:13:04,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:04,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:13:04,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101878794] [2019-12-26 23:13:04,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:04,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:13:04,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789576121] [2019-12-26 23:13:04,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:13:04,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:04,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:13:04,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:13:04,236 INFO L87 Difference]: Start difference. First operand 25247 states and 63771 transitions. Second operand 10 states. [2019-12-26 23:13:05,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:05,275 INFO L93 Difference]: Finished difference Result 37448 states and 92860 transitions. [2019-12-26 23:13:05,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 23:13:05,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-26 23:13:05,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:05,318 INFO L225 Difference]: With dead ends: 37448 [2019-12-26 23:13:05,319 INFO L226 Difference]: Without dead ends: 36839 [2019-12-26 23:13:05,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-12-26 23:13:05,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36839 states. [2019-12-26 23:13:06,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36839 to 25938. [2019-12-26 23:13:06,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25938 states. [2019-12-26 23:13:06,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25938 states to 25938 states and 65570 transitions. [2019-12-26 23:13:06,080 INFO L78 Accepts]: Start accepts. Automaton has 25938 states and 65570 transitions. Word has length 96 [2019-12-26 23:13:06,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:06,080 INFO L462 AbstractCegarLoop]: Abstraction has 25938 states and 65570 transitions. [2019-12-26 23:13:06,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:13:06,080 INFO L276 IsEmpty]: Start isEmpty. Operand 25938 states and 65570 transitions. [2019-12-26 23:13:06,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:06,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:06,105 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:13:06,105 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:06,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:06,105 INFO L82 PathProgramCache]: Analyzing trace with hash 458924146, now seen corresponding path program 12 times [2019-12-26 23:13:06,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:06,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035955606] [2019-12-26 23:13:06,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:06,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:13:06,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035955606] [2019-12-26 23:13:06,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:06,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-26 23:13:06,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884139445] [2019-12-26 23:13:06,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 23:13:06,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:06,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 23:13:06,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-26 23:13:06,382 INFO L87 Difference]: Start difference. First operand 25938 states and 65570 transitions. Second operand 16 states. [2019-12-26 23:13:09,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:09,320 INFO L93 Difference]: Finished difference Result 46951 states and 117976 transitions. [2019-12-26 23:13:09,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-26 23:13:09,321 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 96 [2019-12-26 23:13:09,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:09,374 INFO L225 Difference]: With dead ends: 46951 [2019-12-26 23:13:09,374 INFO L226 Difference]: Without dead ends: 44058 [2019-12-26 23:13:09,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=249, Invalid=1473, Unknown=0, NotChecked=0, Total=1722 [2019-12-26 23:13:09,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44058 states. [2019-12-26 23:13:09,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44058 to 30381. [2019-12-26 23:13:09,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30381 states. [2019-12-26 23:13:09,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30381 states to 30381 states and 78034 transitions. [2019-12-26 23:13:09,827 INFO L78 Accepts]: Start accepts. Automaton has 30381 states and 78034 transitions. Word has length 96 [2019-12-26 23:13:09,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:09,827 INFO L462 AbstractCegarLoop]: Abstraction has 30381 states and 78034 transitions. [2019-12-26 23:13:09,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 23:13:09,827 INFO L276 IsEmpty]: Start isEmpty. Operand 30381 states and 78034 transitions. [2019-12-26 23:13:09,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:09,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:09,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:13:09,857 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:09,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:09,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1560206146, now seen corresponding path program 13 times [2019-12-26 23:13:09,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:09,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957335985] [2019-12-26 23:13:09,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:13:09,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957335985] [2019-12-26 23:13:09,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:09,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:13:09,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042758874] [2019-12-26 23:13:09,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:13:09,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:09,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:13:09,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:13:09,974 INFO L87 Difference]: Start difference. First operand 30381 states and 78034 transitions. Second operand 8 states. [2019-12-26 23:13:10,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:10,711 INFO L93 Difference]: Finished difference Result 39379 states and 100575 transitions. [2019-12-26 23:13:10,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:13:10,711 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-12-26 23:13:10,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:10,756 INFO L225 Difference]: With dead ends: 39379 [2019-12-26 23:13:10,756 INFO L226 Difference]: Without dead ends: 36276 [2019-12-26 23:13:10,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:13:10,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36276 states. [2019-12-26 23:13:11,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36276 to 33539. [2019-12-26 23:13:11,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33539 states. [2019-12-26 23:13:11,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33539 states to 33539 states and 86389 transitions. [2019-12-26 23:13:11,583 INFO L78 Accepts]: Start accepts. Automaton has 33539 states and 86389 transitions. Word has length 96 [2019-12-26 23:13:11,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:11,584 INFO L462 AbstractCegarLoop]: Abstraction has 33539 states and 86389 transitions. [2019-12-26 23:13:11,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:13:11,584 INFO L276 IsEmpty]: Start isEmpty. Operand 33539 states and 86389 transitions. [2019-12-26 23:13:11,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:11,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:11,616 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:13:11,616 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:11,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:11,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1463895870, now seen corresponding path program 14 times [2019-12-26 23:13:11,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:11,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668857517] [2019-12-26 23:13:11,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:11,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:13:11,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668857517] [2019-12-26 23:13:11,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:11,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:13:11,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921490541] [2019-12-26 23:13:11,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:13:11,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:11,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:13:11,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:13:11,859 INFO L87 Difference]: Start difference. First operand 33539 states and 86389 transitions. Second operand 11 states. [2019-12-26 23:13:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:13,168 INFO L93 Difference]: Finished difference Result 43812 states and 111244 transitions. [2019-12-26 23:13:13,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 23:13:13,169 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-26 23:13:13,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:13,221 INFO L225 Difference]: With dead ends: 43812 [2019-12-26 23:13:13,221 INFO L226 Difference]: Without dead ends: 43812 [2019-12-26 23:13:13,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:13:13,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43812 states. [2019-12-26 23:13:13,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43812 to 35115. [2019-12-26 23:13:13,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35115 states. [2019-12-26 23:13:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35115 states to 35115 states and 89744 transitions. [2019-12-26 23:13:13,705 INFO L78 Accepts]: Start accepts. Automaton has 35115 states and 89744 transitions. Word has length 96 [2019-12-26 23:13:13,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:13,706 INFO L462 AbstractCegarLoop]: Abstraction has 35115 states and 89744 transitions. [2019-12-26 23:13:13,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:13:13,706 INFO L276 IsEmpty]: Start isEmpty. Operand 35115 states and 89744 transitions. [2019-12-26 23:13:13,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:13,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:13,739 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:13:13,739 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:13,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:13,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1585378316, now seen corresponding path program 15 times [2019-12-26 23:13:13,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:13,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157350390] [2019-12-26 23:13:13,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:13,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:13:13,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157350390] [2019-12-26 23:13:13,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:13,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:13:13,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228184998] [2019-12-26 23:13:13,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:13:13,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:13,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:13:13,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:13:13,857 INFO L87 Difference]: Start difference. First operand 35115 states and 89744 transitions. Second operand 9 states. [2019-12-26 23:13:14,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:14,730 INFO L93 Difference]: Finished difference Result 48023 states and 122957 transitions. [2019-12-26 23:13:14,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 23:13:14,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-26 23:13:14,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:14,787 INFO L225 Difference]: With dead ends: 48023 [2019-12-26 23:13:14,787 INFO L226 Difference]: Without dead ends: 45561 [2019-12-26 23:13:14,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-12-26 23:13:14,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45561 states. [2019-12-26 23:13:15,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45561 to 34126. [2019-12-26 23:13:15,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34126 states. [2019-12-26 23:13:15,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34126 states to 34126 states and 87495 transitions. [2019-12-26 23:13:15,259 INFO L78 Accepts]: Start accepts. Automaton has 34126 states and 87495 transitions. Word has length 96 [2019-12-26 23:13:15,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:15,259 INFO L462 AbstractCegarLoop]: Abstraction has 34126 states and 87495 transitions. [2019-12-26 23:13:15,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:13:15,259 INFO L276 IsEmpty]: Start isEmpty. Operand 34126 states and 87495 transitions. [2019-12-26 23:13:15,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:15,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:15,291 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:13:15,292 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:15,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:15,292 INFO L82 PathProgramCache]: Analyzing trace with hash 660579346, now seen corresponding path program 16 times [2019-12-26 23:13:15,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:15,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509707970] [2019-12-26 23:13:15,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:15,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:13:15,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509707970] [2019-12-26 23:13:15,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:15,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:13:15,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704352365] [2019-12-26 23:13:15,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:13:15,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:15,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:13:15,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:13:15,442 INFO L87 Difference]: Start difference. First operand 34126 states and 87495 transitions. Second operand 12 states. [2019-12-26 23:13:16,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:16,879 INFO L93 Difference]: Finished difference Result 42550 states and 108126 transitions. [2019-12-26 23:13:16,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 23:13:16,880 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-26 23:13:16,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:16,947 INFO L225 Difference]: With dead ends: 42550 [2019-12-26 23:13:16,947 INFO L226 Difference]: Without dead ends: 42208 [2019-12-26 23:13:16,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2019-12-26 23:13:17,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42208 states. [2019-12-26 23:13:17,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42208 to 32170. [2019-12-26 23:13:17,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32170 states. [2019-12-26 23:13:17,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32170 states to 32170 states and 82215 transitions. [2019-12-26 23:13:17,406 INFO L78 Accepts]: Start accepts. Automaton has 32170 states and 82215 transitions. Word has length 96 [2019-12-26 23:13:17,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:17,406 INFO L462 AbstractCegarLoop]: Abstraction has 32170 states and 82215 transitions. [2019-12-26 23:13:17,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:13:17,406 INFO L276 IsEmpty]: Start isEmpty. Operand 32170 states and 82215 transitions. [2019-12-26 23:13:17,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:17,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:17,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:13:17,437 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:17,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:17,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1343217296, now seen corresponding path program 17 times [2019-12-26 23:13:17,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:17,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192337758] [2019-12-26 23:13:17,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:17,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:13:17,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192337758] [2019-12-26 23:13:17,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:17,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:13:17,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547472970] [2019-12-26 23:13:17,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:13:17,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:17,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:13:17,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:13:17,547 INFO L87 Difference]: Start difference. First operand 32170 states and 82215 transitions. Second operand 6 states. [2019-12-26 23:13:17,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:17,899 INFO L93 Difference]: Finished difference Result 32507 states and 82923 transitions. [2019-12-26 23:13:17,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:13:17,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-26 23:13:17,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:17,952 INFO L225 Difference]: With dead ends: 32507 [2019-12-26 23:13:17,952 INFO L226 Difference]: Without dead ends: 32507 [2019-12-26 23:13:17,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:13:18,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32507 states. [2019-12-26 23:13:18,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32507 to 31858. [2019-12-26 23:13:18,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31858 states. [2019-12-26 23:13:18,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31858 states to 31858 states and 81459 transitions. [2019-12-26 23:13:18,351 INFO L78 Accepts]: Start accepts. Automaton has 31858 states and 81459 transitions. Word has length 96 [2019-12-26 23:13:18,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:18,351 INFO L462 AbstractCegarLoop]: Abstraction has 31858 states and 81459 transitions. [2019-12-26 23:13:18,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:13:18,351 INFO L276 IsEmpty]: Start isEmpty. Operand 31858 states and 81459 transitions. [2019-12-26 23:13:18,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:18,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:18,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:13:18,382 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:18,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:18,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1288376848, now seen corresponding path program 18 times [2019-12-26 23:13:18,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:18,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071609601] [2019-12-26 23:13:18,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:18,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:13:18,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071609601] [2019-12-26 23:13:18,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:18,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:13:18,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641345042] [2019-12-26 23:13:18,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:13:18,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:18,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:13:18,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:13:18,550 INFO L87 Difference]: Start difference. First operand 31858 states and 81459 transitions. Second operand 12 states. [2019-12-26 23:13:20,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:20,538 INFO L93 Difference]: Finished difference Result 54786 states and 139484 transitions. [2019-12-26 23:13:20,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-26 23:13:20,539 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-26 23:13:20,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:20,601 INFO L225 Difference]: With dead ends: 54786 [2019-12-26 23:13:20,601 INFO L226 Difference]: Without dead ends: 50135 [2019-12-26 23:13:20,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=1082, Unknown=0, NotChecked=0, Total=1260 [2019-12-26 23:13:20,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50135 states. [2019-12-26 23:13:21,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50135 to 29215. [2019-12-26 23:13:21,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29215 states. [2019-12-26 23:13:21,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29215 states to 29215 states and 74419 transitions. [2019-12-26 23:13:21,469 INFO L78 Accepts]: Start accepts. Automaton has 29215 states and 74419 transitions. Word has length 96 [2019-12-26 23:13:21,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:21,469 INFO L462 AbstractCegarLoop]: Abstraction has 29215 states and 74419 transitions. [2019-12-26 23:13:21,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:13:21,469 INFO L276 IsEmpty]: Start isEmpty. Operand 29215 states and 74419 transitions. [2019-12-26 23:13:21,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:21,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:21,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:13:21,497 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:21,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:21,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1840566222, now seen corresponding path program 19 times [2019-12-26 23:13:21,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:21,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679495292] [2019-12-26 23:13:21,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:21,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:13:21,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679495292] [2019-12-26 23:13:21,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:21,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:13:21,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251974227] [2019-12-26 23:13:21,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:13:21,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:21,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:13:21,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:13:21,617 INFO L87 Difference]: Start difference. First operand 29215 states and 74419 transitions. Second operand 10 states. [2019-12-26 23:13:22,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:22,983 INFO L93 Difference]: Finished difference Result 47788 states and 121845 transitions. [2019-12-26 23:13:22,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 23:13:22,983 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-26 23:13:22,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:23,037 INFO L225 Difference]: With dead ends: 47788 [2019-12-26 23:13:23,038 INFO L226 Difference]: Without dead ends: 43993 [2019-12-26 23:13:23,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2019-12-26 23:13:23,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43993 states. [2019-12-26 23:13:23,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43993 to 31220. [2019-12-26 23:13:23,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31220 states. [2019-12-26 23:13:23,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31220 states to 31220 states and 79789 transitions. [2019-12-26 23:13:23,497 INFO L78 Accepts]: Start accepts. Automaton has 31220 states and 79789 transitions. Word has length 96 [2019-12-26 23:13:23,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:23,498 INFO L462 AbstractCegarLoop]: Abstraction has 31220 states and 79789 transitions. [2019-12-26 23:13:23,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:13:23,498 INFO L276 IsEmpty]: Start isEmpty. Operand 31220 states and 79789 transitions. [2019-12-26 23:13:23,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:23,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:23,527 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:13:23,528 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:23,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:23,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1026191112, now seen corresponding path program 20 times [2019-12-26 23:13:23,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:23,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189394780] [2019-12-26 23:13:23,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:23,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:13:23,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189394780] [2019-12-26 23:13:23,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:23,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-26 23:13:23,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985616625] [2019-12-26 23:13:23,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 23:13:23,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:23,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 23:13:23,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:13:23,794 INFO L87 Difference]: Start difference. First operand 31220 states and 79789 transitions. Second operand 14 states. [2019-12-26 23:13:26,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:26,043 INFO L93 Difference]: Finished difference Result 41930 states and 106037 transitions. [2019-12-26 23:13:26,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-26 23:13:26,043 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-26 23:13:26,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:26,093 INFO L225 Difference]: With dead ends: 41930 [2019-12-26 23:13:26,093 INFO L226 Difference]: Without dead ends: 41577 [2019-12-26 23:13:26,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=1123, Unknown=0, NotChecked=0, Total=1332 [2019-12-26 23:13:26,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41577 states. [2019-12-26 23:13:26,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41577 to 28989. [2019-12-26 23:13:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28989 states. [2019-12-26 23:13:26,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28989 states to 28989 states and 73844 transitions. [2019-12-26 23:13:26,531 INFO L78 Accepts]: Start accepts. Automaton has 28989 states and 73844 transitions. Word has length 96 [2019-12-26 23:13:26,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:26,531 INFO L462 AbstractCegarLoop]: Abstraction has 28989 states and 73844 transitions. [2019-12-26 23:13:26,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 23:13:26,531 INFO L276 IsEmpty]: Start isEmpty. Operand 28989 states and 73844 transitions. [2019-12-26 23:13:26,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:13:26,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:26,560 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:13:26,560 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:26,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:26,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1931956007, now seen corresponding path program 1 times [2019-12-26 23:13:26,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:26,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394100828] [2019-12-26 23:13:26,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:27,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:13:27,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394100828] [2019-12-26 23:13:27,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:27,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 23:13:27,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340193388] [2019-12-26 23:13:27,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 23:13:27,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:27,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 23:13:27,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:13:27,293 INFO L87 Difference]: Start difference. First operand 28989 states and 73844 transitions. Second operand 13 states. [2019-12-26 23:13:30,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:30,520 INFO L93 Difference]: Finished difference Result 58706 states and 147835 transitions. [2019-12-26 23:13:30,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-26 23:13:30,520 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2019-12-26 23:13:30,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:30,586 INFO L225 Difference]: With dead ends: 58706 [2019-12-26 23:13:30,586 INFO L226 Difference]: Without dead ends: 50944 [2019-12-26 23:13:30,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=283, Invalid=1277, Unknown=0, NotChecked=0, Total=1560 [2019-12-26 23:13:30,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50944 states. [2019-12-26 23:13:31,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50944 to 34246. [2019-12-26 23:13:31,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34246 states. [2019-12-26 23:13:31,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34246 states to 34246 states and 87814 transitions. [2019-12-26 23:13:31,113 INFO L78 Accepts]: Start accepts. Automaton has 34246 states and 87814 transitions. Word has length 97 [2019-12-26 23:13:31,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:31,113 INFO L462 AbstractCegarLoop]: Abstraction has 34246 states and 87814 transitions. [2019-12-26 23:13:31,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 23:13:31,113 INFO L276 IsEmpty]: Start isEmpty. Operand 34246 states and 87814 transitions. [2019-12-26 23:13:31,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:13:31,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:31,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:13:31,146 INFO L410 AbstractCegarLoop]: === Iteration 46 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:31,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:31,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1686919759, now seen corresponding path program 2 times [2019-12-26 23:13:31,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:31,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140276455] [2019-12-26 23:13:31,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:31,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:13:31,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140276455] [2019-12-26 23:13:31,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:31,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:13:31,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394354335] [2019-12-26 23:13:31,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:13:31,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:31,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:13:31,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:13:31,253 INFO L87 Difference]: Start difference. First operand 34246 states and 87814 transitions. Second operand 6 states. [2019-12-26 23:13:31,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:31,446 INFO L93 Difference]: Finished difference Result 33627 states and 86112 transitions. [2019-12-26 23:13:31,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:13:31,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-26 23:13:31,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:31,484 INFO L225 Difference]: With dead ends: 33627 [2019-12-26 23:13:31,484 INFO L226 Difference]: Without dead ends: 33627 [2019-12-26 23:13:31,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:13:31,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33627 states. [2019-12-26 23:13:31,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33627 to 26054. [2019-12-26 23:13:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26054 states. [2019-12-26 23:13:31,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26054 states to 26054 states and 66033 transitions. [2019-12-26 23:13:31,831 INFO L78 Accepts]: Start accepts. Automaton has 26054 states and 66033 transitions. Word has length 97 [2019-12-26 23:13:31,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:31,831 INFO L462 AbstractCegarLoop]: Abstraction has 26054 states and 66033 transitions. [2019-12-26 23:13:31,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:13:31,831 INFO L276 IsEmpty]: Start isEmpty. Operand 26054 states and 66033 transitions. [2019-12-26 23:13:31,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:13:31,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:31,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:13:31,855 INFO L410 AbstractCegarLoop]: === Iteration 47 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:31,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:31,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1220428195, now seen corresponding path program 1 times [2019-12-26 23:13:31,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:31,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558614328] [2019-12-26 23:13:31,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:31,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:13:31,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558614328] [2019-12-26 23:13:31,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:31,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:13:31,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026257981] [2019-12-26 23:13:31,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:13:31,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:31,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:13:31,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:13:31,955 INFO L87 Difference]: Start difference. First operand 26054 states and 66033 transitions. Second operand 7 states. [2019-12-26 23:13:33,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:33,066 INFO L93 Difference]: Finished difference Result 37740 states and 94995 transitions. [2019-12-26 23:13:33,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:13:33,066 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-26 23:13:33,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:33,134 INFO L225 Difference]: With dead ends: 37740 [2019-12-26 23:13:33,134 INFO L226 Difference]: Without dead ends: 37733 [2019-12-26 23:13:33,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:13:33,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37733 states. [2019-12-26 23:13:34,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37733 to 30318. [2019-12-26 23:13:34,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30318 states. [2019-12-26 23:13:34,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30318 states to 30318 states and 76805 transitions. [2019-12-26 23:13:34,144 INFO L78 Accepts]: Start accepts. Automaton has 30318 states and 76805 transitions. Word has length 97 [2019-12-26 23:13:34,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:34,145 INFO L462 AbstractCegarLoop]: Abstraction has 30318 states and 76805 transitions. [2019-12-26 23:13:34,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:13:34,145 INFO L276 IsEmpty]: Start isEmpty. Operand 30318 states and 76805 transitions. [2019-12-26 23:13:34,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:13:34,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:34,175 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:13:34,175 INFO L410 AbstractCegarLoop]: === Iteration 48 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:34,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:34,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1780327349, now seen corresponding path program 2 times [2019-12-26 23:13:34,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:34,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652557296] [2019-12-26 23:13:34,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:34,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:13:34,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652557296] [2019-12-26 23:13:34,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:34,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-12-26 23:13:34,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658277511] [2019-12-26 23:13:34,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-26 23:13:34,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:34,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-26 23:13:34,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2019-12-26 23:13:34,946 INFO L87 Difference]: Start difference. First operand 30318 states and 76805 transitions. Second operand 27 states. [2019-12-26 23:13:39,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:39,417 INFO L93 Difference]: Finished difference Result 35420 states and 89398 transitions. [2019-12-26 23:13:39,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-26 23:13:39,417 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 97 [2019-12-26 23:13:39,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:39,460 INFO L225 Difference]: With dead ends: 35420 [2019-12-26 23:13:39,461 INFO L226 Difference]: Without dead ends: 35420 [2019-12-26 23:13:39,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=239, Invalid=1567, Unknown=0, NotChecked=0, Total=1806 [2019-12-26 23:13:39,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35420 states. [2019-12-26 23:13:39,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35420 to 30537. [2019-12-26 23:13:39,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30537 states. [2019-12-26 23:13:39,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30537 states to 30537 states and 77300 transitions. [2019-12-26 23:13:39,858 INFO L78 Accepts]: Start accepts. Automaton has 30537 states and 77300 transitions. Word has length 97 [2019-12-26 23:13:39,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:39,859 INFO L462 AbstractCegarLoop]: Abstraction has 30537 states and 77300 transitions. [2019-12-26 23:13:39,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-26 23:13:39,859 INFO L276 IsEmpty]: Start isEmpty. Operand 30537 states and 77300 transitions. [2019-12-26 23:13:39,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:13:39,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:39,888 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:13:39,889 INFO L410 AbstractCegarLoop]: === Iteration 49 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:39,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:39,889 INFO L82 PathProgramCache]: Analyzing trace with hash -648007813, now seen corresponding path program 3 times [2019-12-26 23:13:39,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:39,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30011141] [2019-12-26 23:13:39,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:40,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:13:40,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30011141] [2019-12-26 23:13:40,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:40,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:13:40,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025489126] [2019-12-26 23:13:40,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:13:40,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:40,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:13:40,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:13:40,023 INFO L87 Difference]: Start difference. First operand 30537 states and 77300 transitions. Second operand 8 states. [2019-12-26 23:13:41,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:41,168 INFO L93 Difference]: Finished difference Result 37480 states and 93887 transitions. [2019-12-26 23:13:41,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:13:41,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-26 23:13:41,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:41,213 INFO L225 Difference]: With dead ends: 37480 [2019-12-26 23:13:41,213 INFO L226 Difference]: Without dead ends: 37473 [2019-12-26 23:13:41,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:13:41,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37473 states. [2019-12-26 23:13:41,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37473 to 30132. [2019-12-26 23:13:41,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30132 states. [2019-12-26 23:13:41,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30132 states to 30132 states and 76339 transitions. [2019-12-26 23:13:41,850 INFO L78 Accepts]: Start accepts. Automaton has 30132 states and 76339 transitions. Word has length 97 [2019-12-26 23:13:41,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:41,851 INFO L462 AbstractCegarLoop]: Abstraction has 30132 states and 76339 transitions. [2019-12-26 23:13:41,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:13:41,851 INFO L276 IsEmpty]: Start isEmpty. Operand 30132 states and 76339 transitions. [2019-12-26 23:13:41,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:13:41,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:41,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:13:41,880 INFO L410 AbstractCegarLoop]: === Iteration 50 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:41,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:41,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1166833459, now seen corresponding path program 4 times [2019-12-26 23:13:41,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:41,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112204117] [2019-12-26 23:13:41,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:42,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:13:42,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112204117] [2019-12-26 23:13:42,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:42,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 23:13:42,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472625298] [2019-12-26 23:13:42,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:13:42,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:42,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:13:42,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:13:42,151 INFO L87 Difference]: Start difference. First operand 30132 states and 76339 transitions. Second operand 12 states. [2019-12-26 23:13:44,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:44,175 INFO L93 Difference]: Finished difference Result 45574 states and 113344 transitions. [2019-12-26 23:13:44,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 23:13:44,176 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-12-26 23:13:44,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:44,229 INFO L225 Difference]: With dead ends: 45574 [2019-12-26 23:13:44,229 INFO L226 Difference]: Without dead ends: 45574 [2019-12-26 23:13:44,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-12-26 23:13:44,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45574 states. [2019-12-26 23:13:44,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45574 to 31542. [2019-12-26 23:13:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31542 states. [2019-12-26 23:13:44,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31542 states to 31542 states and 79752 transitions. [2019-12-26 23:13:44,726 INFO L78 Accepts]: Start accepts. Automaton has 31542 states and 79752 transitions. Word has length 97 [2019-12-26 23:13:44,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:44,726 INFO L462 AbstractCegarLoop]: Abstraction has 31542 states and 79752 transitions. [2019-12-26 23:13:44,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:13:44,727 INFO L276 IsEmpty]: Start isEmpty. Operand 31542 states and 79752 transitions. [2019-12-26 23:13:44,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:13:44,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:44,757 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:13:44,757 INFO L410 AbstractCegarLoop]: === Iteration 51 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:44,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:44,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1279789301, now seen corresponding path program 5 times [2019-12-26 23:13:44,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:44,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646391003] [2019-12-26 23:13:44,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:45,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:13:45,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646391003] [2019-12-26 23:13:45,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:45,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-12-26 23:13:45,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393734278] [2019-12-26 23:13:45,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-26 23:13:45,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:45,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-26 23:13:45,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-12-26 23:13:45,602 INFO L87 Difference]: Start difference. First operand 31542 states and 79752 transitions. Second operand 25 states. [2019-12-26 23:13:52,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:52,429 INFO L93 Difference]: Finished difference Result 49410 states and 121900 transitions. [2019-12-26 23:13:52,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-26 23:13:52,430 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 97 [2019-12-26 23:13:52,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:52,478 INFO L225 Difference]: With dead ends: 49410 [2019-12-26 23:13:52,478 INFO L226 Difference]: Without dead ends: 41126 [2019-12-26 23:13:52,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=469, Invalid=3563, Unknown=0, NotChecked=0, Total=4032 [2019-12-26 23:13:52,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41126 states. [2019-12-26 23:13:52,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41126 to 34565. [2019-12-26 23:13:52,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34565 states. [2019-12-26 23:13:52,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34565 states to 34565 states and 87295 transitions. [2019-12-26 23:13:52,920 INFO L78 Accepts]: Start accepts. Automaton has 34565 states and 87295 transitions. Word has length 97 [2019-12-26 23:13:52,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:52,921 INFO L462 AbstractCegarLoop]: Abstraction has 34565 states and 87295 transitions. [2019-12-26 23:13:52,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-26 23:13:52,921 INFO L276 IsEmpty]: Start isEmpty. Operand 34565 states and 87295 transitions. [2019-12-26 23:13:52,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:13:52,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:52,954 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:13:52,954 INFO L410 AbstractCegarLoop]: === Iteration 52 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:52,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:52,954 INFO L82 PathProgramCache]: Analyzing trace with hash -522924491, now seen corresponding path program 6 times [2019-12-26 23:13:52,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:52,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784173850] [2019-12-26 23:13:52,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:53,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:13:53,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784173850] [2019-12-26 23:13:53,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:53,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:13:53,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474073540] [2019-12-26 23:13:53,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:13:53,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:53,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:13:53,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:13:53,028 INFO L87 Difference]: Start difference. First operand 34565 states and 87295 transitions. Second operand 7 states. [2019-12-26 23:13:53,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:53,858 INFO L93 Difference]: Finished difference Result 35570 states and 89568 transitions. [2019-12-26 23:13:53,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:13:53,859 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-26 23:13:53,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:53,900 INFO L225 Difference]: With dead ends: 35570 [2019-12-26 23:13:53,901 INFO L226 Difference]: Without dead ends: 35570 [2019-12-26 23:13:53,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:13:53,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35570 states. [2019-12-26 23:13:54,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35570 to 35014. [2019-12-26 23:13:54,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35014 states. [2019-12-26 23:13:54,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35014 states to 35014 states and 88447 transitions. [2019-12-26 23:13:54,317 INFO L78 Accepts]: Start accepts. Automaton has 35014 states and 88447 transitions. Word has length 97 [2019-12-26 23:13:54,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:54,317 INFO L462 AbstractCegarLoop]: Abstraction has 35014 states and 88447 transitions. [2019-12-26 23:13:54,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:13:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 35014 states and 88447 transitions. [2019-12-26 23:13:54,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:13:54,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:54,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:13:54,350 INFO L410 AbstractCegarLoop]: === Iteration 53 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:54,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:54,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1192282811, now seen corresponding path program 7 times [2019-12-26 23:13:54,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:54,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055131538] [2019-12-26 23:13:54,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:54,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:13:54,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055131538] [2019-12-26 23:13:54,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:54,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:13:54,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930500165] [2019-12-26 23:13:54,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:13:54,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:54,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:13:54,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:13:54,504 INFO L87 Difference]: Start difference. First operand 35014 states and 88447 transitions. Second operand 9 states. [2019-12-26 23:13:55,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:55,391 INFO L93 Difference]: Finished difference Result 44817 states and 113030 transitions. [2019-12-26 23:13:55,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:13:55,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-26 23:13:55,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:55,444 INFO L225 Difference]: With dead ends: 44817 [2019-12-26 23:13:55,444 INFO L226 Difference]: Without dead ends: 44817 [2019-12-26 23:13:55,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:13:55,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44817 states. [2019-12-26 23:13:55,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44817 to 34249. [2019-12-26 23:13:55,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34249 states. [2019-12-26 23:13:56,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34249 states to 34249 states and 86368 transitions. [2019-12-26 23:13:56,210 INFO L78 Accepts]: Start accepts. Automaton has 34249 states and 86368 transitions. Word has length 97 [2019-12-26 23:13:56,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:56,210 INFO L462 AbstractCegarLoop]: Abstraction has 34249 states and 86368 transitions. [2019-12-26 23:13:56,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:13:56,210 INFO L276 IsEmpty]: Start isEmpty. Operand 34249 states and 86368 transitions. [2019-12-26 23:13:56,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:13:56,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:56,241 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:13:56,241 INFO L410 AbstractCegarLoop]: === Iteration 54 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:56,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:56,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1147784417, now seen corresponding path program 8 times [2019-12-26 23:13:56,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:56,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46166911] [2019-12-26 23:13:56,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:57,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:13:57,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46166911] [2019-12-26 23:13:57,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:57,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-12-26 23:13:57,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508671887] [2019-12-26 23:13:57,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-26 23:13:57,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:57,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-26 23:13:57,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2019-12-26 23:13:57,270 INFO L87 Difference]: Start difference. First operand 34249 states and 86368 transitions. Second operand 28 states. [2019-12-26 23:14:03,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:03,089 INFO L93 Difference]: Finished difference Result 41514 states and 104529 transitions. [2019-12-26 23:14:03,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-26 23:14:03,090 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 97 [2019-12-26 23:14:03,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:03,139 INFO L225 Difference]: With dead ends: 41514 [2019-12-26 23:14:03,139 INFO L226 Difference]: Without dead ends: 41514 [2019-12-26 23:14:03,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=240, Invalid=1740, Unknown=0, NotChecked=0, Total=1980 [2019-12-26 23:14:03,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41514 states. [2019-12-26 23:14:03,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41514 to 35563. [2019-12-26 23:14:03,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35563 states. [2019-12-26 23:14:03,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35563 states to 35563 states and 89703 transitions. [2019-12-26 23:14:03,588 INFO L78 Accepts]: Start accepts. Automaton has 35563 states and 89703 transitions. Word has length 97 [2019-12-26 23:14:03,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:03,588 INFO L462 AbstractCegarLoop]: Abstraction has 35563 states and 89703 transitions. [2019-12-26 23:14:03,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-26 23:14:03,588 INFO L276 IsEmpty]: Start isEmpty. Operand 35563 states and 89703 transitions. [2019-12-26 23:14:03,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:14:03,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:03,622 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:14:03,622 INFO L410 AbstractCegarLoop]: === Iteration 55 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:03,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:03,622 INFO L82 PathProgramCache]: Analyzing trace with hash -15464881, now seen corresponding path program 9 times [2019-12-26 23:14:03,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:03,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766814888] [2019-12-26 23:14:03,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:03,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:14:03,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766814888] [2019-12-26 23:14:03,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:03,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:14:03,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046740231] [2019-12-26 23:14:03,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:14:03,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:03,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:14:03,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:14:03,832 INFO L87 Difference]: Start difference. First operand 35563 states and 89703 transitions. Second operand 10 states. [2019-12-26 23:14:05,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:05,058 INFO L93 Difference]: Finished difference Result 48511 states and 122264 transitions. [2019-12-26 23:14:05,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 23:14:05,058 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-26 23:14:05,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:05,113 INFO L225 Difference]: With dead ends: 48511 [2019-12-26 23:14:05,113 INFO L226 Difference]: Without dead ends: 48502 [2019-12-26 23:14:05,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-26 23:14:05,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48502 states. [2019-12-26 23:14:05,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48502 to 32599. [2019-12-26 23:14:05,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32599 states. [2019-12-26 23:14:05,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32599 states to 32599 states and 82056 transitions. [2019-12-26 23:14:05,759 INFO L78 Accepts]: Start accepts. Automaton has 32599 states and 82056 transitions. Word has length 97 [2019-12-26 23:14:05,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:05,760 INFO L462 AbstractCegarLoop]: Abstraction has 32599 states and 82056 transitions. [2019-12-26 23:14:05,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:14:05,760 INFO L276 IsEmpty]: Start isEmpty. Operand 32599 states and 82056 transitions. [2019-12-26 23:14:05,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:14:05,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:05,791 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:14:05,791 INFO L410 AbstractCegarLoop]: === Iteration 56 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:05,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:05,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1419727447, now seen corresponding path program 10 times [2019-12-26 23:14:05,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:05,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363618425] [2019-12-26 23:14:05,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:14:05,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363618425] [2019-12-26 23:14:05,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:05,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:14:05,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974312366] [2019-12-26 23:14:05,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:14:05,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:05,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:14:05,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:14:05,921 INFO L87 Difference]: Start difference. First operand 32599 states and 82056 transitions. Second operand 9 states. [2019-12-26 23:14:06,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:06,982 INFO L93 Difference]: Finished difference Result 44833 states and 112670 transitions. [2019-12-26 23:14:06,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:14:06,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-26 23:14:06,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:07,034 INFO L225 Difference]: With dead ends: 44833 [2019-12-26 23:14:07,034 INFO L226 Difference]: Without dead ends: 44833 [2019-12-26 23:14:07,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:14:07,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44833 states. [2019-12-26 23:14:07,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44833 to 32145. [2019-12-26 23:14:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32145 states. [2019-12-26 23:14:07,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32145 states to 32145 states and 80912 transitions. [2019-12-26 23:14:07,484 INFO L78 Accepts]: Start accepts. Automaton has 32145 states and 80912 transitions. Word has length 97 [2019-12-26 23:14:07,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:07,484 INFO L462 AbstractCegarLoop]: Abstraction has 32145 states and 80912 transitions. [2019-12-26 23:14:07,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:14:07,485 INFO L276 IsEmpty]: Start isEmpty. Operand 32145 states and 80912 transitions. [2019-12-26 23:14:07,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:14:07,514 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:07,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:14:07,514 INFO L410 AbstractCegarLoop]: === Iteration 57 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:07,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:07,514 INFO L82 PathProgramCache]: Analyzing trace with hash -920339781, now seen corresponding path program 11 times [2019-12-26 23:14:07,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:07,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911897189] [2019-12-26 23:14:07,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:08,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:14:08,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911897189] [2019-12-26 23:14:08,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:08,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-26 23:14:08,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200330680] [2019-12-26 23:14:08,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-26 23:14:08,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:08,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-26 23:14:08,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2019-12-26 23:14:08,282 INFO L87 Difference]: Start difference. First operand 32145 states and 80912 transitions. Second operand 24 states. [2019-12-26 23:14:12,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:12,612 INFO L93 Difference]: Finished difference Result 37503 states and 94077 transitions. [2019-12-26 23:14:12,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-26 23:14:12,612 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 97 [2019-12-26 23:14:12,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:12,656 INFO L225 Difference]: With dead ends: 37503 [2019-12-26 23:14:12,656 INFO L226 Difference]: Without dead ends: 37503 [2019-12-26 23:14:12,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=245, Invalid=1561, Unknown=0, NotChecked=0, Total=1806 [2019-12-26 23:14:12,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37503 states. [2019-12-26 23:14:13,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37503 to 32841. [2019-12-26 23:14:13,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32841 states. [2019-12-26 23:14:13,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32841 states to 32841 states and 82594 transitions. [2019-12-26 23:14:13,263 INFO L78 Accepts]: Start accepts. Automaton has 32841 states and 82594 transitions. Word has length 97 [2019-12-26 23:14:13,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:13,264 INFO L462 AbstractCegarLoop]: Abstraction has 32841 states and 82594 transitions. [2019-12-26 23:14:13,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-26 23:14:13,264 INFO L276 IsEmpty]: Start isEmpty. Operand 32841 states and 82594 transitions. [2019-12-26 23:14:13,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:14:13,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:13,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:14:13,294 INFO L410 AbstractCegarLoop]: === Iteration 58 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:13,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:13,294 INFO L82 PathProgramCache]: Analyzing trace with hash 211979755, now seen corresponding path program 12 times [2019-12-26 23:14:13,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:13,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858815349] [2019-12-26 23:14:13,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:13,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:14:13,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858815349] [2019-12-26 23:14:13,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:13,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-26 23:14:13,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658281495] [2019-12-26 23:14:13,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 23:14:13,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:13,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 23:14:13,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:14:13,573 INFO L87 Difference]: Start difference. First operand 32841 states and 82594 transitions. Second operand 14 states. [2019-12-26 23:14:15,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:15,692 INFO L93 Difference]: Finished difference Result 45726 states and 113923 transitions. [2019-12-26 23:14:15,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 23:14:15,693 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2019-12-26 23:14:15,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:15,746 INFO L225 Difference]: With dead ends: 45726 [2019-12-26 23:14:15,746 INFO L226 Difference]: Without dead ends: 45726 [2019-12-26 23:14:15,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2019-12-26 23:14:15,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45726 states. [2019-12-26 23:14:16,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45726 to 35417. [2019-12-26 23:14:16,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35417 states. [2019-12-26 23:14:16,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35417 states to 35417 states and 89093 transitions. [2019-12-26 23:14:16,241 INFO L78 Accepts]: Start accepts. Automaton has 35417 states and 89093 transitions. Word has length 97 [2019-12-26 23:14:16,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:16,241 INFO L462 AbstractCegarLoop]: Abstraction has 35417 states and 89093 transitions. [2019-12-26 23:14:16,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 23:14:16,241 INFO L276 IsEmpty]: Start isEmpty. Operand 35417 states and 89093 transitions. [2019-12-26 23:14:16,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:14:16,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:16,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:14:16,275 INFO L410 AbstractCegarLoop]: === Iteration 59 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:16,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:16,275 INFO L82 PathProgramCache]: Analyzing trace with hash 632383657, now seen corresponding path program 13 times [2019-12-26 23:14:16,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:16,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372892687] [2019-12-26 23:14:16,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:16,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:14:16,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372892687] [2019-12-26 23:14:16,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:16,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:14:16,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81129317] [2019-12-26 23:14:16,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:14:16,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:16,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:14:16,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:14:16,423 INFO L87 Difference]: Start difference. First operand 35417 states and 89093 transitions. Second operand 9 states. [2019-12-26 23:14:17,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:17,583 INFO L93 Difference]: Finished difference Result 46385 states and 116319 transitions. [2019-12-26 23:14:17,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 23:14:17,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-26 23:14:17,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:17,638 INFO L225 Difference]: With dead ends: 46385 [2019-12-26 23:14:17,638 INFO L226 Difference]: Without dead ends: 46385 [2019-12-26 23:14:17,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-26 23:14:17,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46385 states. [2019-12-26 23:14:18,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46385 to 35509. [2019-12-26 23:14:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35509 states. [2019-12-26 23:14:18,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35509 states to 35509 states and 89314 transitions. [2019-12-26 23:14:18,119 INFO L78 Accepts]: Start accepts. Automaton has 35509 states and 89314 transitions. Word has length 97 [2019-12-26 23:14:18,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:18,119 INFO L462 AbstractCegarLoop]: Abstraction has 35509 states and 89314 transitions. [2019-12-26 23:14:18,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:14:18,119 INFO L276 IsEmpty]: Start isEmpty. Operand 35509 states and 89314 transitions. [2019-12-26 23:14:18,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:14:18,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:18,151 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:14:18,151 INFO L410 AbstractCegarLoop]: === Iteration 60 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:18,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:18,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1707683571, now seen corresponding path program 14 times [2019-12-26 23:14:18,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:18,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381315605] [2019-12-26 23:14:18,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:14:18,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381315605] [2019-12-26 23:14:18,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:18,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-12-26 23:14:18,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556849330] [2019-12-26 23:14:18,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-26 23:14:18,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:18,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-26 23:14:18,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2019-12-26 23:14:18,922 INFO L87 Difference]: Start difference. First operand 35509 states and 89314 transitions. Second operand 25 states. [2019-12-26 23:14:19,657 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-12-26 23:14:24,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:24,559 INFO L93 Difference]: Finished difference Result 41892 states and 105058 transitions. [2019-12-26 23:14:24,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-26 23:14:24,560 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 97 [2019-12-26 23:14:24,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:24,610 INFO L225 Difference]: With dead ends: 41892 [2019-12-26 23:14:24,610 INFO L226 Difference]: Without dead ends: 41892 [2019-12-26 23:14:24,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=258, Invalid=1722, Unknown=0, NotChecked=0, Total=1980 [2019-12-26 23:14:24,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41892 states. [2019-12-26 23:14:25,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41892 to 35527. [2019-12-26 23:14:25,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35527 states. [2019-12-26 23:14:25,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35527 states to 35527 states and 89355 transitions. [2019-12-26 23:14:25,070 INFO L78 Accepts]: Start accepts. Automaton has 35527 states and 89355 transitions. Word has length 97 [2019-12-26 23:14:25,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:25,070 INFO L462 AbstractCegarLoop]: Abstraction has 35527 states and 89355 transitions. [2019-12-26 23:14:25,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-26 23:14:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 35527 states and 89355 transitions. [2019-12-26 23:14:25,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:14:25,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:25,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:14:25,103 INFO L410 AbstractCegarLoop]: === Iteration 61 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:25,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:25,103 INFO L82 PathProgramCache]: Analyzing trace with hash -575364035, now seen corresponding path program 15 times [2019-12-26 23:14:25,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:25,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098959175] [2019-12-26 23:14:25,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:14:25,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098959175] [2019-12-26 23:14:25,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:25,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:14:25,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342597370] [2019-12-26 23:14:25,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:14:25,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:25,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:14:25,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:14:25,209 INFO L87 Difference]: Start difference. First operand 35527 states and 89355 transitions. Second operand 6 states. [2019-12-26 23:14:25,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:25,693 INFO L93 Difference]: Finished difference Result 44662 states and 110711 transitions. [2019-12-26 23:14:25,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:14:25,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-26 23:14:25,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:25,745 INFO L225 Difference]: With dead ends: 44662 [2019-12-26 23:14:25,746 INFO L226 Difference]: Without dead ends: 44662 [2019-12-26 23:14:25,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:14:25,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44662 states. [2019-12-26 23:14:26,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44662 to 34547. [2019-12-26 23:14:26,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34547 states. [2019-12-26 23:14:26,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34547 states to 34547 states and 86644 transitions. [2019-12-26 23:14:26,229 INFO L78 Accepts]: Start accepts. Automaton has 34547 states and 86644 transitions. Word has length 97 [2019-12-26 23:14:26,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:26,229 INFO L462 AbstractCegarLoop]: Abstraction has 34547 states and 86644 transitions. [2019-12-26 23:14:26,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:14:26,229 INFO L276 IsEmpty]: Start isEmpty. Operand 34547 states and 86644 transitions. [2019-12-26 23:14:26,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-26 23:14:26,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:26,265 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:14:26,265 INFO L410 AbstractCegarLoop]: === Iteration 62 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:26,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:26,265 INFO L82 PathProgramCache]: Analyzing trace with hash -758422154, now seen corresponding path program 1 times [2019-12-26 23:14:26,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:26,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807422288] [2019-12-26 23:14:26,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:26,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:14:26,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807422288] [2019-12-26 23:14:26,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:26,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-26 23:14:26,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804123254] [2019-12-26 23:14:26,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-26 23:14:26,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:26,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-26 23:14:26,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-12-26 23:14:26,721 INFO L87 Difference]: Start difference. First operand 34547 states and 86644 transitions. Second operand 18 states. [2019-12-26 23:14:33,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:33,528 INFO L93 Difference]: Finished difference Result 48698 states and 121202 transitions. [2019-12-26 23:14:33,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-12-26 23:14:33,529 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2019-12-26 23:14:33,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:33,585 INFO L225 Difference]: With dead ends: 48698 [2019-12-26 23:14:33,585 INFO L226 Difference]: Without dead ends: 47235 [2019-12-26 23:14:33,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1426 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=641, Invalid=4189, Unknown=0, NotChecked=0, Total=4830 [2019-12-26 23:14:33,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47235 states. [2019-12-26 23:14:34,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47235 to 34690. [2019-12-26 23:14:34,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34690 states. [2019-12-26 23:14:34,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34690 states to 34690 states and 86969 transitions. [2019-12-26 23:14:34,098 INFO L78 Accepts]: Start accepts. Automaton has 34690 states and 86969 transitions. Word has length 98 [2019-12-26 23:14:34,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:34,098 INFO L462 AbstractCegarLoop]: Abstraction has 34690 states and 86969 transitions. [2019-12-26 23:14:34,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-26 23:14:34,099 INFO L276 IsEmpty]: Start isEmpty. Operand 34690 states and 86969 transitions. [2019-12-26 23:14:34,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-26 23:14:34,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:34,137 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:14:34,137 INFO L410 AbstractCegarLoop]: === Iteration 63 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:34,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:34,138 INFO L82 PathProgramCache]: Analyzing trace with hash 820119886, now seen corresponding path program 2 times [2019-12-26 23:14:34,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:34,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156908410] [2019-12-26 23:14:34,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:34,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:14:34,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156908410] [2019-12-26 23:14:34,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:34,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-26 23:14:34,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186587050] [2019-12-26 23:14:34,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-26 23:14:34,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:34,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-26 23:14:34,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2019-12-26 23:14:34,967 INFO L87 Difference]: Start difference. First operand 34690 states and 86969 transitions. Second operand 24 states. [2019-12-26 23:14:40,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:40,593 INFO L93 Difference]: Finished difference Result 43383 states and 106976 transitions. [2019-12-26 23:14:40,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-26 23:14:40,593 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 98 [2019-12-26 23:14:40,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:40,638 INFO L225 Difference]: With dead ends: 43383 [2019-12-26 23:14:40,638 INFO L226 Difference]: Without dead ends: 40988 [2019-12-26 23:14:40,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=193, Invalid=1447, Unknown=0, NotChecked=0, Total=1640 [2019-12-26 23:14:40,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40988 states. [2019-12-26 23:14:41,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40988 to 37803. [2019-12-26 23:14:41,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37803 states. [2019-12-26 23:14:41,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37803 states to 37803 states and 94594 transitions. [2019-12-26 23:14:41,092 INFO L78 Accepts]: Start accepts. Automaton has 37803 states and 94594 transitions. Word has length 98 [2019-12-26 23:14:41,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:41,092 INFO L462 AbstractCegarLoop]: Abstraction has 37803 states and 94594 transitions. [2019-12-26 23:14:41,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-26 23:14:41,092 INFO L276 IsEmpty]: Start isEmpty. Operand 37803 states and 94594 transitions. [2019-12-26 23:14:41,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-26 23:14:41,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:41,127 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:14:41,128 INFO L410 AbstractCegarLoop]: === Iteration 64 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:41,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:41,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1000874840, now seen corresponding path program 3 times [2019-12-26 23:14:41,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:41,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848035149] [2019-12-26 23:14:41,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:14:41,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848035149] [2019-12-26 23:14:41,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:41,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-26 23:14:41,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614315791] [2019-12-26 23:14:41,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-26 23:14:41,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:41,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-26 23:14:41,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2019-12-26 23:14:41,922 INFO L87 Difference]: Start difference. First operand 37803 states and 94594 transitions. Second operand 23 states. [2019-12-26 23:14:46,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:46,937 INFO L93 Difference]: Finished difference Result 40654 states and 100769 transitions. [2019-12-26 23:14:46,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-26 23:14:46,937 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 98 [2019-12-26 23:14:46,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:46,984 INFO L225 Difference]: With dead ends: 40654 [2019-12-26 23:14:46,984 INFO L226 Difference]: Without dead ends: 39950 [2019-12-26 23:14:46,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=175, Invalid=1231, Unknown=0, NotChecked=0, Total=1406 [2019-12-26 23:14:47,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39950 states. [2019-12-26 23:14:47,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39950 to 36869. [2019-12-26 23:14:47,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36869 states. [2019-12-26 23:14:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36869 states to 36869 states and 92293 transitions. [2019-12-26 23:14:47,473 INFO L78 Accepts]: Start accepts. Automaton has 36869 states and 92293 transitions. Word has length 98 [2019-12-26 23:14:47,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:47,473 INFO L462 AbstractCegarLoop]: Abstraction has 36869 states and 92293 transitions. [2019-12-26 23:14:47,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-26 23:14:47,474 INFO L276 IsEmpty]: Start isEmpty. Operand 36869 states and 92293 transitions. [2019-12-26 23:14:47,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-26 23:14:47,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:47,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-26 23:14:47,509 INFO L410 AbstractCegarLoop]: === Iteration 65 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:47,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:47,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1700655026, now seen corresponding path program 4 times [2019-12-26 23:14:47,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:47,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605789744] [2019-12-26 23:14:47,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:48,174 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 23 [2019-12-26 23:14:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:14:48,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605789744] [2019-12-26 23:14:48,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:48,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-26 23:14:48,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068995255] [2019-12-26 23:14:48,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-26 23:14:48,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:48,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-26 23:14:48,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:14:48,618 INFO L87 Difference]: Start difference. First operand 36869 states and 92293 transitions. Second operand 22 states. Received shutdown request... [2019-12-26 23:14:51,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-26 23:14:51,388 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-26 23:14:51,394 WARN L227 ceAbstractionStarter]: Timeout [2019-12-26 23:14:51,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:14:51 BasicIcfg [2019-12-26 23:14:51,394 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:14:51,395 INFO L168 Benchmark]: Toolchain (without parser) took 219261.87 ms. Allocated memory was 142.6 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 97.6 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-26 23:14:51,396 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 142.6 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 23:14:51,396 INFO L168 Benchmark]: CACSL2BoogieTranslator took 816.39 ms. Allocated memory was 142.6 MB in the beginning and 200.8 MB in the end (delta: 58.2 MB). Free memory was 97.4 MB in the beginning and 150.7 MB in the end (delta: -53.4 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:14:51,396 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.20 ms. Allocated memory is still 200.8 MB. Free memory was 150.7 MB in the beginning and 147.1 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:14:51,397 INFO L168 Benchmark]: Boogie Preprocessor took 47.54 ms. Allocated memory is still 200.8 MB. Free memory was 147.1 MB in the beginning and 143.6 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:14:51,397 INFO L168 Benchmark]: RCFGBuilder took 1188.11 ms. Allocated memory was 200.8 MB in the beginning and 229.1 MB in the end (delta: 28.3 MB). Free memory was 143.6 MB in the beginning and 188.6 MB in the end (delta: -45.0 MB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:14:51,398 INFO L168 Benchmark]: TraceAbstraction took 217121.32 ms. Allocated memory was 229.1 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 188.6 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-26 23:14:51,400 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48 ms. Allocated memory is still 142.6 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 816.39 ms. Allocated memory was 142.6 MB in the beginning and 200.8 MB in the end (delta: 58.2 MB). Free memory was 97.4 MB in the beginning and 150.7 MB in the end (delta: -53.4 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.20 ms. Allocated memory is still 200.8 MB. Free memory was 150.7 MB in the beginning and 147.1 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.54 ms. Allocated memory is still 200.8 MB. Free memory was 147.1 MB in the beginning and 143.6 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1188.11 ms. Allocated memory was 200.8 MB in the beginning and 229.1 MB in the end (delta: 28.3 MB). Free memory was 143.6 MB in the beginning and 188.6 MB in the end (delta: -45.0 MB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 217121.32 ms. Allocated memory was 229.1 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 188.6 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.4s, 244 ProgramPointsBefore, 154 ProgramPointsAfterwards, 326 TransitionsBefore, 193 TransitionsAfterwards, 56026 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 76 ConcurrentYvCompositions, 46 ChoiceCompositions, 19062 VarBasedMoverChecksPositive, 524 VarBasedMoverChecksNegative, 190 SemBasedMoverChecksPositive, 479 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.2s, 0 MoverChecksTotal, 326763 CheckedPairsTotal, 143 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (36869states) and FLOYD_HOARE automaton (currently 35 states, 22 states before enhancement),while ReachableStatesComputation was computing reachable states (756 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (36869states) and FLOYD_HOARE automaton (currently 35 states, 22 states before enhancement),while ReachableStatesComputation was computing reachable states (756 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 216.9s, OverallIterations: 65, TraceHistogramMax: 1, AutomataDifference: 122.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 28048 SDtfs, 35009 SDslu, 151615 SDs, 0 SdLazy, 92015 SolverSat, 2125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 74.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1478 GetRequests, 237 SyntacticMatches, 115 SemanticMatches, 1126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8218 ImplicationChecksByTransitivity, 21.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184484occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 53.0s AutomataMinimizationTime, 64 MinimizatonAttempts, 360795 StatesRemovedByMinimization, 63 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 13.7s InterpolantComputationTime, 5617 NumberOfCodeBlocks, 5617 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 5552 ConstructedInterpolants, 0 QuantifiedInterpolants, 2253941 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 65 InterpolantComputations, 65 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown