/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:00:21,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:00:21,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:00:21,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:00:21,175 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:00:21,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:00:21,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:00:21,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:00:21,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:00:21,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:00:21,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:00:21,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:00:21,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:00:21,203 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:00:21,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:00:21,207 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:00:21,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:00:21,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:00:21,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:00:21,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:00:21,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:00:21,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:00:21,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:00:21,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:00:21,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:00:21,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:00:21,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:00:21,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:00:21,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:00:21,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:00:21,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:00:21,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:00:21,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:00:21,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:00:21,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:00:21,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:00:21,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:00:21,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:00:21,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:00:21,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:00:21,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:00:21,246 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:00:21,281 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:00:21,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:00:21,282 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:00:21,283 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:00:21,283 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:00:21,283 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:00:21,283 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:00:21,283 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:00:21,284 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:00:21,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:00:21,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:00:21,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:00:21,290 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:00:21,290 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:00:21,290 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:00:21,290 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:00:21,290 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:00:21,291 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:00:21,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:00:21,291 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:00:21,291 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:00:21,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:00:21,291 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:00:21,293 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:00:21,293 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:00:21,293 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:00:21,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:00:21,294 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:00:21,294 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:00:21,294 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:00:21,585 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:00:21,603 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:00:21,607 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:00:21,609 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:00:21,609 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:00:21,610 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i [2019-12-18 14:00:21,692 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41d265830/aa370931cfd64d3299957ac9397b107b/FLAG937fc1778 [2019-12-18 14:00:22,219 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:00:22,220 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_tso.oepc.i [2019-12-18 14:00:22,234 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41d265830/aa370931cfd64d3299957ac9397b107b/FLAG937fc1778 [2019-12-18 14:00:22,499 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41d265830/aa370931cfd64d3299957ac9397b107b [2019-12-18 14:00:22,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:00:22,510 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:00:22,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:00:22,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:00:22,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:00:22,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:00:22" (1/1) ... [2019-12-18 14:00:22,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6968dd54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:00:22, skipping insertion in model container [2019-12-18 14:00:22,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:00:22" (1/1) ... [2019-12-18 14:00:22,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:00:22,594 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:00:23,066 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:00:23,088 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:00:23,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:00:23,274 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:00:23,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:00:23 WrapperNode [2019-12-18 14:00:23,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:00:23,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:00:23,276 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:00:23,276 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:00:23,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:00:23" (1/1) ... [2019-12-18 14:00:23,320 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:00:23" (1/1) ... [2019-12-18 14:00:23,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:00:23,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:00:23,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:00:23,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:00:23,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:00:23" (1/1) ... [2019-12-18 14:00:23,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:00:23" (1/1) ... [2019-12-18 14:00:23,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:00:23" (1/1) ... [2019-12-18 14:00:23,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:00:23" (1/1) ... [2019-12-18 14:00:23,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:00:23" (1/1) ... [2019-12-18 14:00:23,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:00:23" (1/1) ... [2019-12-18 14:00:23,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:00:23" (1/1) ... [2019-12-18 14:00:23,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:00:23,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:00:23,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:00:23,397 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:00:23,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:00:23" (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 14:00:23,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:00:23,478 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:00:23,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:00:23,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:00:23,479 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:00:23,480 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:00:23,480 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:00:23,481 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:00:23,481 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:00:23,482 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:00:23,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:00:23,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:00:23,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:00:23,485 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 14:00:24,232 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:00:24,233 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:00:24,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:00:24 BoogieIcfgContainer [2019-12-18 14:00:24,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:00:24,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:00:24,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:00:24,240 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:00:24,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:00:22" (1/3) ... [2019-12-18 14:00:24,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a34ea6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:00:24, skipping insertion in model container [2019-12-18 14:00:24,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:00:23" (2/3) ... [2019-12-18 14:00:24,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a34ea6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:00:24, skipping insertion in model container [2019-12-18 14:00:24,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:00:24" (3/3) ... [2019-12-18 14:00:24,244 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_tso.oepc.i [2019-12-18 14:00:24,255 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:00:24,256 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:00:24,264 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:00:24,265 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:00:24,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,305 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,306 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,307 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,308 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,312 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,319 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,319 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,320 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,320 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,320 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,331 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,333 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,333 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,339 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,340 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,359 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,360 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:00:24,378 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:00:24,404 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:00:24,405 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:00:24,405 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:00:24,405 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:00:24,406 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:00:24,410 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:00:24,411 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:00:24,411 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:00:24,437 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-18 14:00:24,449 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 14:00:24,553 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 14:00:24,554 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:00:24,569 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:00:24,590 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-18 14:00:24,632 INFO L126 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-18 14:00:24,632 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:00:24,639 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 14:00:24,655 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 14:00:24,656 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:00:29,398 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 14:00:29,502 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 14:00:29,522 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48383 [2019-12-18 14:00:29,522 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-18 14:00:29,525 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-18 14:00:30,600 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16526 states. [2019-12-18 14:00:30,602 INFO L276 IsEmpty]: Start isEmpty. Operand 16526 states. [2019-12-18 14:00:30,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 14:00:30,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:30,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:30,609 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:30,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:30,614 INFO L82 PathProgramCache]: Analyzing trace with hash 2128093424, now seen corresponding path program 1 times [2019-12-18 14:00:30,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:30,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344568418] [2019-12-18 14:00:30,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:30,890 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 14:00:30,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344568418] [2019-12-18 14:00:30,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:30,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:00:30,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419586746] [2019-12-18 14:00:30,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:00:30,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:30,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:00:30,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:30,916 INFO L87 Difference]: Start difference. First operand 16526 states. Second operand 3 states. [2019-12-18 14:00:31,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:31,332 INFO L93 Difference]: Finished difference Result 16398 states and 61580 transitions. [2019-12-18 14:00:31,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:31,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 14:00:31,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:31,525 INFO L225 Difference]: With dead ends: 16398 [2019-12-18 14:00:31,525 INFO L226 Difference]: Without dead ends: 16062 [2019-12-18 14:00:31,526 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 14:00:31,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16062 states. [2019-12-18 14:00:32,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16062 to 16062. [2019-12-18 14:00:32,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16062 states. [2019-12-18 14:00:32,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16062 states to 16062 states and 60376 transitions. [2019-12-18 14:00:32,891 INFO L78 Accepts]: Start accepts. Automaton has 16062 states and 60376 transitions. Word has length 7 [2019-12-18 14:00:32,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:32,893 INFO L462 AbstractCegarLoop]: Abstraction has 16062 states and 60376 transitions. [2019-12-18 14:00:32,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 16062 states and 60376 transitions. [2019-12-18 14:00:32,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:00:32,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:32,906 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:32,907 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:32,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:32,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1390331573, now seen corresponding path program 1 times [2019-12-18 14:00:32,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:32,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524317890] [2019-12-18 14:00:32,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:33,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:00:33,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524317890] [2019-12-18 14:00:33,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:33,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:00:33,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278825407] [2019-12-18 14:00:33,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:00:33,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:33,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:00:33,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:00:33,073 INFO L87 Difference]: Start difference. First operand 16062 states and 60376 transitions. Second operand 4 states. [2019-12-18 14:00:34,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:34,022 INFO L93 Difference]: Finished difference Result 24942 states and 90524 transitions. [2019-12-18 14:00:34,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:00:34,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:00:34,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:34,128 INFO L225 Difference]: With dead ends: 24942 [2019-12-18 14:00:34,128 INFO L226 Difference]: Without dead ends: 24928 [2019-12-18 14:00:34,129 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 14:00:34,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24928 states. [2019-12-18 14:00:34,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24928 to 22166. [2019-12-18 14:00:34,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22166 states. [2019-12-18 14:00:35,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22166 states to 22166 states and 81470 transitions. [2019-12-18 14:00:35,003 INFO L78 Accepts]: Start accepts. Automaton has 22166 states and 81470 transitions. Word has length 13 [2019-12-18 14:00:35,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:35,003 INFO L462 AbstractCegarLoop]: Abstraction has 22166 states and 81470 transitions. [2019-12-18 14:00:35,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:00:35,004 INFO L276 IsEmpty]: Start isEmpty. Operand 22166 states and 81470 transitions. [2019-12-18 14:00:35,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:00:35,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:35,005 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:35,006 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:35,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:35,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1371832765, now seen corresponding path program 1 times [2019-12-18 14:00:35,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:35,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507879109] [2019-12-18 14:00:35,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:35,049 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 14:00:35,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507879109] [2019-12-18 14:00:35,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:35,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:00:35,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346798641] [2019-12-18 14:00:35,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:00:35,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:35,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:00:35,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:35,052 INFO L87 Difference]: Start difference. First operand 22166 states and 81470 transitions. Second operand 3 states. [2019-12-18 14:00:35,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:35,119 INFO L93 Difference]: Finished difference Result 12675 states and 40338 transitions. [2019-12-18 14:00:35,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:35,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 14:00:35,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:35,161 INFO L225 Difference]: With dead ends: 12675 [2019-12-18 14:00:35,161 INFO L226 Difference]: Without dead ends: 12675 [2019-12-18 14:00:35,161 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 14:00:35,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12675 states. [2019-12-18 14:00:36,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12675 to 12675. [2019-12-18 14:00:36,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12675 states. [2019-12-18 14:00:36,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12675 states to 12675 states and 40338 transitions. [2019-12-18 14:00:36,333 INFO L78 Accepts]: Start accepts. Automaton has 12675 states and 40338 transitions. Word has length 13 [2019-12-18 14:00:36,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:36,333 INFO L462 AbstractCegarLoop]: Abstraction has 12675 states and 40338 transitions. [2019-12-18 14:00:36,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:36,334 INFO L276 IsEmpty]: Start isEmpty. Operand 12675 states and 40338 transitions. [2019-12-18 14:00:36,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:00:36,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:36,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:36,336 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:36,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:36,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1884008947, now seen corresponding path program 1 times [2019-12-18 14:00:36,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:36,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502611274] [2019-12-18 14:00:36,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:36,382 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 14:00:36,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502611274] [2019-12-18 14:00:36,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:36,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:36,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426311401] [2019-12-18 14:00:36,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:00:36,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:36,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:00:36,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:00:36,385 INFO L87 Difference]: Start difference. First operand 12675 states and 40338 transitions. Second operand 4 states. [2019-12-18 14:00:36,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:36,408 INFO L93 Difference]: Finished difference Result 1939 states and 4540 transitions. [2019-12-18 14:00:36,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:00:36,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 14:00:36,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:36,415 INFO L225 Difference]: With dead ends: 1939 [2019-12-18 14:00:36,415 INFO L226 Difference]: Without dead ends: 1939 [2019-12-18 14:00:36,415 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 14:00:36,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-12-18 14:00:36,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1939. [2019-12-18 14:00:36,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2019-12-18 14:00:36,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 4540 transitions. [2019-12-18 14:00:36,448 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 4540 transitions. Word has length 14 [2019-12-18 14:00:36,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:36,448 INFO L462 AbstractCegarLoop]: Abstraction has 1939 states and 4540 transitions. [2019-12-18 14:00:36,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:00:36,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 4540 transitions. [2019-12-18 14:00:36,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 14:00:36,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:36,451 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] [2019-12-18 14:00:36,451 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:36,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:36,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1748149180, now seen corresponding path program 1 times [2019-12-18 14:00:36,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:36,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241650481] [2019-12-18 14:00:36,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:36,567 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 14:00:36,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241650481] [2019-12-18 14:00:36,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:36,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:00:36,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158384390] [2019-12-18 14:00:36,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:00:36,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:36,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:00:36,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:36,569 INFO L87 Difference]: Start difference. First operand 1939 states and 4540 transitions. Second operand 5 states. [2019-12-18 14:00:36,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:36,595 INFO L93 Difference]: Finished difference Result 653 states and 1533 transitions. [2019-12-18 14:00:36,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:00:36,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 14:00:36,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:36,597 INFO L225 Difference]: With dead ends: 653 [2019-12-18 14:00:36,597 INFO L226 Difference]: Without dead ends: 653 [2019-12-18 14:00:36,597 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 14:00:36,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-18 14:00:36,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 597. [2019-12-18 14:00:36,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-12-18 14:00:36,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1401 transitions. [2019-12-18 14:00:36,608 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1401 transitions. Word has length 26 [2019-12-18 14:00:36,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:36,608 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 1401 transitions. [2019-12-18 14:00:36,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:00:36,608 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1401 transitions. [2019-12-18 14:00:36,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:00:36,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:36,613 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:36,613 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:36,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:36,614 INFO L82 PathProgramCache]: Analyzing trace with hash 306322931, now seen corresponding path program 1 times [2019-12-18 14:00:36,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:36,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50123384] [2019-12-18 14:00:36,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:36,698 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 14:00:36,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50123384] [2019-12-18 14:00:36,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:36,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:00:36,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557099807] [2019-12-18 14:00:36,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:00:36,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:36,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:00:36,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:36,700 INFO L87 Difference]: Start difference. First operand 597 states and 1401 transitions. Second operand 3 states. [2019-12-18 14:00:36,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:36,745 INFO L93 Difference]: Finished difference Result 607 states and 1414 transitions. [2019-12-18 14:00:36,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:36,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 14:00:36,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:36,747 INFO L225 Difference]: With dead ends: 607 [2019-12-18 14:00:36,747 INFO L226 Difference]: Without dead ends: 607 [2019-12-18 14:00:36,747 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 14:00:36,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-12-18 14:00:36,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 603. [2019-12-18 14:00:36,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-12-18 14:00:36,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1410 transitions. [2019-12-18 14:00:36,757 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 1410 transitions. Word has length 55 [2019-12-18 14:00:36,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:36,757 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 1410 transitions. [2019-12-18 14:00:36,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:36,757 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 1410 transitions. [2019-12-18 14:00:36,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 14:00:36,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:36,759 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:36,760 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:36,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:36,760 INFO L82 PathProgramCache]: Analyzing trace with hash -826083081, now seen corresponding path program 1 times [2019-12-18 14:00:36,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:36,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632913738] [2019-12-18 14:00:36,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:36,845 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 14:00:36,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632913738] [2019-12-18 14:00:36,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:36,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:00:36,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847469634] [2019-12-18 14:00:36,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:00:36,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:36,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:00:36,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:36,848 INFO L87 Difference]: Start difference. First operand 603 states and 1410 transitions. Second operand 3 states. [2019-12-18 14:00:36,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:36,864 INFO L93 Difference]: Finished difference Result 579 states and 1326 transitions. [2019-12-18 14:00:36,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:36,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 14:00:36,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:36,866 INFO L225 Difference]: With dead ends: 579 [2019-12-18 14:00:36,867 INFO L226 Difference]: Without dead ends: 579 [2019-12-18 14:00:36,867 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 14:00:36,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-12-18 14:00:36,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-12-18 14:00:36,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-12-18 14:00:36,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1326 transitions. [2019-12-18 14:00:36,876 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 1326 transitions. Word has length 55 [2019-12-18 14:00:36,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:36,877 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 1326 transitions. [2019-12-18 14:00:36,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 1326 transitions. [2019-12-18 14:00:36,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:00:36,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:36,879 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] [2019-12-18 14:00:36,879 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:36,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:36,879 INFO L82 PathProgramCache]: Analyzing trace with hash -438818646, now seen corresponding path program 1 times [2019-12-18 14:00:36,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:36,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463016534] [2019-12-18 14:00:36,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:36,969 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 14:00:36,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463016534] [2019-12-18 14:00:36,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:36,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:00:36,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899104551] [2019-12-18 14:00:36,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:00:36,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:36,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:00:36,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:00:36,971 INFO L87 Difference]: Start difference. First operand 579 states and 1326 transitions. Second operand 5 states. [2019-12-18 14:00:37,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:37,188 INFO L93 Difference]: Finished difference Result 850 states and 1949 transitions. [2019-12-18 14:00:37,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:00:37,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-18 14:00:37,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:37,191 INFO L225 Difference]: With dead ends: 850 [2019-12-18 14:00:37,191 INFO L226 Difference]: Without dead ends: 850 [2019-12-18 14:00:37,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:00:37,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2019-12-18 14:00:37,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 663. [2019-12-18 14:00:37,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-12-18 14:00:37,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1530 transitions. [2019-12-18 14:00:37,205 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1530 transitions. Word has length 56 [2019-12-18 14:00:37,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:37,205 INFO L462 AbstractCegarLoop]: Abstraction has 663 states and 1530 transitions. [2019-12-18 14:00:37,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:00:37,205 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1530 transitions. [2019-12-18 14:00:37,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 14:00:37,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:37,208 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] [2019-12-18 14:00:37,208 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:37,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:37,208 INFO L82 PathProgramCache]: Analyzing trace with hash 684538364, now seen corresponding path program 2 times [2019-12-18 14:00:37,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:37,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376568542] [2019-12-18 14:00:37,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:37,318 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 14:00:37,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376568542] [2019-12-18 14:00:37,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:37,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:00:37,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723201553] [2019-12-18 14:00:37,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:00:37,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:37,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:00:37,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:00:37,320 INFO L87 Difference]: Start difference. First operand 663 states and 1530 transitions. Second operand 3 states. [2019-12-18 14:00:37,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:37,364 INFO L93 Difference]: Finished difference Result 662 states and 1528 transitions. [2019-12-18 14:00:37,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:00:37,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 14:00:37,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:37,366 INFO L225 Difference]: With dead ends: 662 [2019-12-18 14:00:37,366 INFO L226 Difference]: Without dead ends: 662 [2019-12-18 14:00:37,366 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 14:00:37,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-12-18 14:00:37,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 473. [2019-12-18 14:00:37,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-12-18 14:00:37,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1090 transitions. [2019-12-18 14:00:37,375 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1090 transitions. Word has length 56 [2019-12-18 14:00:37,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:37,375 INFO L462 AbstractCegarLoop]: Abstraction has 473 states and 1090 transitions. [2019-12-18 14:00:37,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:00:37,376 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1090 transitions. [2019-12-18 14:00:37,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 14:00:37,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:37,377 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:37,378 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:37,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:37,378 INFO L82 PathProgramCache]: Analyzing trace with hash 816342703, now seen corresponding path program 1 times [2019-12-18 14:00:37,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:37,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131124536] [2019-12-18 14:00:37,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:37,823 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 14:00:37,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131124536] [2019-12-18 14:00:37,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:37,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:00:37,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758553748] [2019-12-18 14:00:37,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:00:37,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:37,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:00:37,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:00:37,826 INFO L87 Difference]: Start difference. First operand 473 states and 1090 transitions. Second operand 12 states. [2019-12-18 14:00:38,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:38,466 INFO L93 Difference]: Finished difference Result 1088 states and 2214 transitions. [2019-12-18 14:00:38,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 14:00:38,467 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-18 14:00:38,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:38,468 INFO L225 Difference]: With dead ends: 1088 [2019-12-18 14:00:38,468 INFO L226 Difference]: Without dead ends: 578 [2019-12-18 14:00:38,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2019-12-18 14:00:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-12-18 14:00:38,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 411. [2019-12-18 14:00:38,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-12-18 14:00:38,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 911 transitions. [2019-12-18 14:00:38,477 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 911 transitions. Word has length 57 [2019-12-18 14:00:38,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:38,477 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 911 transitions. [2019-12-18 14:00:38,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:00:38,477 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 911 transitions. [2019-12-18 14:00:38,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 14:00:38,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:38,479 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:38,479 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:38,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:38,480 INFO L82 PathProgramCache]: Analyzing trace with hash 729563135, now seen corresponding path program 2 times [2019-12-18 14:00:38,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:38,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584075144] [2019-12-18 14:00:38,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:38,640 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 14:00:38,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584075144] [2019-12-18 14:00:38,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:38,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:00:38,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234758095] [2019-12-18 14:00:38,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:00:38,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:38,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:00:38,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:00:38,644 INFO L87 Difference]: Start difference. First operand 411 states and 911 transitions. Second operand 6 states. [2019-12-18 14:00:38,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:38,720 INFO L93 Difference]: Finished difference Result 644 states and 1366 transitions. [2019-12-18 14:00:38,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:00:38,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-18 14:00:38,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:38,721 INFO L225 Difference]: With dead ends: 644 [2019-12-18 14:00:38,722 INFO L226 Difference]: Without dead ends: 231 [2019-12-18 14:00:38,723 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 14:00:38,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-12-18 14:00:38,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 207. [2019-12-18 14:00:38,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-12-18 14:00:38,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 364 transitions. [2019-12-18 14:00:38,727 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 364 transitions. Word has length 57 [2019-12-18 14:00:38,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:38,727 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 364 transitions. [2019-12-18 14:00:38,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:00:38,727 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 364 transitions. [2019-12-18 14:00:38,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 14:00:38,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:38,728 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:38,728 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:38,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:38,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1516556909, now seen corresponding path program 3 times [2019-12-18 14:00:38,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:38,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978754632] [2019-12-18 14:00:38,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:38,960 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 14:00:38,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978754632] [2019-12-18 14:00:38,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:38,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:00:38,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155655478] [2019-12-18 14:00:38,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 14:00:38,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:38,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 14:00:38,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:00:38,962 INFO L87 Difference]: Start difference. First operand 207 states and 364 transitions. Second operand 13 states. [2019-12-18 14:00:39,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:39,519 INFO L93 Difference]: Finished difference Result 379 states and 652 transitions. [2019-12-18 14:00:39,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 14:00:39,519 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-18 14:00:39,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:39,520 INFO L225 Difference]: With dead ends: 379 [2019-12-18 14:00:39,520 INFO L226 Difference]: Without dead ends: 349 [2019-12-18 14:00:39,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-18 14:00:39,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-12-18 14:00:39,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 307. [2019-12-18 14:00:39,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-12-18 14:00:39,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 535 transitions. [2019-12-18 14:00:39,526 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 535 transitions. Word has length 57 [2019-12-18 14:00:39,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:39,526 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 535 transitions. [2019-12-18 14:00:39,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 14:00:39,527 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 535 transitions. [2019-12-18 14:00:39,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 14:00:39,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:39,528 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:39,528 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:39,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:39,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1834190715, now seen corresponding path program 4 times [2019-12-18 14:00:39,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:39,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437072112] [2019-12-18 14:00:39,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:40,103 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 14:00:40,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437072112] [2019-12-18 14:00:40,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:40,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 14:00:40,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055464608] [2019-12-18 14:00:40,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 14:00:40,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:40,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 14:00:40,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-18 14:00:40,105 INFO L87 Difference]: Start difference. First operand 307 states and 535 transitions. Second operand 21 states. [2019-12-18 14:00:41,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:41,656 INFO L93 Difference]: Finished difference Result 740 states and 1271 transitions. [2019-12-18 14:00:41,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 14:00:41,656 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2019-12-18 14:00:41,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:41,657 INFO L225 Difference]: With dead ends: 740 [2019-12-18 14:00:41,658 INFO L226 Difference]: Without dead ends: 710 [2019-12-18 14:00:41,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=294, Invalid=1428, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 14:00:41,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-12-18 14:00:41,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 323. [2019-12-18 14:00:41,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-12-18 14:00:41,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 566 transitions. [2019-12-18 14:00:41,666 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 566 transitions. Word has length 57 [2019-12-18 14:00:41,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:41,666 INFO L462 AbstractCegarLoop]: Abstraction has 323 states and 566 transitions. [2019-12-18 14:00:41,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 14:00:41,667 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 566 transitions. [2019-12-18 14:00:41,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 14:00:41,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:41,668 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:41,668 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:41,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:41,668 INFO L82 PathProgramCache]: Analyzing trace with hash 618212177, now seen corresponding path program 5 times [2019-12-18 14:00:41,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:41,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464605163] [2019-12-18 14:00:41,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:00:41,878 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 14:00:41,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464605163] [2019-12-18 14:00:41,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:00:41,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:00:41,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166424008] [2019-12-18 14:00:41,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:00:41,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:00:41,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:00:41,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:00:41,880 INFO L87 Difference]: Start difference. First operand 323 states and 566 transitions. Second operand 12 states. [2019-12-18 14:00:42,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:00:42,168 INFO L93 Difference]: Finished difference Result 423 states and 719 transitions. [2019-12-18 14:00:42,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:00:42,168 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-18 14:00:42,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:00:42,169 INFO L225 Difference]: With dead ends: 423 [2019-12-18 14:00:42,169 INFO L226 Difference]: Without dead ends: 393 [2019-12-18 14:00:42,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-12-18 14:00:42,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-12-18 14:00:42,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 315. [2019-12-18 14:00:42,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-12-18 14:00:42,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 549 transitions. [2019-12-18 14:00:42,175 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 549 transitions. Word has length 57 [2019-12-18 14:00:42,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:00:42,175 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 549 transitions. [2019-12-18 14:00:42,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:00:42,176 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 549 transitions. [2019-12-18 14:00:42,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 14:00:42,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:00:42,177 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:00:42,177 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:00:42,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:00:42,177 INFO L82 PathProgramCache]: Analyzing trace with hash 731376245, now seen corresponding path program 6 times [2019-12-18 14:00:42,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:00:42,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218329465] [2019-12-18 14:00:42,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:00:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:00:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:00:42,341 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:00:42,342 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:00:42,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1507~0.base_26|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1507~0.base_26|)) (= 0 v_~weak$$choice0~0_25) (= 0 v_~y$r_buff0_thd3~0_151) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1507~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1507~0.base_26|) |v_ULTIMATE.start_main_~#t1507~0.offset_19| 0)) |v_#memory_int_23|) (= v_~y$w_buff1~0_200 0) (= v_~y$w_buff0_used~0_650 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1507~0.base_26| 4)) (= v_~__unbuffered_cnt~0_109 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~y$w_buff0~0_308) (= 0 v_~y$r_buff1_thd3~0_122) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd1~0_76) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t1507~0.base_26| 1)) (= v_~z~0_51 0) (= v_~y$r_buff0_thd1~0_29 0) (= v_~main$tmp_guard1~0_28 0) (= v_~y$r_buff0_thd0~0_312 0) (= 0 v_~__unbuffered_p2_EAX~0_90) (= 0 v_~y$flush_delayed~0_45) (= v_~y$w_buff1_used~0_407 0) (= 0 |v_ULTIMATE.start_main_~#t1507~0.offset_19|) (= v_~y$r_buff0_thd2~0_88 0) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff1_thd2~0_131) (= v_~y$mem_tmp~0_31 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y~0_150 0) (= v_~weak$$choice2~0_131 0) (= v_~y$r_buff1_thd0~0_254 0) (= v_~main$tmp_guard0~0_24 0) (= 0 |v_#NULL.base_5|) (= v_~x~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_26|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_104|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_52|, ULTIMATE.start_main_~#t1507~0.base=|v_ULTIMATE.start_main_~#t1507~0.base_26|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_26|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_122, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_90, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_34|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_142|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_44|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_98|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_27|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ~weak$$choice0~0=v_~weak$$choice0~0_25, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ~y$w_buff1~0=v_~y$w_buff1~0_200, ULTIMATE.start_main_~#t1507~0.offset=|v_ULTIMATE.start_main_~#t1507~0.offset_19|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t1508~0.base=|v_ULTIMATE.start_main_~#t1508~0.base_26|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_88, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ~x~0=v_~x~0_80, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_650, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_38|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_31|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_28|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_32|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_16|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_58|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_76, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_44|, ~y$w_buff0~0=v_~y$w_buff0~0_308, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_151, ULTIMATE.start_main_~#t1508~0.offset=|v_ULTIMATE.start_main_~#t1508~0.offset_19|, ~y~0=v_~y~0_150, ULTIMATE.start_main_~#t1509~0.base=|v_ULTIMATE.start_main_~#t1509~0.base_21|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_44|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_26|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_96|, ULTIMATE.start_main_~#t1509~0.offset=|v_ULTIMATE.start_main_~#t1509~0.offset_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_31|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_131, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_312, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ~z~0=v_~z~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_131, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_407} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1507~0.base, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ULTIMATE.start_main_~#t1507~0.offset, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1508~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t1508~0.offset, ~y~0, ULTIMATE.start_main_~#t1509~0.base, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1509~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:00:42,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L800-1-->L802: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1508~0.base_13|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1508~0.base_13| 1)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1508~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1508~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1508~0.base_13|) |v_ULTIMATE.start_main_~#t1508~0.offset_11| 1)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1508~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t1508~0.offset_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1508~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1508~0.base=|v_ULTIMATE.start_main_~#t1508~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1508~0.offset=|v_ULTIMATE.start_main_~#t1508~0.offset_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1508~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1508~0.offset, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 14:00:42,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L802-1-->L804: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1509~0.base_12| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1509~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1509~0.base_12|) |v_ULTIMATE.start_main_~#t1509~0.offset_10| 2)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1509~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1509~0.base_12|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1509~0.base_12| 4)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1509~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t1509~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1509~0.offset=|v_ULTIMATE.start_main_~#t1509~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1509~0.base=|v_ULTIMATE.start_main_~#t1509~0.base_12|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1509~0.offset, #length, ULTIMATE.start_main_~#t1509~0.base] because there is no mapped edge [2019-12-18 14:00:42,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] P2ENTRY-->L4-3: Formula: (and (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= 2 v_~y$w_buff0~0_40) (= v_~y$w_buff0_used~0_161 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_32) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_12 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_P2Thread1of1ForFork0_~arg.base_8 |v_P2Thread1of1ForFork0_#in~arg.base_8|) (= (mod v_~y$w_buff1_used~0_89 256) 0) (= v_P2Thread1of1ForFork0_~arg.offset_8 |v_P2Thread1of1ForFork0_#in~arg.offset_8|) (= v_~y$w_buff1_used~0_89 v_~y$w_buff0_used~0_162)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_8|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_8, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_8|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_161, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_8, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_8|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_12, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:00:42,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_35 1) (= |v_P0Thread1of1ForFork1_#res.base_11| 0) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_21) (= v_P0Thread1of1ForFork1_~arg.offset_21 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_11|) (= v_~x~0_49 1) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_11|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_11|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~z~0=v_~z~0_35, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_49, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_21} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 14:00:42,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1091978949 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1091978949 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite11_Out-1091978949| ~y$w_buff0_used~0_In-1091978949)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite11_Out-1091978949| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1091978949, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1091978949} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1091978949, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-1091978949|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1091978949} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 14:00:42,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L748-2-->L748-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-652679437 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-652679437 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite3_Out-652679437| ~y~0_In-652679437) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out-652679437| ~y$w_buff1~0_In-652679437)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-652679437, ~y$w_buff1~0=~y$w_buff1~0_In-652679437, ~y~0=~y~0_In-652679437, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-652679437} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-652679437, ~y$w_buff1~0=~y$w_buff1~0_In-652679437, ~y~0=~y~0_In-652679437, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-652679437|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-652679437} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 14:00:42,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L748-4-->L749: Formula: (= |v_P1Thread1of1ForFork2_#t~ite3_12| v_~y~0_21) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_12|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_13|, ~y~0=v_~y~0_21, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 14:00:42,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L749-->L749-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1774140912 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1774140912 256) 0))) (or (and (= ~y$w_buff0_used~0_In1774140912 |P1Thread1of1ForFork2_#t~ite5_Out1774140912|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite5_Out1774140912| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1774140912, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1774140912} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1774140912, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1774140912, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out1774140912|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 14:00:42,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L750-->L750-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1250810143 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1250810143 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1250810143 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1250810143 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite6_Out-1250810143| 0)) (and (= |P1Thread1of1ForFork2_#t~ite6_Out-1250810143| ~y$w_buff1_used~0_In-1250810143) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1250810143, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1250810143, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1250810143, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1250810143} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1250810143, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1250810143, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1250810143, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-1250810143|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1250810143} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 14:00:42,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L751-->L751-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1789215141 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1789215141 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out-1789215141| 0)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-1789215141 |P1Thread1of1ForFork2_#t~ite7_Out-1789215141|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1789215141, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1789215141} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1789215141, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1789215141, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-1789215141|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 14:00:42,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1145716113 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1145716113 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In1145716113 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1145716113 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite12_Out1145716113| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite12_Out1145716113| ~y$w_buff1_used~0_In1145716113)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1145716113, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1145716113, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1145716113, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1145716113} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1145716113, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1145716113, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1145716113|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1145716113, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1145716113} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 14:00:42,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In1998139306 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1998139306 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In1998139306 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1998139306 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite8_Out1998139306| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite8_Out1998139306| ~y$r_buff1_thd2~0_In1998139306) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1998139306, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1998139306, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1998139306, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1998139306} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1998139306, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1998139306, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out1998139306|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1998139306, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1998139306} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 14:00:42,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L752-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite8_28| v_~y$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_56, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 14:00:42,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L780-->L781: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In396282251 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In396282251 256) 0))) (or (and (= ~y$r_buff0_thd3~0_In396282251 ~y$r_buff0_thd3~0_Out396282251) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 ~y$r_buff0_thd3~0_Out396282251)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In396282251, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In396282251} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In396282251, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out396282251, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out396282251|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 14:00:42,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L781-->L781-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1282643823 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1282643823 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1282643823 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1282643823 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite14_Out1282643823| ~y$r_buff1_thd3~0_In1282643823) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite14_Out1282643823|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1282643823, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1282643823, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1282643823, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1282643823} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out1282643823|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1282643823, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1282643823, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1282643823, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1282643823} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 14:00:42,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L781-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_40| v_~y$r_buff1_thd3~0_68) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_39|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_68, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 14:00:42,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L804-1-->L810: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 14:00:42,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L810-2-->L810-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In974534996 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In974534996 256)))) (or (and (= |ULTIMATE.start_main_#t~ite18_Out974534996| ~y~0_In974534996) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite18_Out974534996| ~y$w_buff1~0_In974534996) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In974534996, ~y~0=~y~0_In974534996, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In974534996, ~y$w_buff1_used~0=~y$w_buff1_used~0_In974534996} OutVars{~y$w_buff1~0=~y$w_buff1~0_In974534996, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out974534996|, ~y~0=~y~0_In974534996, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In974534996, ~y$w_buff1_used~0=~y$w_buff1_used~0_In974534996} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-18 14:00:42,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L810-4-->L811: Formula: (= v_~y~0_40 |v_ULTIMATE.start_main_#t~ite18_13|) InVars {ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|} OutVars{ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y~0] because there is no mapped edge [2019-12-18 14:00:42,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In739226199 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In739226199 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite20_Out739226199| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite20_Out739226199| ~y$w_buff0_used~0_In739226199) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In739226199, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In739226199} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In739226199, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In739226199, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out739226199|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 14:00:42,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1773466562 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1773466562 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1773466562 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1773466562 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-1773466562| ~y$w_buff1_used~0_In-1773466562) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite21_Out-1773466562| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1773466562, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1773466562, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1773466562, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1773466562} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1773466562, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1773466562, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1773466562|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1773466562, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1773466562} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 14:00:42,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1217489137 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1217489137 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out1217489137| ~y$r_buff0_thd0~0_In1217489137)) (and (= |ULTIMATE.start_main_#t~ite22_Out1217489137| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1217489137, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1217489137} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1217489137, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1217489137, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1217489137|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 14:00:42,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In-1722923843 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1722923843 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1722923843 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1722923843 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-1722923843 |ULTIMATE.start_main_#t~ite23_Out-1722923843|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite23_Out-1722923843|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1722923843, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1722923843, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1722923843, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1722923843} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1722923843, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1722923843, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1722923843, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1722923843|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1722923843} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 14:00:42,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L822-->L822-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In656798829 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In656798829 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In656798829 256)) .cse0) (and .cse0 (= 0 (mod ~y$r_buff1_thd0~0_In656798829 256))) (= (mod ~y$w_buff0_used~0_In656798829 256) 0))) (= ~y$w_buff0~0_In656798829 |ULTIMATE.start_main_#t~ite29_Out656798829|) (= |ULTIMATE.start_main_#t~ite30_Out656798829| |ULTIMATE.start_main_#t~ite29_Out656798829|) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite29_In656798829| |ULTIMATE.start_main_#t~ite29_Out656798829|) (= |ULTIMATE.start_main_#t~ite30_Out656798829| ~y$w_buff0~0_In656798829)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In656798829, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In656798829|, ~y$w_buff0~0=~y$w_buff0~0_In656798829, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In656798829, ~weak$$choice2~0=~weak$$choice2~0_In656798829, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In656798829, ~y$w_buff1_used~0=~y$w_buff1_used~0_In656798829} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out656798829|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In656798829, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out656798829|, ~y$w_buff0~0=~y$w_buff0~0_In656798829, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In656798829, ~weak$$choice2~0=~weak$$choice2~0_In656798829, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In656798829, ~y$w_buff1_used~0=~y$w_buff1_used~0_In656798829} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 14:00:42,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd0~0_86 v_~y$r_buff0_thd0~0_85)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_27, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 14:00:42,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L829-->L832-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_12 256)) (= v_~y~0_109 v_~y$mem_tmp~0_21) (not (= 0 (mod v_~y$flush_delayed~0_33 256))) (= 0 v_~y$flush_delayed~0_32)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_32, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_109, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:00:42,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 14:00:42,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:00:42 BasicIcfg [2019-12-18 14:00:42,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:00:42,506 INFO L168 Benchmark]: Toolchain (without parser) took 19996.88 ms. Allocated memory was 139.5 MB in the beginning and 827.9 MB in the end (delta: 688.4 MB). Free memory was 103.1 MB in the beginning and 357.7 MB in the end (delta: -254.6 MB). Peak memory consumption was 433.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:00:42,507 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 14:00:42,508 INFO L168 Benchmark]: CACSL2BoogieTranslator took 764.71 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.7 MB in the beginning and 157.8 MB in the end (delta: -55.0 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:00:42,508 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.89 ms. Allocated memory is still 203.9 MB. Free memory was 157.8 MB in the beginning and 155.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:00:42,512 INFO L168 Benchmark]: Boogie Preprocessor took 37.48 ms. Allocated memory is still 203.9 MB. Free memory was 155.0 MB in the beginning and 152.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:00:42,512 INFO L168 Benchmark]: RCFGBuilder took 837.98 ms. Allocated memory is still 203.9 MB. Free memory was 152.4 MB in the beginning and 106.0 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-12-18 14:00:42,513 INFO L168 Benchmark]: TraceAbstraction took 18268.10 ms. Allocated memory was 203.9 MB in the beginning and 827.9 MB in the end (delta: 623.9 MB). Free memory was 106.0 MB in the beginning and 357.7 MB in the end (delta: -251.8 MB). Peak memory consumption was 372.1 MB. Max. memory is 7.1 GB. [2019-12-18 14:00:42,517 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.53 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 764.71 ms. Allocated memory was 139.5 MB in the beginning and 203.9 MB in the end (delta: 64.5 MB). Free memory was 102.7 MB in the beginning and 157.8 MB in the end (delta: -55.0 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 82.89 ms. Allocated memory is still 203.9 MB. Free memory was 157.8 MB in the beginning and 155.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.48 ms. Allocated memory is still 203.9 MB. Free memory was 155.0 MB in the beginning and 152.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 837.98 ms. Allocated memory is still 203.9 MB. Free memory was 152.4 MB in the beginning and 106.0 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18268.10 ms. Allocated memory was 203.9 MB in the beginning and 827.9 MB in the end (delta: 623.9 MB). Free memory was 106.0 MB in the beginning and 357.7 MB in the end (delta: -251.8 MB). Peak memory consumption was 372.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 92 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 3955 VarBasedMoverChecksPositive, 193 VarBasedMoverChecksNegative, 45 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 48383 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1507, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1508, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1509, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L768] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L769] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L770] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L771] 3 y$r_buff0_thd3 = (_Bool)1 [L774] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] 2 x = 2 [L745] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L748] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 17.9s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1409 SDtfs, 1752 SDslu, 4216 SDs, 0 SdLazy, 2403 SolverSat, 147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 15 SyntacticMatches, 8 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22166occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 3896 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 637 NumberOfCodeBlocks, 637 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 566 ConstructedInterpolants, 0 QuantifiedInterpolants, 172504 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...