/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/mix024_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:58:40,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:58:40,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:58:41,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:58:41,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:58:41,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:58:41,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:58:41,026 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:58:41,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:58:41,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:58:41,037 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:58:41,038 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:58:41,038 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:58:41,039 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:58:41,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:58:41,044 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:58:41,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:58:41,045 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:58:41,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:58:41,055 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:58:41,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:58:41,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:58:41,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:58:41,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:58:41,067 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:58:41,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:58:41,067 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:58:41,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:58:41,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:58:41,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:58:41,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:58:41,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:58:41,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:58:41,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:58:41,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:58:41,074 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:58:41,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:58:41,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:58:41,075 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:58:41,076 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:58:41,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:58:41,077 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 21:58:41,090 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:58:41,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:58:41,092 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:58:41,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:58:41,092 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:58:41,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:58:41,093 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:58:41,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:58:41,093 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:58:41,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:58:41,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:58:41,094 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:58:41,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:58:41,094 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:58:41,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:58:41,094 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:58:41,095 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:58:41,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:58:41,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:58:41,095 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:58:41,095 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:58:41,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:58:41,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:58:41,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:58:41,096 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:58:41,096 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:58:41,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:58:41,097 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:58:41,097 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:58:41,097 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:58:41,392 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:58:41,410 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:58:41,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:58:41,416 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:58:41,416 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:58:41,417 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_pso.opt.i [2019-12-26 21:58:41,489 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b2f79f9f/1e2946ada4004b22a514e4aa87bf7f3b/FLAG9fc5c675f [2019-12-26 21:58:42,039 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:58:42,040 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_pso.opt.i [2019-12-26 21:58:42,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b2f79f9f/1e2946ada4004b22a514e4aa87bf7f3b/FLAG9fc5c675f [2019-12-26 21:58:42,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b2f79f9f/1e2946ada4004b22a514e4aa87bf7f3b [2019-12-26 21:58:42,281 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:58:42,283 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:58:42,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:58:42,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:58:42,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:58:42,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:58:42" (1/1) ... [2019-12-26 21:58:42,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dc701e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:42, skipping insertion in model container [2019-12-26 21:58:42,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:58:42" (1/1) ... [2019-12-26 21:58:42,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:58:42,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:58:42,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:58:42,932 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:58:43,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:58:43,092 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:58:43,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:43 WrapperNode [2019-12-26 21:58:43,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:58:43,093 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:58:43,093 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:58:43,093 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:58:43,103 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:43" (1/1) ... [2019-12-26 21:58:43,124 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:43" (1/1) ... [2019-12-26 21:58:43,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:58:43,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:58:43,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:58:43,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:58:43,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:43" (1/1) ... [2019-12-26 21:58:43,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:43" (1/1) ... [2019-12-26 21:58:43,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:43" (1/1) ... [2019-12-26 21:58:43,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:43" (1/1) ... [2019-12-26 21:58:43,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:43" (1/1) ... [2019-12-26 21:58:43,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:43" (1/1) ... [2019-12-26 21:58:43,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:43" (1/1) ... [2019-12-26 21:58:43,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:58:43,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:58:43,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:58:43,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:58:43,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:43" (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 21:58:43,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:58:43,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:58:43,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:58:43,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:58:43,266 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:58:43,266 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:58:43,267 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:58:43,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:58:43,267 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:58:43,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:58:43,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:58:43,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:58:43,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:58:43,270 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 21:58:44,024 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:58:44,024 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:58:44,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:58:44 BoogieIcfgContainer [2019-12-26 21:58:44,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:58:44,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:58:44,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:58:44,031 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:58:44,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:58:42" (1/3) ... [2019-12-26 21:58:44,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30670a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:58:44, skipping insertion in model container [2019-12-26 21:58:44,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:58:43" (2/3) ... [2019-12-26 21:58:44,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30670a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:58:44, skipping insertion in model container [2019-12-26 21:58:44,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:58:44" (3/3) ... [2019-12-26 21:58:44,036 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_pso.opt.i [2019-12-26 21:58:44,047 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:58:44,047 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:58:44,058 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:58:44,059 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:58:44,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,104 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,104 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,105 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,105 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,109 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,110 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,146 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,147 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,147 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,147 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,148 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,154 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,154 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,164 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,165 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,172 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,173 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,173 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,181 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,181 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:58:44,197 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 21:58:44,219 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:58:44,219 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:58:44,219 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:58:44,219 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:58:44,219 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:58:44,220 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:58:44,220 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:58:44,220 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:58:44,245 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-26 21:58:44,247 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-26 21:58:44,344 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-26 21:58:44,345 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:58:44,360 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 21:58:44,381 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-26 21:58:44,433 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-26 21:58:44,433 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:58:44,441 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 21:58:44,461 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-26 21:58:44,462 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:58:48,560 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2019-12-26 21:58:50,490 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-26 21:58:50,635 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-26 21:58:50,659 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74173 [2019-12-26 21:58:50,659 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-26 21:58:50,662 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 90 transitions [2019-12-26 21:59:01,340 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 82802 states. [2019-12-26 21:59:01,342 INFO L276 IsEmpty]: Start isEmpty. Operand 82802 states. [2019-12-26 21:59:01,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 21:59:01,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:01,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 21:59:01,350 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:01,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:01,363 INFO L82 PathProgramCache]: Analyzing trace with hash 803939489, now seen corresponding path program 1 times [2019-12-26 21:59:01,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:01,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226629865] [2019-12-26 21:59:01,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:01,649 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 21:59:01,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226629865] [2019-12-26 21:59:01,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:01,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:59:01,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991691307] [2019-12-26 21:59:01,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:59:01,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:01,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:59:01,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:59:01,670 INFO L87 Difference]: Start difference. First operand 82802 states. Second operand 3 states. [2019-12-26 21:59:04,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:04,253 INFO L93 Difference]: Finished difference Result 81762 states and 350164 transitions. [2019-12-26 21:59:04,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:59:04,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 21:59:04,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:04,845 INFO L225 Difference]: With dead ends: 81762 [2019-12-26 21:59:04,845 INFO L226 Difference]: Without dead ends: 77082 [2019-12-26 21:59:04,847 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 21:59:08,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77082 states. [2019-12-26 21:59:11,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77082 to 77082. [2019-12-26 21:59:11,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77082 states. [2019-12-26 21:59:14,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77082 states to 77082 states and 329650 transitions. [2019-12-26 21:59:14,681 INFO L78 Accepts]: Start accepts. Automaton has 77082 states and 329650 transitions. Word has length 5 [2019-12-26 21:59:14,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:14,681 INFO L462 AbstractCegarLoop]: Abstraction has 77082 states and 329650 transitions. [2019-12-26 21:59:14,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:59:14,681 INFO L276 IsEmpty]: Start isEmpty. Operand 77082 states and 329650 transitions. [2019-12-26 21:59:14,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:59:14,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:14,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:14,691 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:14,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:14,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1596901179, now seen corresponding path program 1 times [2019-12-26 21:59:14,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:14,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437573566] [2019-12-26 21:59:14,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:14,761 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 21:59:14,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437573566] [2019-12-26 21:59:14,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:14,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:59:14,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010133694] [2019-12-26 21:59:14,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:59:14,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:14,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:59:14,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:59:14,764 INFO L87 Difference]: Start difference. First operand 77082 states and 329650 transitions. Second operand 3 states. [2019-12-26 21:59:14,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:14,933 INFO L93 Difference]: Finished difference Result 20478 states and 70372 transitions. [2019-12-26 21:59:14,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:59:14,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 21:59:14,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:15,083 INFO L225 Difference]: With dead ends: 20478 [2019-12-26 21:59:15,084 INFO L226 Difference]: Without dead ends: 20478 [2019-12-26 21:59:15,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 21:59:15,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20478 states. [2019-12-26 21:59:15,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20478 to 20478. [2019-12-26 21:59:15,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20478 states. [2019-12-26 21:59:15,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20478 states to 20478 states and 70372 transitions. [2019-12-26 21:59:15,586 INFO L78 Accepts]: Start accepts. Automaton has 20478 states and 70372 transitions. Word has length 13 [2019-12-26 21:59:15,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:15,587 INFO L462 AbstractCegarLoop]: Abstraction has 20478 states and 70372 transitions. [2019-12-26 21:59:15,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:59:15,587 INFO L276 IsEmpty]: Start isEmpty. Operand 20478 states and 70372 transitions. [2019-12-26 21:59:15,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 21:59:15,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:15,589 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:15,590 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:15,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:15,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1662041210, now seen corresponding path program 1 times [2019-12-26 21:59:15,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:15,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123223339] [2019-12-26 21:59:15,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:15,671 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 21:59:15,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123223339] [2019-12-26 21:59:15,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:15,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:59:15,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287133939] [2019-12-26 21:59:15,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:59:15,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:15,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:59:15,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:59:15,674 INFO L87 Difference]: Start difference. First operand 20478 states and 70372 transitions. Second operand 4 states. [2019-12-26 21:59:16,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:16,010 INFO L93 Difference]: Finished difference Result 30802 states and 102312 transitions. [2019-12-26 21:59:16,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:59:16,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 21:59:16,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:16,093 INFO L225 Difference]: With dead ends: 30802 [2019-12-26 21:59:16,093 INFO L226 Difference]: Without dead ends: 30788 [2019-12-26 21:59:16,094 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 21:59:16,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30788 states. [2019-12-26 21:59:17,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30788 to 27348. [2019-12-26 21:59:17,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27348 states. [2019-12-26 21:59:17,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27348 states to 27348 states and 91824 transitions. [2019-12-26 21:59:17,452 INFO L78 Accepts]: Start accepts. Automaton has 27348 states and 91824 transitions. Word has length 13 [2019-12-26 21:59:17,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:17,452 INFO L462 AbstractCegarLoop]: Abstraction has 27348 states and 91824 transitions. [2019-12-26 21:59:17,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:59:17,453 INFO L276 IsEmpty]: Start isEmpty. Operand 27348 states and 91824 transitions. [2019-12-26 21:59:17,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 21:59:17,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:17,455 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:17,455 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:17,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:17,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1480512145, now seen corresponding path program 1 times [2019-12-26 21:59:17,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:17,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493157857] [2019-12-26 21:59:17,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:17,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:17,546 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 21:59:17,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493157857] [2019-12-26 21:59:17,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:17,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:59:17,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385849087] [2019-12-26 21:59:17,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:59:17,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:17,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:59:17,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:59:17,553 INFO L87 Difference]: Start difference. First operand 27348 states and 91824 transitions. Second operand 4 states. [2019-12-26 21:59:17,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:17,867 INFO L93 Difference]: Finished difference Result 35523 states and 117963 transitions. [2019-12-26 21:59:17,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:59:17,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 21:59:17,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:17,956 INFO L225 Difference]: With dead ends: 35523 [2019-12-26 21:59:17,956 INFO L226 Difference]: Without dead ends: 35512 [2019-12-26 21:59:17,957 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 21:59:18,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35512 states. [2019-12-26 21:59:18,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35512 to 30900. [2019-12-26 21:59:18,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30900 states. [2019-12-26 21:59:19,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30900 states to 30900 states and 103384 transitions. [2019-12-26 21:59:19,208 INFO L78 Accepts]: Start accepts. Automaton has 30900 states and 103384 transitions. Word has length 14 [2019-12-26 21:59:19,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:19,210 INFO L462 AbstractCegarLoop]: Abstraction has 30900 states and 103384 transitions. [2019-12-26 21:59:19,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:59:19,210 INFO L276 IsEmpty]: Start isEmpty. Operand 30900 states and 103384 transitions. [2019-12-26 21:59:19,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 21:59:19,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:19,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:59:19,212 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:19,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:19,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1480362260, now seen corresponding path program 1 times [2019-12-26 21:59:19,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:19,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027366518] [2019-12-26 21:59:19,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:19,313 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 21:59:19,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027366518] [2019-12-26 21:59:19,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:19,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:59:19,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679164625] [2019-12-26 21:59:19,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:59:19,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:19,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:59:19,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:59:19,315 INFO L87 Difference]: Start difference. First operand 30900 states and 103384 transitions. Second operand 4 states. [2019-12-26 21:59:19,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:19,655 INFO L93 Difference]: Finished difference Result 38443 states and 127475 transitions. [2019-12-26 21:59:19,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:59:19,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 21:59:19,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:19,759 INFO L225 Difference]: With dead ends: 38443 [2019-12-26 21:59:19,759 INFO L226 Difference]: Without dead ends: 38432 [2019-12-26 21:59:19,760 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 21:59:19,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38432 states. [2019-12-26 21:59:20,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38432 to 30923. [2019-12-26 21:59:20,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30923 states. [2019-12-26 21:59:20,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30923 states to 30923 states and 103333 transitions. [2019-12-26 21:59:20,432 INFO L78 Accepts]: Start accepts. Automaton has 30923 states and 103333 transitions. Word has length 14 [2019-12-26 21:59:20,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:20,432 INFO L462 AbstractCegarLoop]: Abstraction has 30923 states and 103333 transitions. [2019-12-26 21:59:20,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:59:20,432 INFO L276 IsEmpty]: Start isEmpty. Operand 30923 states and 103333 transitions. [2019-12-26 21:59:20,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:59:20,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:20,441 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] [2019-12-26 21:59:20,441 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:20,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:20,442 INFO L82 PathProgramCache]: Analyzing trace with hash 2067973460, now seen corresponding path program 1 times [2019-12-26 21:59:20,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:20,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154444995] [2019-12-26 21:59:20,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:20,550 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 21:59:20,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154444995] [2019-12-26 21:59:20,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:20,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:59:20,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826091552] [2019-12-26 21:59:20,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:59:20,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:20,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:59:20,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:59:20,552 INFO L87 Difference]: Start difference. First operand 30923 states and 103333 transitions. Second operand 5 states. [2019-12-26 21:59:21,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:21,453 INFO L93 Difference]: Finished difference Result 45281 states and 149378 transitions. [2019-12-26 21:59:21,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:59:21,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 21:59:21,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:21,536 INFO L225 Difference]: With dead ends: 45281 [2019-12-26 21:59:21,536 INFO L226 Difference]: Without dead ends: 45258 [2019-12-26 21:59:21,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:59:21,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45258 states. [2019-12-26 21:59:22,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45258 to 32469. [2019-12-26 21:59:22,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32469 states. [2019-12-26 21:59:22,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32469 states to 32469 states and 108463 transitions. [2019-12-26 21:59:22,205 INFO L78 Accepts]: Start accepts. Automaton has 32469 states and 108463 transitions. Word has length 22 [2019-12-26 21:59:22,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:22,205 INFO L462 AbstractCegarLoop]: Abstraction has 32469 states and 108463 transitions. [2019-12-26 21:59:22,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:59:22,206 INFO L276 IsEmpty]: Start isEmpty. Operand 32469 states and 108463 transitions. [2019-12-26 21:59:22,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 21:59:22,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:22,215 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] [2019-12-26 21:59:22,215 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:22,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:22,215 INFO L82 PathProgramCache]: Analyzing trace with hash 2068123345, now seen corresponding path program 1 times [2019-12-26 21:59:22,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:22,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597761186] [2019-12-26 21:59:22,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:22,344 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 21:59:22,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597761186] [2019-12-26 21:59:22,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:22,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:59:22,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841266698] [2019-12-26 21:59:22,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:59:22,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:22,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:59:22,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:59:22,348 INFO L87 Difference]: Start difference. First operand 32469 states and 108463 transitions. Second operand 5 states. [2019-12-26 21:59:22,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:22,933 INFO L93 Difference]: Finished difference Result 46044 states and 151821 transitions. [2019-12-26 21:59:22,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:59:22,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 21:59:22,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:23,017 INFO L225 Difference]: With dead ends: 46044 [2019-12-26 21:59:23,017 INFO L226 Difference]: Without dead ends: 46021 [2019-12-26 21:59:23,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:59:23,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46021 states. [2019-12-26 21:59:23,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46021 to 30490. [2019-12-26 21:59:23,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30490 states. [2019-12-26 21:59:24,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30490 states to 30490 states and 101754 transitions. [2019-12-26 21:59:24,002 INFO L78 Accepts]: Start accepts. Automaton has 30490 states and 101754 transitions. Word has length 22 [2019-12-26 21:59:24,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:24,003 INFO L462 AbstractCegarLoop]: Abstraction has 30490 states and 101754 transitions. [2019-12-26 21:59:24,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:59:24,003 INFO L276 IsEmpty]: Start isEmpty. Operand 30490 states and 101754 transitions. [2019-12-26 21:59:24,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 21:59:24,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:24,019 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 21:59:24,019 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:24,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:24,019 INFO L82 PathProgramCache]: Analyzing trace with hash 668919418, now seen corresponding path program 1 times [2019-12-26 21:59:24,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:24,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248608072] [2019-12-26 21:59:24,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:24,069 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 21:59:24,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248608072] [2019-12-26 21:59:24,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:24,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:59:24,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818619731] [2019-12-26 21:59:24,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:59:24,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:24,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:59:24,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:59:24,071 INFO L87 Difference]: Start difference. First operand 30490 states and 101754 transitions. Second operand 4 states. [2019-12-26 21:59:24,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:24,138 INFO L93 Difference]: Finished difference Result 11657 states and 35881 transitions. [2019-12-26 21:59:24,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:59:24,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 21:59:24,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:24,157 INFO L225 Difference]: With dead ends: 11657 [2019-12-26 21:59:24,157 INFO L226 Difference]: Without dead ends: 11657 [2019-12-26 21:59:24,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 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 21:59:24,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11657 states. [2019-12-26 21:59:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11657 to 11489. [2019-12-26 21:59:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11489 states. [2019-12-26 21:59:24,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11489 states to 11489 states and 35393 transitions. [2019-12-26 21:59:24,336 INFO L78 Accepts]: Start accepts. Automaton has 11489 states and 35393 transitions. Word has length 25 [2019-12-26 21:59:24,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:24,336 INFO L462 AbstractCegarLoop]: Abstraction has 11489 states and 35393 transitions. [2019-12-26 21:59:24,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:59:24,337 INFO L276 IsEmpty]: Start isEmpty. Operand 11489 states and 35393 transitions. [2019-12-26 21:59:24,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 21:59:24,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:24,352 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] [2019-12-26 21:59:24,352 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:24,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:24,352 INFO L82 PathProgramCache]: Analyzing trace with hash 954456655, now seen corresponding path program 1 times [2019-12-26 21:59:24,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:24,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056205544] [2019-12-26 21:59:24,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:24,391 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 21:59:24,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056205544] [2019-12-26 21:59:24,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:24,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:59:24,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782982066] [2019-12-26 21:59:24,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:59:24,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:24,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:59:24,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:59:24,393 INFO L87 Difference]: Start difference. First operand 11489 states and 35393 transitions. Second operand 3 states. [2019-12-26 21:59:24,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:24,476 INFO L93 Difference]: Finished difference Result 15100 states and 45684 transitions. [2019-12-26 21:59:24,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:59:24,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 21:59:24,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:24,497 INFO L225 Difference]: With dead ends: 15100 [2019-12-26 21:59:24,497 INFO L226 Difference]: Without dead ends: 15100 [2019-12-26 21:59:24,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 21:59:24,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15100 states. [2019-12-26 21:59:24,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15100 to 12271. [2019-12-26 21:59:24,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12271 states. [2019-12-26 21:59:24,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12271 states to 12271 states and 37679 transitions. [2019-12-26 21:59:24,698 INFO L78 Accepts]: Start accepts. Automaton has 12271 states and 37679 transitions. Word has length 39 [2019-12-26 21:59:24,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:24,699 INFO L462 AbstractCegarLoop]: Abstraction has 12271 states and 37679 transitions. [2019-12-26 21:59:24,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:59:24,699 INFO L276 IsEmpty]: Start isEmpty. Operand 12271 states and 37679 transitions. [2019-12-26 21:59:24,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 21:59:24,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:24,718 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] [2019-12-26 21:59:24,718 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:24,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:24,718 INFO L82 PathProgramCache]: Analyzing trace with hash 515851026, now seen corresponding path program 1 times [2019-12-26 21:59:24,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:24,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579386806] [2019-12-26 21:59:24,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:24,786 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 21:59:24,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579386806] [2019-12-26 21:59:24,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:24,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:59:24,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120911928] [2019-12-26 21:59:24,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:59:24,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:24,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:59:24,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:59:24,788 INFO L87 Difference]: Start difference. First operand 12271 states and 37679 transitions. Second operand 5 states. [2019-12-26 21:59:24,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:24,854 INFO L93 Difference]: Finished difference Result 11017 states and 34440 transitions. [2019-12-26 21:59:24,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:59:24,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-26 21:59:24,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:24,871 INFO L225 Difference]: With dead ends: 11017 [2019-12-26 21:59:24,872 INFO L226 Difference]: Without dead ends: 11017 [2019-12-26 21:59:24,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:59:24,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11017 states. [2019-12-26 21:59:25,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11017 to 10393. [2019-12-26 21:59:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10393 states. [2019-12-26 21:59:25,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10393 states to 10393 states and 32688 transitions. [2019-12-26 21:59:25,038 INFO L78 Accepts]: Start accepts. Automaton has 10393 states and 32688 transitions. Word has length 39 [2019-12-26 21:59:25,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:25,038 INFO L462 AbstractCegarLoop]: Abstraction has 10393 states and 32688 transitions. [2019-12-26 21:59:25,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:59:25,038 INFO L276 IsEmpty]: Start isEmpty. Operand 10393 states and 32688 transitions. [2019-12-26 21:59:25,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 21:59:25,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:25,054 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] [2019-12-26 21:59:25,055 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:25,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:25,055 INFO L82 PathProgramCache]: Analyzing trace with hash 165786421, now seen corresponding path program 1 times [2019-12-26 21:59:25,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:25,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413261057] [2019-12-26 21:59:25,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:25,132 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 21:59:25,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413261057] [2019-12-26 21:59:25,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:25,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:59:25,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664742196] [2019-12-26 21:59:25,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:59:25,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:25,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:59:25,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:59:25,249 INFO L87 Difference]: Start difference. First operand 10393 states and 32688 transitions. Second operand 4 states. [2019-12-26 21:59:25,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:25,348 INFO L93 Difference]: Finished difference Result 18723 states and 58888 transitions. [2019-12-26 21:59:25,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:59:25,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-26 21:59:25,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:25,368 INFO L225 Difference]: With dead ends: 18723 [2019-12-26 21:59:25,369 INFO L226 Difference]: Without dead ends: 8627 [2019-12-26 21:59:25,369 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 21:59:25,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8627 states. [2019-12-26 21:59:25,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8627 to 8627. [2019-12-26 21:59:25,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8627 states. [2019-12-26 21:59:25,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8627 states to 8627 states and 27021 transitions. [2019-12-26 21:59:25,596 INFO L78 Accepts]: Start accepts. Automaton has 8627 states and 27021 transitions. Word has length 53 [2019-12-26 21:59:25,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:25,596 INFO L462 AbstractCegarLoop]: Abstraction has 8627 states and 27021 transitions. [2019-12-26 21:59:25,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:59:25,597 INFO L276 IsEmpty]: Start isEmpty. Operand 8627 states and 27021 transitions. [2019-12-26 21:59:25,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 21:59:25,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:25,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] [2019-12-26 21:59:25,617 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:25,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:25,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1891813083, now seen corresponding path program 2 times [2019-12-26 21:59:25,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:25,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917749203] [2019-12-26 21:59:25,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:25,745 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 21:59:25,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917749203] [2019-12-26 21:59:25,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:25,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:59:25,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958193568] [2019-12-26 21:59:25,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:59:25,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:25,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:59:25,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:59:25,747 INFO L87 Difference]: Start difference. First operand 8627 states and 27021 transitions. Second operand 7 states. [2019-12-26 21:59:26,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:26,114 INFO L93 Difference]: Finished difference Result 24029 states and 75191 transitions. [2019-12-26 21:59:26,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:59:26,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-26 21:59:26,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:26,147 INFO L225 Difference]: With dead ends: 24029 [2019-12-26 21:59:26,147 INFO L226 Difference]: Without dead ends: 18333 [2019-12-26 21:59:26,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:59:26,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18333 states. [2019-12-26 21:59:26,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18333 to 10739. [2019-12-26 21:59:26,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10739 states. [2019-12-26 21:59:26,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10739 states to 10739 states and 33937 transitions. [2019-12-26 21:59:26,384 INFO L78 Accepts]: Start accepts. Automaton has 10739 states and 33937 transitions. Word has length 53 [2019-12-26 21:59:26,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:26,384 INFO L462 AbstractCegarLoop]: Abstraction has 10739 states and 33937 transitions. [2019-12-26 21:59:26,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:59:26,384 INFO L276 IsEmpty]: Start isEmpty. Operand 10739 states and 33937 transitions. [2019-12-26 21:59:26,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 21:59:26,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:26,401 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] [2019-12-26 21:59:26,401 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:26,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:26,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1878615555, now seen corresponding path program 3 times [2019-12-26 21:59:26,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:26,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466959444] [2019-12-26 21:59:26,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:26,480 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 21:59:26,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466959444] [2019-12-26 21:59:26,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:26,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:59:26,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212603276] [2019-12-26 21:59:26,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:59:26,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:26,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:59:26,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:59:26,483 INFO L87 Difference]: Start difference. First operand 10739 states and 33937 transitions. Second operand 7 states. [2019-12-26 21:59:26,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:26,903 INFO L93 Difference]: Finished difference Result 29619 states and 91701 transitions. [2019-12-26 21:59:26,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:59:26,904 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-26 21:59:26,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:26,943 INFO L225 Difference]: With dead ends: 29619 [2019-12-26 21:59:26,944 INFO L226 Difference]: Without dead ends: 21040 [2019-12-26 21:59:26,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:59:27,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21040 states. [2019-12-26 21:59:27,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21040 to 13259. [2019-12-26 21:59:27,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13259 states. [2019-12-26 21:59:27,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13259 states to 13259 states and 41902 transitions. [2019-12-26 21:59:27,230 INFO L78 Accepts]: Start accepts. Automaton has 13259 states and 41902 transitions. Word has length 53 [2019-12-26 21:59:27,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:27,230 INFO L462 AbstractCegarLoop]: Abstraction has 13259 states and 41902 transitions. [2019-12-26 21:59:27,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:59:27,231 INFO L276 IsEmpty]: Start isEmpty. Operand 13259 states and 41902 transitions. [2019-12-26 21:59:27,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 21:59:27,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:27,247 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] [2019-12-26 21:59:27,247 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:27,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:27,247 INFO L82 PathProgramCache]: Analyzing trace with hash 193726155, now seen corresponding path program 4 times [2019-12-26 21:59:27,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:27,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205763926] [2019-12-26 21:59:27,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:27,313 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 21:59:27,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205763926] [2019-12-26 21:59:27,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:27,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:59:27,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608800589] [2019-12-26 21:59:27,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:59:27,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:27,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:59:27,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:59:27,316 INFO L87 Difference]: Start difference. First operand 13259 states and 41902 transitions. Second operand 3 states. [2019-12-26 21:59:27,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:27,405 INFO L93 Difference]: Finished difference Result 19683 states and 62661 transitions. [2019-12-26 21:59:27,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:59:27,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-26 21:59:27,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:27,419 INFO L225 Difference]: With dead ends: 19683 [2019-12-26 21:59:27,419 INFO L226 Difference]: Without dead ends: 6496 [2019-12-26 21:59:27,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 21:59:27,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6496 states. [2019-12-26 21:59:27,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6496 to 6496. [2019-12-26 21:59:27,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6496 states. [2019-12-26 21:59:27,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6496 states to 6496 states and 20893 transitions. [2019-12-26 21:59:27,534 INFO L78 Accepts]: Start accepts. Automaton has 6496 states and 20893 transitions. Word has length 53 [2019-12-26 21:59:27,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:27,534 INFO L462 AbstractCegarLoop]: Abstraction has 6496 states and 20893 transitions. [2019-12-26 21:59:27,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:59:27,534 INFO L276 IsEmpty]: Start isEmpty. Operand 6496 states and 20893 transitions. [2019-12-26 21:59:27,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 21:59:27,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:27,542 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] [2019-12-26 21:59:27,542 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:27,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:27,543 INFO L82 PathProgramCache]: Analyzing trace with hash 819014287, now seen corresponding path program 5 times [2019-12-26 21:59:27,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:27,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962027971] [2019-12-26 21:59:27,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:27,812 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 21:59:27,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962027971] [2019-12-26 21:59:27,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:27,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:59:27,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314098885] [2019-12-26 21:59:27,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:59:27,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:27,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:59:27,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:59:27,815 INFO L87 Difference]: Start difference. First operand 6496 states and 20893 transitions. Second operand 9 states. [2019-12-26 21:59:29,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:29,249 INFO L93 Difference]: Finished difference Result 34361 states and 106385 transitions. [2019-12-26 21:59:29,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-26 21:59:29,250 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-26 21:59:29,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:29,290 INFO L225 Difference]: With dead ends: 34361 [2019-12-26 21:59:29,290 INFO L226 Difference]: Without dead ends: 27058 [2019-12-26 21:59:29,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2019-12-26 21:59:29,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27058 states. [2019-12-26 21:59:29,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27058 to 8895. [2019-12-26 21:59:29,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8895 states. [2019-12-26 21:59:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8895 states to 8895 states and 28920 transitions. [2019-12-26 21:59:29,582 INFO L78 Accepts]: Start accepts. Automaton has 8895 states and 28920 transitions. Word has length 53 [2019-12-26 21:59:29,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:29,582 INFO L462 AbstractCegarLoop]: Abstraction has 8895 states and 28920 transitions. [2019-12-26 21:59:29,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:59:29,582 INFO L276 IsEmpty]: Start isEmpty. Operand 8895 states and 28920 transitions. [2019-12-26 21:59:29,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 21:59:29,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:29,595 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] [2019-12-26 21:59:29,595 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:29,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:29,595 INFO L82 PathProgramCache]: Analyzing trace with hash 743806145, now seen corresponding path program 6 times [2019-12-26 21:59:29,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:29,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686526064] [2019-12-26 21:59:29,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:29,695 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 21:59:29,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686526064] [2019-12-26 21:59:29,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:29,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:59:29,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47076967] [2019-12-26 21:59:29,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:59:29,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:29,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:59:29,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:59:29,698 INFO L87 Difference]: Start difference. First operand 8895 states and 28920 transitions. Second operand 9 states. [2019-12-26 21:59:30,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:30,852 INFO L93 Difference]: Finished difference Result 25540 states and 79803 transitions. [2019-12-26 21:59:30,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-26 21:59:30,852 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-26 21:59:30,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:30,890 INFO L225 Difference]: With dead ends: 25540 [2019-12-26 21:59:30,890 INFO L226 Difference]: Without dead ends: 23475 [2019-12-26 21:59:30,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2019-12-26 21:59:30,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23475 states. [2019-12-26 21:59:31,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23475 to 8823. [2019-12-26 21:59:31,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8823 states. [2019-12-26 21:59:31,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8823 states to 8823 states and 28692 transitions. [2019-12-26 21:59:31,155 INFO L78 Accepts]: Start accepts. Automaton has 8823 states and 28692 transitions. Word has length 53 [2019-12-26 21:59:31,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:31,156 INFO L462 AbstractCegarLoop]: Abstraction has 8823 states and 28692 transitions. [2019-12-26 21:59:31,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:59:31,156 INFO L276 IsEmpty]: Start isEmpty. Operand 8823 states and 28692 transitions. [2019-12-26 21:59:31,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-26 21:59:31,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:31,167 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] [2019-12-26 21:59:31,168 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:31,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:31,168 INFO L82 PathProgramCache]: Analyzing trace with hash -249470771, now seen corresponding path program 7 times [2019-12-26 21:59:31,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:31,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82910213] [2019-12-26 21:59:31,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:31,219 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 21:59:31,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82910213] [2019-12-26 21:59:31,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:31,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:59:31,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89752606] [2019-12-26 21:59:31,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:59:31,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:31,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:59:31,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:59:31,221 INFO L87 Difference]: Start difference. First operand 8823 states and 28692 transitions. Second operand 3 states. [2019-12-26 21:59:31,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:31,267 INFO L93 Difference]: Finished difference Result 7806 states and 24655 transitions. [2019-12-26 21:59:31,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:59:31,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-26 21:59:31,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:31,282 INFO L225 Difference]: With dead ends: 7806 [2019-12-26 21:59:31,283 INFO L226 Difference]: Without dead ends: 7806 [2019-12-26 21:59:31,283 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 21:59:31,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7806 states. [2019-12-26 21:59:31,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7806 to 7630. [2019-12-26 21:59:31,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7630 states. [2019-12-26 21:59:31,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7630 states to 7630 states and 24077 transitions. [2019-12-26 21:59:31,542 INFO L78 Accepts]: Start accepts. Automaton has 7630 states and 24077 transitions. Word has length 53 [2019-12-26 21:59:31,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:31,544 INFO L462 AbstractCegarLoop]: Abstraction has 7630 states and 24077 transitions. [2019-12-26 21:59:31,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:59:31,544 INFO L276 IsEmpty]: Start isEmpty. Operand 7630 states and 24077 transitions. [2019-12-26 21:59:31,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 21:59:31,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:31,555 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] [2019-12-26 21:59:31,555 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:31,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:31,556 INFO L82 PathProgramCache]: Analyzing trace with hash 537172061, now seen corresponding path program 1 times [2019-12-26 21:59:31,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:31,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460136592] [2019-12-26 21:59:31,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:31,661 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 21:59:31,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460136592] [2019-12-26 21:59:31,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:31,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:59:31,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688598053] [2019-12-26 21:59:31,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:59:31,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:31,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:59:31,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:59:31,663 INFO L87 Difference]: Start difference. First operand 7630 states and 24077 transitions. Second operand 9 states. [2019-12-26 21:59:32,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:32,658 INFO L93 Difference]: Finished difference Result 13524 states and 42092 transitions. [2019-12-26 21:59:32,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 21:59:32,659 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-26 21:59:32,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:32,674 INFO L225 Difference]: With dead ends: 13524 [2019-12-26 21:59:32,674 INFO L226 Difference]: Without dead ends: 9340 [2019-12-26 21:59:32,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2019-12-26 21:59:32,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9340 states. [2019-12-26 21:59:32,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9340 to 7948. [2019-12-26 21:59:32,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7948 states. [2019-12-26 21:59:32,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7948 states to 7948 states and 24811 transitions. [2019-12-26 21:59:32,813 INFO L78 Accepts]: Start accepts. Automaton has 7948 states and 24811 transitions. Word has length 54 [2019-12-26 21:59:32,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:32,813 INFO L462 AbstractCegarLoop]: Abstraction has 7948 states and 24811 transitions. [2019-12-26 21:59:32,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:59:32,813 INFO L276 IsEmpty]: Start isEmpty. Operand 7948 states and 24811 transitions. [2019-12-26 21:59:32,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 21:59:32,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:32,821 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] [2019-12-26 21:59:32,822 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:32,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:32,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1663404977, now seen corresponding path program 2 times [2019-12-26 21:59:32,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:32,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348256407] [2019-12-26 21:59:32,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:32,939 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 21:59:32,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348256407] [2019-12-26 21:59:32,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:32,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:59:32,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319385444] [2019-12-26 21:59:32,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:59:32,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:32,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:59:32,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:59:32,941 INFO L87 Difference]: Start difference. First operand 7948 states and 24811 transitions. Second operand 9 states. [2019-12-26 21:59:34,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:34,299 INFO L93 Difference]: Finished difference Result 17269 states and 51692 transitions. [2019-12-26 21:59:34,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 21:59:34,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-12-26 21:59:34,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:34,324 INFO L225 Difference]: With dead ends: 17269 [2019-12-26 21:59:34,324 INFO L226 Difference]: Without dead ends: 17065 [2019-12-26 21:59:34,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-12-26 21:59:34,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17065 states. [2019-12-26 21:59:34,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17065 to 13336. [2019-12-26 21:59:34,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13336 states. [2019-12-26 21:59:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13336 states to 13336 states and 40648 transitions. [2019-12-26 21:59:34,590 INFO L78 Accepts]: Start accepts. Automaton has 13336 states and 40648 transitions. Word has length 54 [2019-12-26 21:59:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:34,591 INFO L462 AbstractCegarLoop]: Abstraction has 13336 states and 40648 transitions. [2019-12-26 21:59:34,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:59:34,591 INFO L276 IsEmpty]: Start isEmpty. Operand 13336 states and 40648 transitions. [2019-12-26 21:59:34,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 21:59:34,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:34,609 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] [2019-12-26 21:59:34,609 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:34,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:34,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1876186184, now seen corresponding path program 1 times [2019-12-26 21:59:34,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:34,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869703359] [2019-12-26 21:59:34,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:34,651 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 21:59:34,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869703359] [2019-12-26 21:59:34,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:34,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:59:34,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312810079] [2019-12-26 21:59:34,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:59:34,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:34,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:59:34,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:59:34,653 INFO L87 Difference]: Start difference. First operand 13336 states and 40648 transitions. Second operand 3 states. [2019-12-26 21:59:34,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:34,744 INFO L93 Difference]: Finished difference Result 15137 states and 45063 transitions. [2019-12-26 21:59:34,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:59:34,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-26 21:59:34,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:34,772 INFO L225 Difference]: With dead ends: 15137 [2019-12-26 21:59:34,772 INFO L226 Difference]: Without dead ends: 15137 [2019-12-26 21:59:34,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 21:59:34,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15137 states. [2019-12-26 21:59:34,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15137 to 10529. [2019-12-26 21:59:34,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10529 states. [2019-12-26 21:59:35,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10529 states to 10529 states and 31259 transitions. [2019-12-26 21:59:35,011 INFO L78 Accepts]: Start accepts. Automaton has 10529 states and 31259 transitions. Word has length 54 [2019-12-26 21:59:35,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:35,011 INFO L462 AbstractCegarLoop]: Abstraction has 10529 states and 31259 transitions. [2019-12-26 21:59:35,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:59:35,011 INFO L276 IsEmpty]: Start isEmpty. Operand 10529 states and 31259 transitions. [2019-12-26 21:59:35,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 21:59:35,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:35,023 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] [2019-12-26 21:59:35,023 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:35,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:35,023 INFO L82 PathProgramCache]: Analyzing trace with hash 225488507, now seen corresponding path program 3 times [2019-12-26 21:59:35,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:35,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311954778] [2019-12-26 21:59:35,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:35,095 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 21:59:35,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311954778] [2019-12-26 21:59:35,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:35,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:59:35,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156252113] [2019-12-26 21:59:35,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:59:35,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:35,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:59:35,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:59:35,097 INFO L87 Difference]: Start difference. First operand 10529 states and 31259 transitions. Second operand 5 states. [2019-12-26 21:59:35,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:35,557 INFO L93 Difference]: Finished difference Result 15324 states and 44385 transitions. [2019-12-26 21:59:35,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:59:35,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-12-26 21:59:35,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:35,578 INFO L225 Difference]: With dead ends: 15324 [2019-12-26 21:59:35,578 INFO L226 Difference]: Without dead ends: 15240 [2019-12-26 21:59:35,578 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 21:59:35,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15240 states. [2019-12-26 21:59:35,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15240 to 11226. [2019-12-26 21:59:35,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11226 states. [2019-12-26 21:59:35,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11226 states to 11226 states and 33137 transitions. [2019-12-26 21:59:35,907 INFO L78 Accepts]: Start accepts. Automaton has 11226 states and 33137 transitions. Word has length 54 [2019-12-26 21:59:35,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:35,907 INFO L462 AbstractCegarLoop]: Abstraction has 11226 states and 33137 transitions. [2019-12-26 21:59:35,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:59:35,907 INFO L276 IsEmpty]: Start isEmpty. Operand 11226 states and 33137 transitions. [2019-12-26 21:59:35,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-26 21:59:35,919 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:35,919 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] [2019-12-26 21:59:35,920 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:35,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:35,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1966745669, now seen corresponding path program 4 times [2019-12-26 21:59:35,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:35,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786288444] [2019-12-26 21:59:35,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:35,982 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 21:59:35,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786288444] [2019-12-26 21:59:35,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:35,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:59:35,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360606306] [2019-12-26 21:59:35,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:59:35,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:35,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:59:35,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:59:35,984 INFO L87 Difference]: Start difference. First operand 11226 states and 33137 transitions. Second operand 3 states. [2019-12-26 21:59:36,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:36,032 INFO L93 Difference]: Finished difference Result 11224 states and 33132 transitions. [2019-12-26 21:59:36,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:59:36,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-26 21:59:36,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:36,053 INFO L225 Difference]: With dead ends: 11224 [2019-12-26 21:59:36,053 INFO L226 Difference]: Without dead ends: 11224 [2019-12-26 21:59:36,053 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 21:59:36,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11224 states. [2019-12-26 21:59:36,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11224 to 8887. [2019-12-26 21:59:36,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8887 states. [2019-12-26 21:59:36,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 26665 transitions. [2019-12-26 21:59:36,246 INFO L78 Accepts]: Start accepts. Automaton has 8887 states and 26665 transitions. Word has length 54 [2019-12-26 21:59:36,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:36,246 INFO L462 AbstractCegarLoop]: Abstraction has 8887 states and 26665 transitions. [2019-12-26 21:59:36,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:59:36,246 INFO L276 IsEmpty]: Start isEmpty. Operand 8887 states and 26665 transitions. [2019-12-26 21:59:36,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 21:59:36,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:36,256 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] [2019-12-26 21:59:36,256 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:36,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:36,256 INFO L82 PathProgramCache]: Analyzing trace with hash 905870895, now seen corresponding path program 1 times [2019-12-26 21:59:36,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:36,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070051992] [2019-12-26 21:59:36,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:59:36,413 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 21:59:36,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070051992] [2019-12-26 21:59:36,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:59:36,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:59:36,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211773500] [2019-12-26 21:59:36,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:59:36,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:59:36,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:59:36,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:59:36,416 INFO L87 Difference]: Start difference. First operand 8887 states and 26665 transitions. Second operand 11 states. [2019-12-26 21:59:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:59:37,154 INFO L93 Difference]: Finished difference Result 11870 states and 34947 transitions. [2019-12-26 21:59:37,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-26 21:59:37,154 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-26 21:59:37,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:59:37,168 INFO L225 Difference]: With dead ends: 11870 [2019-12-26 21:59:37,168 INFO L226 Difference]: Without dead ends: 9229 [2019-12-26 21:59:37,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-12-26 21:59:37,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9229 states. [2019-12-26 21:59:37,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9229 to 8227. [2019-12-26 21:59:37,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8227 states. [2019-12-26 21:59:37,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8227 states to 8227 states and 24810 transitions. [2019-12-26 21:59:37,308 INFO L78 Accepts]: Start accepts. Automaton has 8227 states and 24810 transitions. Word has length 55 [2019-12-26 21:59:37,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:59:37,308 INFO L462 AbstractCegarLoop]: Abstraction has 8227 states and 24810 transitions. [2019-12-26 21:59:37,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:59:37,308 INFO L276 IsEmpty]: Start isEmpty. Operand 8227 states and 24810 transitions. [2019-12-26 21:59:37,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 21:59:37,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:59:37,316 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] [2019-12-26 21:59:37,317 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:59:37,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:59:37,317 INFO L82 PathProgramCache]: Analyzing trace with hash 406067685, now seen corresponding path program 2 times [2019-12-26 21:59:37,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:59:37,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608865967] [2019-12-26 21:59:37,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:59:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:59:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:59:37,424 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:59:37,424 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:59:37,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$r_buff0_thd1~0_335 0) (= 0 v_~y$r_buff1_thd3~0_125) (= v_~x~0_35 0) (= v_~y$w_buff1~0_269 0) (= 0 v_~y$r_buff1_thd2~0_133) (= v_~a~0_54 0) (= v_~y$w_buff1_used~0_559 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t642~0.base_28|)) (= v_~main$tmp_guard1~0_48 0) (= |v_#NULL.offset_3| 0) (= 0 v_~__unbuffered_p2_EAX~0_59) (= 0 v_~y$r_buff0_thd2~0_172) (= v_~y$read_delayed~0_6 0) (< 0 |v_#StackHeapBarrier_18|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t642~0.base_28|) (= |v_ULTIMATE.start_main_~#t642~0.offset_19| 0) (= v_~y$w_buff0_used~0_854 0) (= 0 v_~__unbuffered_p0_EAX~0_68) (= v_~__unbuffered_p0_EBX~0_53 0) (= v_~z~0_107 0) (= 0 v_~y$r_buff0_thd3~0_136) (= v_~weak$$choice2~0_153 0) (= v_~y$mem_tmp~0_47 0) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t642~0.base_28| 1)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t642~0.base_28| 4)) (= v_~__unbuffered_p2_EBX~0_59 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_cnt~0_162 0) (= 0 v_~y$flush_delayed~0_90) (= 0 |v_#NULL.base_3|) (= v_~y$r_buff0_thd0~0_138 0) (= 0 v_~y$w_buff0~0_440) (= v_~y$r_buff1_thd1~0_236 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_34) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t642~0.base_28| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t642~0.base_28|) |v_ULTIMATE.start_main_~#t642~0.offset_19| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd0~0_136 0) (= v_~y~0_214 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_~#t642~0.offset=|v_ULTIMATE.start_main_~#t642~0.offset_19|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t644~0.base=|v_ULTIMATE.start_main_~#t644~0.base_23|, ~a~0=v_~a~0_54, ~y$mem_tmp~0=v_~y$mem_tmp~0_47, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_125, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_335, ~y$flush_delayed~0=v_~y$flush_delayed~0_90, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_59, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_59, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$w_buff1~0=v_~y$w_buff1~0_269, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_172, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_162, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ~x~0=v_~x~0_35, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_854, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_95|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_67|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_37|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_236, ULTIMATE.start_main_~#t644~0.offset=|v_ULTIMATE.start_main_~#t644~0.offset_17|, ~y$w_buff0~0=v_~y$w_buff0~0_440, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_136, ULTIMATE.start_main_~#t642~0.base=|v_ULTIMATE.start_main_~#t642~0.base_28|, ~y~0=v_~y~0_214, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_17|, ULTIMATE.start_main_~#t643~0.offset=|v_ULTIMATE.start_main_~#t643~0.offset_17|, ULTIMATE.start_main_~#t643~0.base=|v_ULTIMATE.start_main_~#t643~0.base_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_133, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_138, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_107, ~weak$$choice2~0=v_~weak$$choice2~0_153, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_559} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_~#t642~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t644~0.base, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t644~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t642~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t643~0.offset, ULTIMATE.start_main_~#t643~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 21:59:37,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L831-1-->L833: Formula: (and (= |v_ULTIMATE.start_main_~#t643~0.offset_10| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t643~0.base_11|) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t643~0.base_11|) 0) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t643~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t643~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t643~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t643~0.base_11|) |v_ULTIMATE.start_main_~#t643~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t643~0.base_11| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t643~0.offset=|v_ULTIMATE.start_main_~#t643~0.offset_10|, ULTIMATE.start_main_~#t643~0.base=|v_ULTIMATE.start_main_~#t643~0.base_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t643~0.offset, ULTIMATE.start_main_~#t643~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-26 21:59:37,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L833-1-->L835: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t644~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t644~0.base_11|) |v_ULTIMATE.start_main_~#t644~0.offset_10| 2)) |v_#memory_int_11|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t644~0.base_11|) 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t644~0.base_11| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t644~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t644~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t644~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t644~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t644~0.base=|v_ULTIMATE.start_main_~#t644~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t644~0.offset=|v_ULTIMATE.start_main_~#t644~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t644~0.base, ULTIMATE.start_main_~#t644~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-26 21:59:37,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] P1ENTRY-->L5-3: Formula: (and (= |P1Thread1of1ForFork1_#in~arg.base_In-1937246343| P1Thread1of1ForFork1_~arg.base_Out-1937246343) (= 0 (mod ~y$w_buff1_used~0_Out-1937246343 256)) (= ~y$w_buff0~0_Out-1937246343 1) (= |P1Thread1of1ForFork1_#in~arg.offset_In-1937246343| P1Thread1of1ForFork1_~arg.offset_Out-1937246343) (= ~y$w_buff0~0_In-1937246343 ~y$w_buff1~0_Out-1937246343) (= ~y$w_buff1_used~0_Out-1937246343 ~y$w_buff0_used~0_In-1937246343) (= |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1937246343| 1) (= ~y$w_buff0_used~0_Out-1937246343 1) (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-1937246343 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1937246343|)) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1937246343, ~y$w_buff0~0=~y$w_buff0~0_In-1937246343, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-1937246343|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-1937246343|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out-1937246343, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out-1937246343, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1937246343, ~y$w_buff1~0=~y$w_buff1~0_Out-1937246343, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out-1937246343|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out-1937246343, ~y$w_buff0~0=~y$w_buff0~0_Out-1937246343, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In-1937246343|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In-1937246343|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1937246343} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 21:59:37,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L808-2-->L808-5: Formula: (let ((.cse1 (= |P2Thread1of1ForFork2_#t~ite33_Out1789793921| |P2Thread1of1ForFork2_#t~ite32_Out1789793921|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1789793921 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1789793921 256)))) (or (and (= ~y$w_buff1~0_In1789793921 |P2Thread1of1ForFork2_#t~ite32_Out1789793921|) (not .cse0) .cse1 (not .cse2)) (and .cse1 (or .cse2 .cse0) (= ~y~0_In1789793921 |P2Thread1of1ForFork2_#t~ite32_Out1789793921|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1789793921, ~y$w_buff1~0=~y$w_buff1~0_In1789793921, ~y~0=~y~0_In1789793921, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1789793921} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1789793921, ~y$w_buff1~0=~y$w_buff1~0_In1789793921, P2Thread1of1ForFork2_#t~ite33=|P2Thread1of1ForFork2_#t~ite33_Out1789793921|, P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out1789793921|, ~y~0=~y~0_In1789793921, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1789793921} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-26 21:59:37,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1202576137 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1202576137 256)))) (or (and (= ~y$w_buff0_used~0_In1202576137 |P1Thread1of1ForFork1_#t~ite28_Out1202576137|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite28_Out1202576137|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1202576137, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1202576137} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1202576137, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1202576137, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1202576137|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-26 21:59:37,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-902782139 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-902782139 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite34_Out-902782139| ~y$w_buff0_used~0_In-902782139) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite34_Out-902782139| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-902782139, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-902782139} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out-902782139|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-902782139, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-902782139} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-26 21:59:37,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1929781494 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1929781494 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1929781494 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1929781494 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1929781494 |P2Thread1of1ForFork2_#t~ite35_Out1929781494|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite35_Out1929781494|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1929781494, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1929781494, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1929781494, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1929781494} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out1929781494|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1929781494, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1929781494, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1929781494, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1929781494} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-26 21:59:37,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-178450712 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-178450712 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite36_Out-178450712| 0) (not .cse1)) (and (= ~y$r_buff0_thd3~0_In-178450712 |P2Thread1of1ForFork2_#t~ite36_Out-178450712|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-178450712, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-178450712} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out-178450712|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-178450712, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-178450712} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-26 21:59:37,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L812-->L812-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-53606279 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-53606279 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-53606279 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-53606279 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite37_Out-53606279| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite37_Out-53606279| ~y$r_buff1_thd3~0_In-53606279) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-53606279, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-53606279, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-53606279, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-53606279} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out-53606279|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-53606279, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-53606279, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-53606279, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-53606279} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-26 21:59:37,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L812-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite37_40| v_~y$r_buff1_thd3~0_74) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_39|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_74, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 21:59:37,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L787-->L787-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In956162747 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In956162747 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In956162747 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In956162747 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite29_Out956162747|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite29_Out956162747| ~y$w_buff1_used~0_In956162747) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In956162747, ~y$w_buff0_used~0=~y$w_buff0_used~0_In956162747, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In956162747, ~y$w_buff1_used~0=~y$w_buff1_used~0_In956162747} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In956162747, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out956162747|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In956162747, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In956162747, ~y$w_buff1_used~0=~y$w_buff1_used~0_In956162747} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-26 21:59:37,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L788-->L789: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-384885065 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-384885065 256) 0))) (or (and (= ~y$r_buff0_thd2~0_Out-384885065 0) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_Out-384885065 ~y$r_buff0_thd2~0_In-384885065) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-384885065, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-384885065} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-384885065|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-384885065, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-384885065} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 21:59:37,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-98324746 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-98324746 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-98324746 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-98324746 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite31_Out-98324746|)) (and (= ~y$r_buff1_thd2~0_In-98324746 |P1Thread1of1ForFork1_#t~ite31_Out-98324746|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-98324746, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-98324746, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-98324746, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-98324746} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-98324746, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-98324746, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-98324746|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-98324746, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-98324746} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-26 21:59:37,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P1Thread1of1ForFork1_#t~ite31_40| v_~y$r_buff1_thd2~0_54) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 21:59:37,444 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L750-->L750-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1846991723 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite9_Out1846991723| ~y$w_buff0~0_In1846991723) (= |P0Thread1of1ForFork0_#t~ite8_In1846991723| |P0Thread1of1ForFork0_#t~ite8_Out1846991723|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In1846991723 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd1~0_In1846991723 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1846991723 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1846991723 256))))) .cse0 (= |P0Thread1of1ForFork0_#t~ite8_Out1846991723| ~y$w_buff0~0_In1846991723) (= |P0Thread1of1ForFork0_#t~ite8_Out1846991723| |P0Thread1of1ForFork0_#t~ite9_Out1846991723|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1846991723, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1846991723, ~y$w_buff0~0=~y$w_buff0~0_In1846991723, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1846991723, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_In1846991723|, ~weak$$choice2~0=~weak$$choice2~0_In1846991723, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1846991723} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1846991723, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out1846991723|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1846991723, ~y$w_buff0~0=~y$w_buff0~0_In1846991723, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1846991723|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1846991723, ~weak$$choice2~0=~weak$$choice2~0_In1846991723, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1846991723} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite9, P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 21:59:37,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L751-->L751-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1401561269 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In-1401561269 |P0Thread1of1ForFork0_#t~ite12_Out-1401561269|) (= |P0Thread1of1ForFork0_#t~ite11_In-1401561269| |P0Thread1of1ForFork0_#t~ite11_Out-1401561269|)) (and (= |P0Thread1of1ForFork0_#t~ite11_Out-1401561269| ~y$w_buff1~0_In-1401561269) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1401561269 256)))) (or (= (mod ~y$w_buff0_used~0_In-1401561269 256) 0) (and (= 0 (mod ~y$r_buff1_thd1~0_In-1401561269 256)) .cse1) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1401561269 256))))) .cse0 (= |P0Thread1of1ForFork0_#t~ite11_Out-1401561269| |P0Thread1of1ForFork0_#t~ite12_Out-1401561269|)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In-1401561269|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1401561269, ~y$w_buff1~0=~y$w_buff1~0_In-1401561269, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1401561269, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1401561269, ~weak$$choice2~0=~weak$$choice2~0_In-1401561269, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1401561269} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out-1401561269|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1401561269, ~y$w_buff1~0=~y$w_buff1~0_In-1401561269, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1401561269, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1401561269, ~weak$$choice2~0=~weak$$choice2~0_In-1401561269, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out-1401561269|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1401561269} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-26 21:59:37,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] L754-->L755-8: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite22_35| |v_P0Thread1of1ForFork0_#t~ite22_34|) (= |v_P0Thread1of1ForFork0_#t~ite23_31| |v_P0Thread1of1ForFork0_#t~ite23_30|) (= v_~y$r_buff1_thd1~0_224 |v_P0Thread1of1ForFork0_#t~ite24_32|) (= v_~y$r_buff0_thd1~0_326 v_~y$r_buff0_thd1~0_325) (not (= 0 (mod v_~weak$$choice2~0_143 256)))) InVars {P0Thread1of1ForFork0_#t~ite22=|v_P0Thread1of1ForFork0_#t~ite22_35|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_224, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_326, ~weak$$choice2~0=v_~weak$$choice2~0_143, P0Thread1of1ForFork0_#t~ite23=|v_P0Thread1of1ForFork0_#t~ite23_31|} OutVars{P0Thread1of1ForFork0_#t~ite22=|v_P0Thread1of1ForFork0_#t~ite22_34|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_224, P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_37|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_48|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_325, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_33|, ~weak$$choice2~0=v_~weak$$choice2~0_143, P0Thread1of1ForFork0_#t~ite24=|v_P0Thread1of1ForFork0_#t~ite24_32|, P0Thread1of1ForFork0_#t~ite23=|v_P0Thread1of1ForFork0_#t~ite23_30|} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite22, P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19, P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-26 21:59:37,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L757-->L765: Formula: (and (not (= (mod v_~y$flush_delayed~0_17 256) 0)) (= v_~y~0_46 v_~y$mem_tmp~0_7) (= 0 v_~y$flush_delayed~0_16) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_21|, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~y~0=v_~y~0_46} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-26 21:59:37,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L835-1-->L841: Formula: (and (= 3 v_~__unbuffered_cnt~0_42) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 21:59:37,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L841-2-->L841-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In2061743738 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In2061743738 256)))) (or (and (= ~y~0_In2061743738 |ULTIMATE.start_main_#t~ite41_Out2061743738|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite41_Out2061743738| ~y$w_buff1~0_In2061743738) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2061743738, ~y~0=~y~0_In2061743738, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2061743738, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2061743738} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out2061743738|, ~y$w_buff1~0=~y$w_buff1~0_In2061743738, ~y~0=~y~0_In2061743738, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2061743738, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2061743738} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-26 21:59:37,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L841-4-->L842: Formula: (= v_~y~0_14 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 21:59:37,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L842-->L842-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In616693875 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In616693875 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out616693875| ~y$w_buff0_used~0_In616693875)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out616693875| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In616693875, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In616693875} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In616693875, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In616693875, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out616693875|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 21:59:37,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L843-->L843-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-477235937 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-477235937 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-477235937 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-477235937 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-477235937| ~y$w_buff1_used~0_In-477235937) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite44_Out-477235937| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-477235937, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-477235937, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-477235937, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-477235937} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-477235937, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-477235937, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-477235937, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-477235937|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-477235937} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 21:59:37,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In450117749 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In450117749 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In450117749 |ULTIMATE.start_main_#t~ite45_Out450117749|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out450117749| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In450117749, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In450117749} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In450117749, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In450117749, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out450117749|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 21:59:37,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L845-->L845-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In2033592184 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In2033592184 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In2033592184 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In2033592184 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite46_Out2033592184| ~y$r_buff1_thd0~0_In2033592184)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite46_Out2033592184| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2033592184, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2033592184, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2033592184, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2033592184} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2033592184, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2033592184, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out2033592184|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2033592184, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2033592184} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-26 21:59:37,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L845-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~main$tmp_guard1~0_17 0) (= v_~z~0_50 2) (= 1 v_~__unbuffered_p0_EAX~0_34) (= v_~__unbuffered_p0_EBX~0_19 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= 2 v_~__unbuffered_p2_EAX~0_22) (= |v_ULTIMATE.start_main_#t~ite46_39| v_~y$r_buff1_thd0~0_74) (= v_~__unbuffered_p2_EBX~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_39|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~z~0=v_~z~0_50} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_38|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~z~0=v_~z~0_50, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_74, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:59:37,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:59:37 BasicIcfg [2019-12-26 21:59:37,588 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:59:37,590 INFO L168 Benchmark]: Toolchain (without parser) took 55307.00 ms. Allocated memory was 145.8 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 102.3 MB in the beginning and 862.9 MB in the end (delta: -760.6 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-26 21:59:37,591 INFO L168 Benchmark]: CDTParser took 1.51 ms. Allocated memory is still 145.8 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 21:59:37,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.03 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.9 MB in the beginning and 156.3 MB in the end (delta: -54.4 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-26 21:59:37,592 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.25 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:59:37,593 INFO L168 Benchmark]: Boogie Preprocessor took 38.38 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 151.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 21:59:37,593 INFO L168 Benchmark]: RCFGBuilder took 822.96 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 104.5 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-12-26 21:59:37,594 INFO L168 Benchmark]: TraceAbstraction took 53560.36 ms. Allocated memory was 202.9 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 103.8 MB in the beginning and 862.9 MB in the end (delta: -759.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-26 21:59:37,597 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.51 ms. Allocated memory is still 145.8 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 809.03 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.9 MB in the beginning and 156.3 MB in the end (delta: -54.4 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.25 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.38 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 151.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 822.96 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 104.5 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 53560.36 ms. Allocated memory was 202.9 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 103.8 MB in the beginning and 862.9 MB in the end (delta: -759.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.4s, 166 ProgramPointsBefore, 83 ProgramPointsAfterwards, 197 TransitionsBefore, 90 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 28 ChoiceCompositions, 6616 VarBasedMoverChecksPositive, 243 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 263 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 74173 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t642, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L833] FCALL, FORK 0 pthread_create(&t643, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t644, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L776] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L777] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L778] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L779] 2 y$r_buff0_thd2 = (_Bool)1 [L782] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 z = 2 [L802] 3 __unbuffered_p2_EAX = z [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L808] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L810] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L811] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L736] 1 a = 1 [L739] 1 x = 1 [L742] 1 __unbuffered_p0_EAX = x [L745] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 1 y$flush_delayed = weak$$choice2 [L748] 1 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L750] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L751] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 __unbuffered_p0_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L841] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L842] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L843] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L844] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 53.2s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4163 SDtfs, 5798 SDslu, 11537 SDs, 0 SdLazy, 5446 SolverSat, 295 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 253 GetRequests, 46 SyntacticMatches, 10 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82802occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 112950 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 957 NumberOfCodeBlocks, 957 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 879 ConstructedInterpolants, 0 QuantifiedInterpolants, 123135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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 proved your program to be incorrect! Received shutdown request...