/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:58:12,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:58:12,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:58:12,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:58:12,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:58:12,026 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:58:12,027 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:58:12,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:58:12,030 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:58:12,031 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:58:12,032 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:58:12,034 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:58:12,034 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:58:12,035 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:58:12,036 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:58:12,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:58:12,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:58:12,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:58:12,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:58:12,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:58:12,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:58:12,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:58:12,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:58:12,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:58:12,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:58:12,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:58:12,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:58:12,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:58:12,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:58:12,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:58:12,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:58:12,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:58:12,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:58:12,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:58:12,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:58:12,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:58:12,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:58:12,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:58:12,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:58:12,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:58:12,058 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:58:12,059 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 20:58:12,073 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:58:12,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:58:12,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:58:12,075 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:58:12,075 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:58:12,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:58:12,076 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:58:12,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:58:12,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:58:12,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:58:12,077 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:58:12,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:58:12,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:58:12,077 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:58:12,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:58:12,077 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:58:12,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:58:12,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:58:12,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:58:12,078 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:58:12,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:58:12,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:58:12,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:58:12,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:58:12,079 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:58:12,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:58:12,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:58:12,080 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:58:12,080 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:58:12,080 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:58:12,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:58:12,374 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:58:12,381 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:58:12,383 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:58:12,384 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:58:12,384 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i [2019-12-18 20:58:12,464 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0a3ca38b/899b36ce65a3437ea8d628a02115efd2/FLAG0a09bb0c0 [2019-12-18 20:58:13,047 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:58:13,048 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.opt.i [2019-12-18 20:58:13,063 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0a3ca38b/899b36ce65a3437ea8d628a02115efd2/FLAG0a09bb0c0 [2019-12-18 20:58:13,313 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0a3ca38b/899b36ce65a3437ea8d628a02115efd2 [2019-12-18 20:58:13,324 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:58:13,326 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:58:13,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:58:13,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:58:13,330 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:58:13,331 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:58:13" (1/1) ... [2019-12-18 20:58:13,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30912776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:58:13, skipping insertion in model container [2019-12-18 20:58:13,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:58:13" (1/1) ... [2019-12-18 20:58:13,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:58:13,386 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:58:13,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:58:13,963 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:58:14,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:58:14,104 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:58:14,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:58:14 WrapperNode [2019-12-18 20:58:14,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:58:14,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:58:14,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:58:14,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:58:14,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:58:14" (1/1) ... [2019-12-18 20:58:14,140 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:58:14" (1/1) ... [2019-12-18 20:58:14,187 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:58:14,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:58:14,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:58:14,188 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:58:14,199 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:58:14" (1/1) ... [2019-12-18 20:58:14,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:58:14" (1/1) ... [2019-12-18 20:58:14,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:58:14" (1/1) ... [2019-12-18 20:58:14,205 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:58:14" (1/1) ... [2019-12-18 20:58:14,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:58:14" (1/1) ... [2019-12-18 20:58:14,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:58:14" (1/1) ... [2019-12-18 20:58:14,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:58:14" (1/1) ... [2019-12-18 20:58:14,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:58:14,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:58:14,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:58:14,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:58:14,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:58:14" (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-18 20:58:14,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:58:14,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:58:14,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:58:14,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:58:14,330 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:58:14,331 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:58:14,331 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:58:14,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:58:14,332 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 20:58:14,333 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 20:58:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:58:14,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:58:14,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:58:14,336 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 20:58:15,211 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:58:15,211 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:58:15,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:58:15 BoogieIcfgContainer [2019-12-18 20:58:15,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:58:15,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:58:15,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:58:15,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:58:15,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:58:13" (1/3) ... [2019-12-18 20:58:15,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209d47be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:58:15, skipping insertion in model container [2019-12-18 20:58:15,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:58:14" (2/3) ... [2019-12-18 20:58:15,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209d47be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:58:15, skipping insertion in model container [2019-12-18 20:58:15,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:58:15" (3/3) ... [2019-12-18 20:58:15,221 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_power.opt.i [2019-12-18 20:58:15,232 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:58:15,232 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:58:15,240 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:58:15,241 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:58:15,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,282 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,282 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,291 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,291 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,291 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,291 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,292 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,299 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,300 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,329 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,329 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,332 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,332 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,332 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,337 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,338 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:58:15,359 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 20:58:15,377 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:58:15,377 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:58:15,377 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:58:15,378 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:58:15,378 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:58:15,378 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:58:15,378 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:58:15,378 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:58:15,397 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 20:58:15,399 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 20:58:15,495 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 20:58:15,495 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:58:15,517 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 20:58:15,545 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 20:58:15,593 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 20:58:15,593 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:58:15,602 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 20:58:15,625 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-18 20:58:15,626 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:58:18,733 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-12-18 20:58:19,070 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 20:58:19,217 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 20:58:19,242 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82846 [2019-12-18 20:58:19,242 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-18 20:58:19,246 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 97 places, 110 transitions [2019-12-18 20:58:40,765 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 125660 states. [2019-12-18 20:58:40,767 INFO L276 IsEmpty]: Start isEmpty. Operand 125660 states. [2019-12-18 20:58:40,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 20:58:40,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:58:40,775 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 20:58:40,775 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-18 20:58:40,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:58:40,782 INFO L82 PathProgramCache]: Analyzing trace with hash 807924105, now seen corresponding path program 1 times [2019-12-18 20:58:40,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:58:40,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628389567] [2019-12-18 20:58:40,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:58:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:58:41,018 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-18 20:58:41,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628389567] [2019-12-18 20:58:41,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:58:41,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:58:41,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260777137] [2019-12-18 20:58:41,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:58:41,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:58:41,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:58:41,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:58:41,047 INFO L87 Difference]: Start difference. First operand 125660 states. Second operand 3 states. [2019-12-18 20:58:45,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:58:45,368 INFO L93 Difference]: Finished difference Result 125096 states and 540334 transitions. [2019-12-18 20:58:45,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:58:45,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 20:58:45,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:58:46,335 INFO L225 Difference]: With dead ends: 125096 [2019-12-18 20:58:46,335 INFO L226 Difference]: Without dead ends: 122548 [2019-12-18 20:58:46,337 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-18 20:58:50,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122548 states. [2019-12-18 20:58:53,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122548 to 122548. [2019-12-18 20:58:53,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122548 states. [2019-12-18 20:58:53,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122548 states to 122548 states and 529960 transitions. [2019-12-18 20:58:53,746 INFO L78 Accepts]: Start accepts. Automaton has 122548 states and 529960 transitions. Word has length 5 [2019-12-18 20:58:53,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:58:53,746 INFO L462 AbstractCegarLoop]: Abstraction has 122548 states and 529960 transitions. [2019-12-18 20:58:53,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:58:53,746 INFO L276 IsEmpty]: Start isEmpty. Operand 122548 states and 529960 transitions. [2019-12-18 20:58:53,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 20:58:53,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:58:53,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:58:53,750 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-18 20:58:53,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:58:53,751 INFO L82 PathProgramCache]: Analyzing trace with hash 311209173, now seen corresponding path program 1 times [2019-12-18 20:58:53,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:58:53,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861768453] [2019-12-18 20:58:53,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:58:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:58:53,862 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-18 20:58:53,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861768453] [2019-12-18 20:58:53,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:58:53,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:58:53,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287221406] [2019-12-18 20:58:53,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:58:53,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:58:53,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:58:53,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:58:53,866 INFO L87 Difference]: Start difference. First operand 122548 states and 529960 transitions. Second operand 4 states. [2019-12-18 20:58:59,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:58:59,321 INFO L93 Difference]: Finished difference Result 196578 states and 812188 transitions. [2019-12-18 20:58:59,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:58:59,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 20:58:59,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:58:59,953 INFO L225 Difference]: With dead ends: 196578 [2019-12-18 20:58:59,953 INFO L226 Difference]: Without dead ends: 196529 [2019-12-18 20:58:59,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:59:09,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196529 states. [2019-12-18 20:59:13,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196529 to 180333. [2019-12-18 20:59:13,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180333 states. [2019-12-18 20:59:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180333 states to 180333 states and 754389 transitions. [2019-12-18 20:59:15,331 INFO L78 Accepts]: Start accepts. Automaton has 180333 states and 754389 transitions. Word has length 11 [2019-12-18 20:59:15,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:15,331 INFO L462 AbstractCegarLoop]: Abstraction has 180333 states and 754389 transitions. [2019-12-18 20:59:15,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:59:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 180333 states and 754389 transitions. [2019-12-18 20:59:15,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:59:15,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:15,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:59:15,340 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-18 20:59:15,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:15,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1817604182, now seen corresponding path program 1 times [2019-12-18 20:59:15,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:15,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458310634] [2019-12-18 20:59:15,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:15,427 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-18 20:59:15,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458310634] [2019-12-18 20:59:15,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:15,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:59:15,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936728490] [2019-12-18 20:59:15,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:59:15,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:15,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:59:15,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:59:15,430 INFO L87 Difference]: Start difference. First operand 180333 states and 754389 transitions. Second operand 4 states. [2019-12-18 20:59:24,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:24,721 INFO L93 Difference]: Finished difference Result 255988 states and 1044211 transitions. [2019-12-18 20:59:24,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:59:24,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 20:59:24,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:25,437 INFO L225 Difference]: With dead ends: 255988 [2019-12-18 20:59:25,437 INFO L226 Difference]: Without dead ends: 255925 [2019-12-18 20:59:25,437 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-18 20:59:31,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255925 states. [2019-12-18 20:59:35,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255925 to 217043. [2019-12-18 20:59:35,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217043 states. [2019-12-18 20:59:37,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217043 states to 217043 states and 900881 transitions. [2019-12-18 20:59:37,161 INFO L78 Accepts]: Start accepts. Automaton has 217043 states and 900881 transitions. Word has length 13 [2019-12-18 20:59:37,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:37,162 INFO L462 AbstractCegarLoop]: Abstraction has 217043 states and 900881 transitions. [2019-12-18 20:59:37,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:59:37,163 INFO L276 IsEmpty]: Start isEmpty. Operand 217043 states and 900881 transitions. [2019-12-18 20:59:37,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 20:59:37,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:37,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:59:37,166 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-18 20:59:37,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:37,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1719204338, now seen corresponding path program 1 times [2019-12-18 20:59:37,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:37,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235837830] [2019-12-18 20:59:37,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:37,229 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-18 20:59:37,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235837830] [2019-12-18 20:59:37,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:37,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:59:37,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376532377] [2019-12-18 20:59:37,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:59:37,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:37,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:59:37,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:59:37,233 INFO L87 Difference]: Start difference. First operand 217043 states and 900881 transitions. Second operand 3 states. [2019-12-18 20:59:37,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:37,383 INFO L93 Difference]: Finished difference Result 41850 states and 136635 transitions. [2019-12-18 20:59:37,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:59:37,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 20:59:37,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:37,450 INFO L225 Difference]: With dead ends: 41850 [2019-12-18 20:59:37,450 INFO L226 Difference]: Without dead ends: 41850 [2019-12-18 20:59:37,450 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-18 20:59:37,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41850 states. [2019-12-18 20:59:38,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41850 to 41850. [2019-12-18 20:59:38,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41850 states. [2019-12-18 20:59:44,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41850 states to 41850 states and 136635 transitions. [2019-12-18 20:59:44,748 INFO L78 Accepts]: Start accepts. Automaton has 41850 states and 136635 transitions. Word has length 13 [2019-12-18 20:59:44,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:44,748 INFO L462 AbstractCegarLoop]: Abstraction has 41850 states and 136635 transitions. [2019-12-18 20:59:44,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:59:44,749 INFO L276 IsEmpty]: Start isEmpty. Operand 41850 states and 136635 transitions. [2019-12-18 20:59:44,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 20:59:44,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:44,752 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:59:44,753 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-18 20:59:44,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:44,753 INFO L82 PathProgramCache]: Analyzing trace with hash 565965362, now seen corresponding path program 1 times [2019-12-18 20:59:44,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:44,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931514756] [2019-12-18 20:59:44,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:44,889 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-18 20:59:44,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931514756] [2019-12-18 20:59:44,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:44,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:59:44,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531743394] [2019-12-18 20:59:44,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:59:44,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:44,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:59:44,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:59:44,892 INFO L87 Difference]: Start difference. First operand 41850 states and 136635 transitions. Second operand 5 states. [2019-12-18 20:59:45,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:45,748 INFO L93 Difference]: Finished difference Result 56420 states and 180098 transitions. [2019-12-18 20:59:45,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:59:45,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 20:59:45,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:45,842 INFO L225 Difference]: With dead ends: 56420 [2019-12-18 20:59:45,842 INFO L226 Difference]: Without dead ends: 56407 [2019-12-18 20:59:45,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:59:46,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56407 states. [2019-12-18 20:59:46,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56407 to 42107. [2019-12-18 20:59:46,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42107 states. [2019-12-18 20:59:46,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42107 states to 42107 states and 137336 transitions. [2019-12-18 20:59:46,665 INFO L78 Accepts]: Start accepts. Automaton has 42107 states and 137336 transitions. Word has length 19 [2019-12-18 20:59:46,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:46,665 INFO L462 AbstractCegarLoop]: Abstraction has 42107 states and 137336 transitions. [2019-12-18 20:59:46,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:59:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand 42107 states and 137336 transitions. [2019-12-18 20:59:46,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:59:46,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:46,679 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-18 20:59:46,679 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-18 20:59:46,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:46,679 INFO L82 PathProgramCache]: Analyzing trace with hash 967390355, now seen corresponding path program 1 times [2019-12-18 20:59:46,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:46,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267289314] [2019-12-18 20:59:46,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:46,783 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-18 20:59:46,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267289314] [2019-12-18 20:59:46,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:46,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:59:46,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995580907] [2019-12-18 20:59:46,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:59:46,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:46,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:59:46,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:59:46,786 INFO L87 Difference]: Start difference. First operand 42107 states and 137336 transitions. Second operand 4 states. [2019-12-18 20:59:46,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:46,830 INFO L93 Difference]: Finished difference Result 7672 states and 21026 transitions. [2019-12-18 20:59:46,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:59:46,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 20:59:46,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:46,844 INFO L225 Difference]: With dead ends: 7672 [2019-12-18 20:59:46,844 INFO L226 Difference]: Without dead ends: 7672 [2019-12-18 20:59:46,845 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-18 20:59:46,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7672 states. [2019-12-18 20:59:47,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7672 to 7532. [2019-12-18 20:59:47,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7532 states. [2019-12-18 20:59:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7532 states to 7532 states and 20626 transitions. [2019-12-18 20:59:47,178 INFO L78 Accepts]: Start accepts. Automaton has 7532 states and 20626 transitions. Word has length 25 [2019-12-18 20:59:47,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:47,179 INFO L462 AbstractCegarLoop]: Abstraction has 7532 states and 20626 transitions. [2019-12-18 20:59:47,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:59:47,179 INFO L276 IsEmpty]: Start isEmpty. Operand 7532 states and 20626 transitions. [2019-12-18 20:59:47,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 20:59:47,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:47,191 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] [2019-12-18 20:59:47,191 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-18 20:59:47,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:47,191 INFO L82 PathProgramCache]: Analyzing trace with hash 628706666, now seen corresponding path program 1 times [2019-12-18 20:59:47,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:47,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496971047] [2019-12-18 20:59:47,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:47,279 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-18 20:59:47,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496971047] [2019-12-18 20:59:47,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:47,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:59:47,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973961665] [2019-12-18 20:59:47,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:59:47,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:47,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:59:47,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:59:47,282 INFO L87 Difference]: Start difference. First operand 7532 states and 20626 transitions. Second operand 5 states. [2019-12-18 20:59:47,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:47,326 INFO L93 Difference]: Finished difference Result 5403 states and 15530 transitions. [2019-12-18 20:59:47,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:59:47,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 20:59:47,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:47,337 INFO L225 Difference]: With dead ends: 5403 [2019-12-18 20:59:47,338 INFO L226 Difference]: Without dead ends: 5403 [2019-12-18 20:59:47,338 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-18 20:59:47,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5403 states. [2019-12-18 20:59:47,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5403 to 4990. [2019-12-18 20:59:47,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4990 states. [2019-12-18 20:59:47,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4990 states to 4990 states and 14413 transitions. [2019-12-18 20:59:47,481 INFO L78 Accepts]: Start accepts. Automaton has 4990 states and 14413 transitions. Word has length 37 [2019-12-18 20:59:47,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:47,482 INFO L462 AbstractCegarLoop]: Abstraction has 4990 states and 14413 transitions. [2019-12-18 20:59:47,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:59:47,482 INFO L276 IsEmpty]: Start isEmpty. Operand 4990 states and 14413 transitions. [2019-12-18 20:59:47,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:59:47,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:47,500 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:59:47,500 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-18 20:59:47,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:47,501 INFO L82 PathProgramCache]: Analyzing trace with hash 2046604178, now seen corresponding path program 1 times [2019-12-18 20:59:47,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:47,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755160616] [2019-12-18 20:59:47,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:47,639 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-18 20:59:47,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755160616] [2019-12-18 20:59:47,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:47,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:59:47,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873691273] [2019-12-18 20:59:47,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:59:47,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:47,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:59:47,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:59:47,642 INFO L87 Difference]: Start difference. First operand 4990 states and 14413 transitions. Second operand 3 states. [2019-12-18 20:59:47,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:47,722 INFO L93 Difference]: Finished difference Result 4999 states and 14422 transitions. [2019-12-18 20:59:47,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:59:47,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 20:59:47,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:47,736 INFO L225 Difference]: With dead ends: 4999 [2019-12-18 20:59:47,737 INFO L226 Difference]: Without dead ends: 4999 [2019-12-18 20:59:47,738 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-18 20:59:47,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4999 states. [2019-12-18 20:59:47,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4999 to 4995. [2019-12-18 20:59:47,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4995 states. [2019-12-18 20:59:47,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4995 states to 4995 states and 14418 transitions. [2019-12-18 20:59:47,841 INFO L78 Accepts]: Start accepts. Automaton has 4995 states and 14418 transitions. Word has length 65 [2019-12-18 20:59:47,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:47,842 INFO L462 AbstractCegarLoop]: Abstraction has 4995 states and 14418 transitions. [2019-12-18 20:59:47,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:59:47,842 INFO L276 IsEmpty]: Start isEmpty. Operand 4995 states and 14418 transitions. [2019-12-18 20:59:47,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:59:47,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:47,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:59:47,852 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-18 20:59:47,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:47,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1953615188, now seen corresponding path program 1 times [2019-12-18 20:59:47,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:47,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482000078] [2019-12-18 20:59:47,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:48,012 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-18 20:59:48,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482000078] [2019-12-18 20:59:48,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:48,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:59:48,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705406436] [2019-12-18 20:59:48,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:59:48,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:48,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:59:48,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:59:48,015 INFO L87 Difference]: Start difference. First operand 4995 states and 14418 transitions. Second operand 5 states. [2019-12-18 20:59:48,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:48,375 INFO L93 Difference]: Finished difference Result 7929 states and 22569 transitions. [2019-12-18 20:59:48,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 20:59:48,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 20:59:48,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:48,389 INFO L225 Difference]: With dead ends: 7929 [2019-12-18 20:59:48,389 INFO L226 Difference]: Without dead ends: 7929 [2019-12-18 20:59:48,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:59:48,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7929 states. [2019-12-18 20:59:48,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7929 to 5807. [2019-12-18 20:59:48,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5807 states. [2019-12-18 20:59:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5807 states to 5807 states and 16815 transitions. [2019-12-18 20:59:48,535 INFO L78 Accepts]: Start accepts. Automaton has 5807 states and 16815 transitions. Word has length 65 [2019-12-18 20:59:48,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:48,536 INFO L462 AbstractCegarLoop]: Abstraction has 5807 states and 16815 transitions. [2019-12-18 20:59:48,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:59:48,536 INFO L276 IsEmpty]: Start isEmpty. Operand 5807 states and 16815 transitions. [2019-12-18 20:59:48,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:59:48,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:48,548 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:59:48,548 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-18 20:59:48,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:48,548 INFO L82 PathProgramCache]: Analyzing trace with hash -353598434, now seen corresponding path program 2 times [2019-12-18 20:59:48,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:48,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441566198] [2019-12-18 20:59:48,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:48,648 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-18 20:59:48,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441566198] [2019-12-18 20:59:48,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:48,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:59:48,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315723920] [2019-12-18 20:59:48,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:59:48,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:48,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:59:48,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:59:48,650 INFO L87 Difference]: Start difference. First operand 5807 states and 16815 transitions. Second operand 6 states. [2019-12-18 20:59:49,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:49,175 INFO L93 Difference]: Finished difference Result 9871 states and 28342 transitions. [2019-12-18 20:59:49,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:59:49,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 20:59:49,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:49,190 INFO L225 Difference]: With dead ends: 9871 [2019-12-18 20:59:49,191 INFO L226 Difference]: Without dead ends: 9871 [2019-12-18 20:59:49,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:59:49,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9871 states. [2019-12-18 20:59:49,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9871 to 6340. [2019-12-18 20:59:49,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6340 states. [2019-12-18 20:59:49,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6340 states to 6340 states and 18400 transitions. [2019-12-18 20:59:49,307 INFO L78 Accepts]: Start accepts. Automaton has 6340 states and 18400 transitions. Word has length 65 [2019-12-18 20:59:49,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:49,307 INFO L462 AbstractCegarLoop]: Abstraction has 6340 states and 18400 transitions. [2019-12-18 20:59:49,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:59:49,307 INFO L276 IsEmpty]: Start isEmpty. Operand 6340 states and 18400 transitions. [2019-12-18 20:59:49,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:59:49,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:49,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:59:49,316 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-18 20:59:49,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:49,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1550061698, now seen corresponding path program 3 times [2019-12-18 20:59:49,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:49,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633686416] [2019-12-18 20:59:49,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:49,434 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-18 20:59:49,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633686416] [2019-12-18 20:59:49,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:49,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:59:49,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704200496] [2019-12-18 20:59:49,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:59:49,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:49,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:59:49,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:59:49,437 INFO L87 Difference]: Start difference. First operand 6340 states and 18400 transitions. Second operand 6 states. [2019-12-18 20:59:50,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:50,007 INFO L93 Difference]: Finished difference Result 8654 states and 24445 transitions. [2019-12-18 20:59:50,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 20:59:50,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 20:59:50,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:50,022 INFO L225 Difference]: With dead ends: 8654 [2019-12-18 20:59:50,022 INFO L226 Difference]: Without dead ends: 8654 [2019-12-18 20:59:50,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:59:50,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8654 states. [2019-12-18 20:59:50,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8654 to 6901. [2019-12-18 20:59:50,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6901 states. [2019-12-18 20:59:50,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6901 states to 6901 states and 19714 transitions. [2019-12-18 20:59:50,138 INFO L78 Accepts]: Start accepts. Automaton has 6901 states and 19714 transitions. Word has length 65 [2019-12-18 20:59:50,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:50,139 INFO L462 AbstractCegarLoop]: Abstraction has 6901 states and 19714 transitions. [2019-12-18 20:59:50,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:59:50,139 INFO L276 IsEmpty]: Start isEmpty. Operand 6901 states and 19714 transitions. [2019-12-18 20:59:50,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 20:59:50,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:50,148 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:59:50,148 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-18 20:59:50,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:50,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1062434320, now seen corresponding path program 4 times [2019-12-18 20:59:50,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:50,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341857641] [2019-12-18 20:59:50,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:50,259 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-18 20:59:50,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341857641] [2019-12-18 20:59:50,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:50,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:59:50,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064878039] [2019-12-18 20:59:50,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:59:50,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:50,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:59:50,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:59:50,262 INFO L87 Difference]: Start difference. First operand 6901 states and 19714 transitions. Second operand 3 states. [2019-12-18 20:59:50,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:50,296 INFO L93 Difference]: Finished difference Result 6338 states and 17868 transitions. [2019-12-18 20:59:50,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:59:50,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 20:59:50,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:50,306 INFO L225 Difference]: With dead ends: 6338 [2019-12-18 20:59:50,306 INFO L226 Difference]: Without dead ends: 6338 [2019-12-18 20:59:50,306 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-18 20:59:50,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6338 states. [2019-12-18 20:59:50,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6338 to 6170. [2019-12-18 20:59:50,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6170 states. [2019-12-18 20:59:50,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6170 states to 6170 states and 17402 transitions. [2019-12-18 20:59:50,399 INFO L78 Accepts]: Start accepts. Automaton has 6170 states and 17402 transitions. Word has length 65 [2019-12-18 20:59:50,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:50,399 INFO L462 AbstractCegarLoop]: Abstraction has 6170 states and 17402 transitions. [2019-12-18 20:59:50,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:59:50,399 INFO L276 IsEmpty]: Start isEmpty. Operand 6170 states and 17402 transitions. [2019-12-18 20:59:50,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:59:50,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:50,408 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:59:50,408 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-18 20:59:50,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:50,408 INFO L82 PathProgramCache]: Analyzing trace with hash 522553115, now seen corresponding path program 1 times [2019-12-18 20:59:50,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:50,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808982481] [2019-12-18 20:59:50,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:50,514 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-18 20:59:50,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808982481] [2019-12-18 20:59:50,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:50,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:59:50,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096504588] [2019-12-18 20:59:50,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:59:50,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:50,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:59:50,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:59:50,516 INFO L87 Difference]: Start difference. First operand 6170 states and 17402 transitions. Second operand 6 states. [2019-12-18 20:59:51,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:51,120 INFO L93 Difference]: Finished difference Result 8321 states and 23211 transitions. [2019-12-18 20:59:51,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 20:59:51,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 20:59:51,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:51,133 INFO L225 Difference]: With dead ends: 8321 [2019-12-18 20:59:51,134 INFO L226 Difference]: Without dead ends: 8321 [2019-12-18 20:59:51,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 20:59:51,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8321 states. [2019-12-18 20:59:51,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8321 to 6562. [2019-12-18 20:59:51,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6562 states. [2019-12-18 20:59:51,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6562 states to 6562 states and 18494 transitions. [2019-12-18 20:59:51,289 INFO L78 Accepts]: Start accepts. Automaton has 6562 states and 18494 transitions. Word has length 66 [2019-12-18 20:59:51,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:51,289 INFO L462 AbstractCegarLoop]: Abstraction has 6562 states and 18494 transitions. [2019-12-18 20:59:51,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:59:51,289 INFO L276 IsEmpty]: Start isEmpty. Operand 6562 states and 18494 transitions. [2019-12-18 20:59:51,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 20:59:51,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:51,308 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:59:51,308 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-18 20:59:51,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:51,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1443851743, now seen corresponding path program 2 times [2019-12-18 20:59:51,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:51,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524125560] [2019-12-18 20:59:51,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:51,388 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-18 20:59:51,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524125560] [2019-12-18 20:59:51,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:51,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:59:51,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153218263] [2019-12-18 20:59:51,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:59:51,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:51,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:59:51,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:59:51,390 INFO L87 Difference]: Start difference. First operand 6562 states and 18494 transitions. Second operand 3 states. [2019-12-18 20:59:51,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:51,420 INFO L93 Difference]: Finished difference Result 5919 states and 16477 transitions. [2019-12-18 20:59:51,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:59:51,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 20:59:51,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:51,429 INFO L225 Difference]: With dead ends: 5919 [2019-12-18 20:59:51,430 INFO L226 Difference]: Without dead ends: 5919 [2019-12-18 20:59:51,431 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-18 20:59:51,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5919 states. [2019-12-18 20:59:51,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5919 to 5751. [2019-12-18 20:59:51,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5751 states. [2019-12-18 20:59:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5751 states to 5751 states and 16025 transitions. [2019-12-18 20:59:51,540 INFO L78 Accepts]: Start accepts. Automaton has 5751 states and 16025 transitions. Word has length 66 [2019-12-18 20:59:51,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:51,541 INFO L462 AbstractCegarLoop]: Abstraction has 5751 states and 16025 transitions. [2019-12-18 20:59:51,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:59:51,541 INFO L276 IsEmpty]: Start isEmpty. Operand 5751 states and 16025 transitions. [2019-12-18 20:59:51,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 20:59:51,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:51,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:59:51,552 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-18 20:59:51,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:51,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1735728213, now seen corresponding path program 1 times [2019-12-18 20:59:51,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:51,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967205072] [2019-12-18 20:59:51,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:51,627 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-18 20:59:51,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967205072] [2019-12-18 20:59:51,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:51,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:59:51,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642862241] [2019-12-18 20:59:51,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:59:51,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:51,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:59:51,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:59:51,629 INFO L87 Difference]: Start difference. First operand 5751 states and 16025 transitions. Second operand 3 states. [2019-12-18 20:59:51,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:51,692 INFO L93 Difference]: Finished difference Result 5751 states and 16024 transitions. [2019-12-18 20:59:51,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:59:51,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 20:59:51,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:51,701 INFO L225 Difference]: With dead ends: 5751 [2019-12-18 20:59:51,701 INFO L226 Difference]: Without dead ends: 5751 [2019-12-18 20:59:51,702 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-18 20:59:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5751 states. [2019-12-18 20:59:51,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5751 to 3410. [2019-12-18 20:59:51,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3410 states. [2019-12-18 20:59:51,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3410 states to 3410 states and 9570 transitions. [2019-12-18 20:59:51,790 INFO L78 Accepts]: Start accepts. Automaton has 3410 states and 9570 transitions. Word has length 67 [2019-12-18 20:59:51,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:51,790 INFO L462 AbstractCegarLoop]: Abstraction has 3410 states and 9570 transitions. [2019-12-18 20:59:51,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:59:51,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3410 states and 9570 transitions. [2019-12-18 20:59:51,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 20:59:51,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:51,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:59:51,798 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-18 20:59:51,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:51,799 INFO L82 PathProgramCache]: Analyzing trace with hash 567215771, now seen corresponding path program 1 times [2019-12-18 20:59:51,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:51,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149370330] [2019-12-18 20:59:51,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:51,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-18 20:59:51,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149370330] [2019-12-18 20:59:51,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:51,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:59:51,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065259433] [2019-12-18 20:59:51,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:59:51,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:51,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:59:51,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:59:51,988 INFO L87 Difference]: Start difference. First operand 3410 states and 9570 transitions. Second operand 6 states. [2019-12-18 20:59:52,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:52,120 INFO L93 Difference]: Finished difference Result 5924 states and 16624 transitions. [2019-12-18 20:59:52,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:59:52,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-18 20:59:52,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:52,126 INFO L225 Difference]: With dead ends: 5924 [2019-12-18 20:59:52,126 INFO L226 Difference]: Without dead ends: 3026 [2019-12-18 20:59:52,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:59:52,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3026 states. [2019-12-18 20:59:52,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3026 to 2624. [2019-12-18 20:59:52,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-12-18 20:59:52,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 7300 transitions. [2019-12-18 20:59:52,194 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 7300 transitions. Word has length 68 [2019-12-18 20:59:52,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:52,194 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 7300 transitions. [2019-12-18 20:59:52,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:59:52,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 7300 transitions. [2019-12-18 20:59:52,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 20:59:52,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:52,198 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:59:52,199 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-18 20:59:52,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:52,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1899721119, now seen corresponding path program 2 times [2019-12-18 20:59:52,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:52,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788160409] [2019-12-18 20:59:52,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:59:52,521 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-18 20:59:52,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788160409] [2019-12-18 20:59:52,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:59:52,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 20:59:52,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932938700] [2019-12-18 20:59:52,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 20:59:52,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:59:52,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 20:59:52,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-18 20:59:52,523 INFO L87 Difference]: Start difference. First operand 2624 states and 7300 transitions. Second operand 13 states. [2019-12-18 20:59:53,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:59:53,559 INFO L93 Difference]: Finished difference Result 8283 states and 23040 transitions. [2019-12-18 20:59:53,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 20:59:53,560 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-18 20:59:53,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:59:53,564 INFO L225 Difference]: With dead ends: 8283 [2019-12-18 20:59:53,564 INFO L226 Difference]: Without dead ends: 2282 [2019-12-18 20:59:53,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=502, Unknown=0, NotChecked=0, Total=702 [2019-12-18 20:59:53,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2019-12-18 20:59:53,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 1898. [2019-12-18 20:59:53,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2019-12-18 20:59:53,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 5237 transitions. [2019-12-18 20:59:53,597 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 5237 transitions. Word has length 68 [2019-12-18 20:59:53,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:59:53,597 INFO L462 AbstractCegarLoop]: Abstraction has 1898 states and 5237 transitions. [2019-12-18 20:59:53,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 20:59:53,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 5237 transitions. [2019-12-18 20:59:53,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 20:59:53,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:59:53,599 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:59:53,599 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-18 20:59:53,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:59:53,600 INFO L82 PathProgramCache]: Analyzing trace with hash -149569657, now seen corresponding path program 3 times [2019-12-18 20:59:53,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:59:53,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253180968] [2019-12-18 20:59:53,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:59:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:59:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:59:53,717 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:59:53,717 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:59:53,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~weak$$choice0~0_8) (= v_~x$r_buff1_thd2~0_17 0) (= 0 v_~x$w_buff1~0_28) (= 0 v_~x$r_buff0_thd2~0_26) (= v_~x$flush_delayed~0_15 0) (= 0 v_~x$r_buff0_thd1~0_20) (= v_~main$tmp_guard1~0_11 0) (= v_~main$tmp_guard0~0_8 0) (= 0 v_~x$r_buff0_thd0~0_78) (< 0 |v_#StackHeapBarrier_17|) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t748~0.base_20| 1)) (= v_~x~0_29 0) (= v_~__unbuffered_p2_EAX~0_8 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_18 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t748~0.base_20| 4)) (= v_~y~0_12 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t748~0.base_20| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t748~0.base_20|) |v_ULTIMATE.start_main_~#t748~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~__unbuffered_cnt~0_19) (= v_~x$mem_tmp~0_10 0) (= 0 v_~x$read_delayed~0_7) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t748~0.base_20|) (= |v_ULTIMATE.start_main_~#t748~0.offset_17| 0) (= v_~x$w_buff1_used~0_72 0) (= v_~x$r_buff1_thd0~0_46 0) (= v_~__unbuffered_p2_EBX~0_8 0) (= |v_#NULL.offset_5| 0) (= 0 v_~z~0_9) (= v_~x$r_buff1_thd3~0_17 0) (= 0 v_~x$w_buff0_used~0_118) (= 0 v_~x$r_buff0_thd3~0_19) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff0~0_30) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t748~0.base_20|)) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ~x$w_buff0~0=v_~x$w_buff0~0_30, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_18, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ULTIMATE.start_main_~#t749~0.offset=|v_ULTIMATE.start_main_~#t749~0.offset_17|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ULTIMATE.start_main_~#t748~0.base=|v_ULTIMATE.start_main_~#t748~0.base_20|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_78, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_8, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ~x$w_buff1~0=v_~x$w_buff1~0_28, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_~#t750~0.offset=|v_ULTIMATE.start_main_~#t750~0.offset_17|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_72, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x~0=v_~x~0_29, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_~#t748~0.offset=|v_ULTIMATE.start_main_~#t748~0.offset_17|, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ~y~0=v_~y~0_12, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_46, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_26, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t749~0.base=|v_ULTIMATE.start_main_~#t749~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_9, ULTIMATE.start_main_~#t750~0.base=|v_ULTIMATE.start_main_~#t750~0.base_21|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t749~0.offset, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t748~0.base, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t750~0.offset, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t748~0.offset, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t749~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t750~0.base, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 20:59:53,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L810-1-->L812: Formula: (and (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t749~0.base_13|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t749~0.base_13| 4)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t749~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t749~0.base_13| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t749~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t749~0.base_13|) |v_ULTIMATE.start_main_~#t749~0.offset_11| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t749~0.base_13|) (= |v_ULTIMATE.start_main_~#t749~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t749~0.offset=|v_ULTIMATE.start_main_~#t749~0.offset_11|, ULTIMATE.start_main_~#t749~0.base=|v_ULTIMATE.start_main_~#t749~0.base_13|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t749~0.offset, ULTIMATE.start_main_~#t749~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 20:59:53,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L812-1-->L814: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t750~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t750~0.base_13|) |v_ULTIMATE.start_main_~#t750~0.offset_11| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t750~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t750~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t750~0.base_13|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t750~0.base_13| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t750~0.offset_11|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t750~0.base_13| 1) |v_#valid_34|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t750~0.offset=|v_ULTIMATE.start_main_~#t750~0.offset_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t750~0.base=|v_ULTIMATE.start_main_~#t750~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t750~0.offset, #length, ULTIMATE.start_main_~#t750~0.base] because there is no mapped edge [2019-12-18 20:59:53,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] P1ENTRY-->L4-3: Formula: (and (= v_~x$w_buff1_used~0_62 v_~x$w_buff0_used~0_105) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|) (= v_~x$w_buff0~0_19 v_~x$w_buff1~0_20) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1) (= 1 v_~x$w_buff0_used~0_104) (= (mod v_~x$w_buff1_used~0_62 256) 0) (= 2 v_~x$w_buff0~0_18) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_19, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~x$w_buff0~0=v_~x$w_buff0~0_18, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, ~x$w_buff1~0=v_~x$w_buff1~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_104} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 20:59:53,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L787-2-->L787-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-567918500 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-567918500 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-567918500| ~x$w_buff1~0_In-567918500)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out-567918500| ~x~0_In-567918500)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-567918500, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-567918500, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-567918500, ~x~0=~x~0_In-567918500} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-567918500|, ~x$w_buff1~0=~x$w_buff1~0_In-567918500, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-567918500, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-567918500, ~x~0=~x~0_In-567918500} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 20:59:53,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L787-4-->L788: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_19) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-18 20:59:53,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L735-2-->L735-5: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In469599541 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In469599541 256))) (.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out469599541| |P0Thread1of1ForFork0_#t~ite3_Out469599541|))) (or (and .cse0 (or .cse1 .cse2) (= |P0Thread1of1ForFork0_#t~ite3_Out469599541| ~x~0_In469599541)) (and (not .cse2) (not .cse1) .cse0 (= ~x$w_buff1~0_In469599541 |P0Thread1of1ForFork0_#t~ite3_Out469599541|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In469599541, ~x$w_buff1_used~0=~x$w_buff1_used~0_In469599541, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In469599541, ~x~0=~x~0_In469599541} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out469599541|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out469599541|, ~x$w_buff1~0=~x$w_buff1~0_In469599541, ~x$w_buff1_used~0=~x$w_buff1_used~0_In469599541, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In469599541, ~x~0=~x~0_In469599541} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 20:59:53,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L736-->L736-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-138054324 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-138054324 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-138054324| 0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-138054324 |P0Thread1of1ForFork0_#t~ite5_Out-138054324|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-138054324, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-138054324} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-138054324|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-138054324, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-138054324} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 20:59:53,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-843288505 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-843288505 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-843288505 |P2Thread1of1ForFork2_#t~ite17_Out-843288505|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-843288505|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-843288505, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-843288505} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-843288505, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-843288505|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-843288505} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 20:59:53,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-1673652225 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1673652225 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In-1673652225 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1673652225 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite18_Out-1673652225| 0)) (and (= ~x$w_buff1_used~0_In-1673652225 |P2Thread1of1ForFork2_#t~ite18_Out-1673652225|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1673652225, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1673652225, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1673652225, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1673652225} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1673652225, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1673652225, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1673652225, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1673652225|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1673652225} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 20:59:53,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L737-->L737-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-618219619 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-618219619 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-618219619 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In-618219619 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-618219619|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-618219619 |P0Thread1of1ForFork0_#t~ite6_Out-618219619|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-618219619, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-618219619, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-618219619, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-618219619} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-618219619|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-618219619, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-618219619, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-618219619, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-618219619} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 20:59:53,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L790-->L790-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-344693677 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-344693677 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out-344693677| ~x$r_buff0_thd3~0_In-344693677)) (and (= 0 |P2Thread1of1ForFork2_#t~ite19_Out-344693677|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-344693677, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-344693677} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-344693677, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-344693677|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-344693677} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 20:59:53,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-393389950 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-393389950 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In-393389950 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd3~0_In-393389950 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite20_Out-393389950| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite20_Out-393389950| ~x$r_buff1_thd3~0_In-393389950)))) InVars {~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-393389950, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-393389950, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-393389950, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-393389950} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-393389950|, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-393389950, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-393389950, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-393389950, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-393389950} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 20:59:53,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L791-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~x$r_buff1_thd3~0_12) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 20:59:53,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1527370641 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1527370641 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1527370641|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1527370641 |P1Thread1of1ForFork1_#t~ite11_Out1527370641|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1527370641, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1527370641} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1527370641|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1527370641, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1527370641} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 20:59:53,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In584364654 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In584364654 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In584364654 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In584364654 256) 0))) (or (and (= ~x$w_buff1_used~0_In584364654 |P1Thread1of1ForFork1_#t~ite12_Out584364654|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out584364654| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In584364654, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In584364654, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In584364654, ~x$w_buff0_used~0=~x$w_buff0_used~0_In584364654} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In584364654, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In584364654, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out584364654|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In584364654, ~x$w_buff0_used~0=~x$w_buff0_used~0_In584364654} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 20:59:53,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L767-->L768: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-48146407 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-48146407 256)))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out-48146407 0)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In-48146407 ~x$r_buff0_thd2~0_Out-48146407)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-48146407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-48146407} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-48146407|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-48146407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-48146407} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 20:59:53,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1913967099 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1913967099 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1913967099 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1913967099 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1913967099|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd2~0_In1913967099 |P1Thread1of1ForFork1_#t~ite14_Out1913967099|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1913967099, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1913967099, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1913967099, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1913967099} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1913967099, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1913967099, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1913967099, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1913967099|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1913967099} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 20:59:53,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 20:59:53,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L738-->L738-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-351609118 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-351609118 256) 0))) (or (and (= ~x$r_buff0_thd1~0_In-351609118 |P0Thread1of1ForFork0_#t~ite7_Out-351609118|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out-351609118| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-351609118, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-351609118} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-351609118, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-351609118|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-351609118} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 20:59:53,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L739-->L739-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd1~0_In1007489851 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1007489851 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In1007489851 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1007489851 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1007489851|)) (and (= ~x$r_buff1_thd1~0_In1007489851 |P0Thread1of1ForFork0_#t~ite8_Out1007489851|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1007489851, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1007489851, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1007489851, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1007489851} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1007489851, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1007489851|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1007489851, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1007489851, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1007489851} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 20:59:53,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L739-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_14 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 20:59:53,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L820: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 20:59:53,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L820-2-->L820-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite25_Out-863435468| |ULTIMATE.start_main_#t~ite24_Out-863435468|)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-863435468 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-863435468 256) 0))) (or (and .cse0 (= ~x~0_In-863435468 |ULTIMATE.start_main_#t~ite24_Out-863435468|) (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= ~x$w_buff1~0_In-863435468 |ULTIMATE.start_main_#t~ite24_Out-863435468|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-863435468, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-863435468, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-863435468, ~x~0=~x~0_In-863435468} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-863435468, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-863435468|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-863435468|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-863435468, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-863435468, ~x~0=~x~0_In-863435468} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 20:59:53,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In906409669 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In906409669 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite26_Out906409669|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite26_Out906409669| ~x$w_buff0_used~0_In906409669) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In906409669, ~x$w_buff0_used~0=~x$w_buff0_used~0_In906409669} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In906409669, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out906409669|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In906409669} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 20:59:53,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1607039192 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1607039192 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1607039192 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In1607039192 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite27_Out1607039192|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In1607039192 |ULTIMATE.start_main_#t~ite27_Out1607039192|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1607039192, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1607039192, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1607039192, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1607039192} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1607039192, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1607039192, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1607039192|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1607039192, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1607039192} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 20:59:53,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1831648484 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1831648484 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite28_Out1831648484| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In1831648484 |ULTIMATE.start_main_#t~ite28_Out1831648484|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1831648484, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1831648484} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1831648484, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1831648484|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1831648484} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 20:59:53,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-486786656 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-486786656 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-486786656 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-486786656 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In-486786656 |ULTIMATE.start_main_#t~ite29_Out-486786656|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite29_Out-486786656|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-486786656, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-486786656, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-486786656, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-486786656} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-486786656, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-486786656|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-486786656, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-486786656, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-486786656} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 20:59:53,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L836-->L837: Formula: (and (= v_~x$r_buff0_thd0~0_59 v_~x$r_buff0_thd0~0_58) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_58, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 20:59:53,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L839-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_8 256)) (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= v_~x$flush_delayed~0_10 0) (= v_~x$mem_tmp~0_7 v_~x~0_25)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_7} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_7, ~x~0=v_~x~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 20:59:53,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 20:59:53,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:59:53 BasicIcfg [2019-12-18 20:59:53,905 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:59:53,909 INFO L168 Benchmark]: Toolchain (without parser) took 100581.43 ms. Allocated memory was 136.8 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 100.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 20:59:53,912 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 20:59:53,913 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.59 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 99.9 MB in the beginning and 153.7 MB in the end (delta: -53.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:59:53,914 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.89 ms. Allocated memory is still 201.9 MB. Free memory was 153.7 MB in the beginning and 150.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-18 20:59:53,919 INFO L168 Benchmark]: Boogie Preprocessor took 41.30 ms. Allocated memory is still 201.9 MB. Free memory was 150.2 MB in the beginning and 148.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 20:59:53,919 INFO L168 Benchmark]: RCFGBuilder took 983.07 ms. Allocated memory is still 201.9 MB. Free memory was 148.1 MB in the beginning and 97.8 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. [2019-12-18 20:59:53,920 INFO L168 Benchmark]: TraceAbstraction took 98691.07 ms. Allocated memory was 201.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 97.1 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 20:59:53,926 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 778.59 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 99.9 MB in the beginning and 153.7 MB in the end (delta: -53.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 81.89 ms. Allocated memory is still 201.9 MB. Free memory was 153.7 MB in the beginning and 150.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.30 ms. Allocated memory is still 201.9 MB. Free memory was 150.2 MB in the beginning and 148.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 983.07 ms. Allocated memory is still 201.9 MB. Free memory was 148.1 MB in the beginning and 97.8 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 98691.07 ms. Allocated memory was 201.9 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 97.1 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 175 ProgramPointsBefore, 97 ProgramPointsAfterwards, 212 TransitionsBefore, 110 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 28 ChoiceCompositions, 5221 VarBasedMoverChecksPositive, 172 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 82846 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t748, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t749, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t750, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L754] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L755] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L756] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L757] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L758] 2 x$r_buff0_thd2 = (_Bool)1 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L778] 3 y = 2 [L781] 3 __unbuffered_p2_EAX = y [L784] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L729] 1 z = 1 [L732] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0: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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L787] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0: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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L735] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0: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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L735] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L788] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L736] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L789] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L790] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0: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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L738] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L820] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L820] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L821] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L822] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L823] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L824] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 x$flush_delayed = weak$$choice2 [L830] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L831] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L832] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L832] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L833] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L833] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L834] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L834] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L835] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L835] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L837] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 98.3s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 26.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2682 SDtfs, 2427 SDslu, 4989 SDs, 0 SdLazy, 3145 SolverSat, 147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 32 SyntacticMatches, 14 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217043occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 44.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 82563 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 851 NumberOfCodeBlocks, 851 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 766 ConstructedInterpolants, 0 QuantifiedInterpolants, 131382 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...