/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:56:44,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:56:44,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:56:44,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:56:44,324 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:56:44,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:56:44,328 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:56:44,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:56:44,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:56:44,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:56:44,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:56:44,348 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:56:44,349 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:56:44,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:56:44,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:56:44,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:56:44,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:56:44,353 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:56:44,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:56:44,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:56:44,361 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:56:44,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:56:44,366 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:56:44,367 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:56:44,369 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:56:44,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:56:44,370 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:56:44,371 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:56:44,371 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:56:44,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:56:44,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:56:44,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:56:44,374 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:56:44,375 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:56:44,376 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:56:44,376 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:56:44,376 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:56:44,377 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:56:44,377 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:56:44,378 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:56:44,378 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:56:44,379 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 22:56:44,393 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:56:44,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:56:44,395 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:56:44,395 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:56:44,395 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:56:44,396 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:56:44,396 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:56:44,396 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:56:44,396 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:56:44,396 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:56:44,397 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:56:44,397 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:56:44,397 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:56:44,397 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:56:44,397 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:56:44,398 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:56:44,398 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:56:44,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:56:44,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:56:44,398 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:56:44,398 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:56:44,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:56:44,399 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:56:44,399 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:56:44,399 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:56:44,399 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:56:44,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:56:44,400 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:56:44,400 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:56:44,400 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:56:44,400 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:56:44,401 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:56:44,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:56:44,698 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:56:44,702 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:56:44,703 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:56:44,703 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:56:44,704 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i [2019-12-27 22:56:44,765 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2c621714/b3c553b769a3482fb778e48998d1164f/FLAG78b96c428 [2019-12-27 22:56:45,324 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:56:45,325 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i [2019-12-27 22:56:45,339 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2c621714/b3c553b769a3482fb778e48998d1164f/FLAG78b96c428 [2019-12-27 22:56:45,576 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2c621714/b3c553b769a3482fb778e48998d1164f [2019-12-27 22:56:45,585 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:56:45,587 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:56:45,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:56:45,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:56:45,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:56:45,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:56:45" (1/1) ... [2019-12-27 22:56:45,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1709cc9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:45, skipping insertion in model container [2019-12-27 22:56:45,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:56:45" (1/1) ... [2019-12-27 22:56:45,606 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:56:45,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:56:46,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:56:46,207 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:56:46,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:56:46,362 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:56:46,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:46 WrapperNode [2019-12-27 22:56:46,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:56:46,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:56:46,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:56:46,363 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:56:46,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:46" (1/1) ... [2019-12-27 22:56:46,393 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:46" (1/1) ... [2019-12-27 22:56:46,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:56:46,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:56:46,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:56:46,433 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:56:46,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:46" (1/1) ... [2019-12-27 22:56:46,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:46" (1/1) ... [2019-12-27 22:56:46,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:46" (1/1) ... [2019-12-27 22:56:46,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:46" (1/1) ... [2019-12-27 22:56:46,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:46" (1/1) ... [2019-12-27 22:56:46,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:46" (1/1) ... [2019-12-27 22:56:46,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:46" (1/1) ... [2019-12-27 22:56:46,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:56:46,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:56:46,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:56:46,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:56:46,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:46" (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-27 22:56:46,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:56:46,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:56:46,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:56:46,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:56:46,547 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:56:46,547 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:56:46,547 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:56:46,548 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:56:46,548 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:56:46,548 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:56:46,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:56:46,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:56:46,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:56:46,551 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 22:56:47,276 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:56:47,276 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:56:47,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:56:47 BoogieIcfgContainer [2019-12-27 22:56:47,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:56:47,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:56:47,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:56:47,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:56:47,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:56:45" (1/3) ... [2019-12-27 22:56:47,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54a9e1be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:56:47, skipping insertion in model container [2019-12-27 22:56:47,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:56:46" (2/3) ... [2019-12-27 22:56:47,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54a9e1be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:56:47, skipping insertion in model container [2019-12-27 22:56:47,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:56:47" (3/3) ... [2019-12-27 22:56:47,287 INFO L109 eAbstractionObserver]: Analyzing ICFG safe030_power.opt.i [2019-12-27 22:56:47,297 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:56:47,298 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:56:47,306 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:56:47,307 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:56:47,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,343 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,344 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,346 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,346 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,354 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,355 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,355 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,355 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,355 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,356 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,356 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,367 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,368 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,369 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,373 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,373 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,376 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,377 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:56:47,410 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:56:47,433 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:56:47,433 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:56:47,434 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:56:47,438 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:56:47,438 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:56:47,438 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:56:47,438 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:56:47,441 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:56:47,459 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 192 transitions [2019-12-27 22:56:47,460 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 161 places, 192 transitions [2019-12-27 22:56:47,570 INFO L132 PetriNetUnfolder]: 41/189 cut-off events. [2019-12-27 22:56:47,570 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:56:47,584 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 41/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 259 event pairs. 0/146 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:56:47,601 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 161 places, 192 transitions [2019-12-27 22:56:47,683 INFO L132 PetriNetUnfolder]: 41/189 cut-off events. [2019-12-27 22:56:47,683 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:56:47,689 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 41/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 259 event pairs. 0/146 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:56:47,703 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 22:56:47,705 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:56:50,819 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 22:56:50,923 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 22:56:50,945 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47769 [2019-12-27 22:56:50,945 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 22:56:50,948 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 88 transitions [2019-12-27 22:56:51,806 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16048 states. [2019-12-27 22:56:51,808 INFO L276 IsEmpty]: Start isEmpty. Operand 16048 states. [2019-12-27 22:56:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 22:56:51,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:51,814 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:51,815 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-27 22:56:51,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:51,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2062442641, now seen corresponding path program 1 times [2019-12-27 22:56:51,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:51,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475410583] [2019-12-27 22:56:51,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:52,130 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-27 22:56:52,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475410583] [2019-12-27 22:56:52,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:52,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:56:52,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1425915561] [2019-12-27 22:56:52,135 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:52,141 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:52,156 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 22:56:52,156 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:52,160 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:56:52,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:56:52,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:52,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:56:52,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:56:52,245 INFO L87 Difference]: Start difference. First operand 16048 states. Second operand 3 states. [2019-12-27 22:56:52,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:52,677 INFO L93 Difference]: Finished difference Result 15976 states and 59309 transitions. [2019-12-27 22:56:52,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:56:52,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 22:56:52,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:52,916 INFO L225 Difference]: With dead ends: 15976 [2019-12-27 22:56:52,917 INFO L226 Difference]: Without dead ends: 15638 [2019-12-27 22:56:52,921 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-27 22:56:53,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15638 states. [2019-12-27 22:56:53,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15638 to 15638. [2019-12-27 22:56:53,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15638 states. [2019-12-27 22:56:53,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15638 states to 15638 states and 58100 transitions. [2019-12-27 22:56:53,792 INFO L78 Accepts]: Start accepts. Automaton has 15638 states and 58100 transitions. Word has length 7 [2019-12-27 22:56:53,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:53,793 INFO L462 AbstractCegarLoop]: Abstraction has 15638 states and 58100 transitions. [2019-12-27 22:56:53,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:56:53,794 INFO L276 IsEmpty]: Start isEmpty. Operand 15638 states and 58100 transitions. [2019-12-27 22:56:53,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:56:53,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:53,807 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:53,807 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-27 22:56:53,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:53,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1739907337, now seen corresponding path program 1 times [2019-12-27 22:56:53,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:53,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000472886] [2019-12-27 22:56:53,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:53,943 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-27 22:56:53,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000472886] [2019-12-27 22:56:53,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:53,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:56:53,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1207581087] [2019-12-27 22:56:53,945 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:53,946 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:53,952 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 37 transitions. [2019-12-27 22:56:53,952 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:53,992 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:56:53,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:56:53,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:53,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:56:53,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:56:53,994 INFO L87 Difference]: Start difference. First operand 15638 states and 58100 transitions. Second operand 5 states. [2019-12-27 22:56:55,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:55,468 INFO L93 Difference]: Finished difference Result 24994 states and 89270 transitions. [2019-12-27 22:56:55,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:56:55,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 22:56:55,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:55,582 INFO L225 Difference]: With dead ends: 24994 [2019-12-27 22:56:55,582 INFO L226 Difference]: Without dead ends: 24980 [2019-12-27 22:56:55,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:56:55,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24980 states. [2019-12-27 22:56:56,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24980 to 22308. [2019-12-27 22:56:56,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22308 states. [2019-12-27 22:56:56,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22308 states to 22308 states and 80649 transitions. [2019-12-27 22:56:56,422 INFO L78 Accepts]: Start accepts. Automaton has 22308 states and 80649 transitions. Word has length 13 [2019-12-27 22:56:56,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:56,423 INFO L462 AbstractCegarLoop]: Abstraction has 22308 states and 80649 transitions. [2019-12-27 22:56:56,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:56:56,423 INFO L276 IsEmpty]: Start isEmpty. Operand 22308 states and 80649 transitions. [2019-12-27 22:56:56,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:56:56,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:56,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:56,425 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-27 22:56:56,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:56,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1595374669, now seen corresponding path program 1 times [2019-12-27 22:56:56,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:56,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675270237] [2019-12-27 22:56:56,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:56,460 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-27 22:56:56,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675270237] [2019-12-27 22:56:56,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:56,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:56:56,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1553016505] [2019-12-27 22:56:56,461 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:56,462 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:56,464 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:56:56,464 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:56,465 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:56:56,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:56:56,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:56,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:56:56,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:56:56,466 INFO L87 Difference]: Start difference. First operand 22308 states and 80649 transitions. Second operand 3 states. [2019-12-27 22:56:56,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:56,736 INFO L93 Difference]: Finished difference Result 12738 states and 39797 transitions. [2019-12-27 22:56:56,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:56:56,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 22:56:56,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:56,784 INFO L225 Difference]: With dead ends: 12738 [2019-12-27 22:56:56,785 INFO L226 Difference]: Without dead ends: 12738 [2019-12-27 22:56:56,785 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-27 22:56:56,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12738 states. [2019-12-27 22:56:57,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12738 to 12738. [2019-12-27 22:56:57,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12738 states. [2019-12-27 22:56:57,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12738 states to 12738 states and 39797 transitions. [2019-12-27 22:56:57,181 INFO L78 Accepts]: Start accepts. Automaton has 12738 states and 39797 transitions. Word has length 13 [2019-12-27 22:56:57,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:57,181 INFO L462 AbstractCegarLoop]: Abstraction has 12738 states and 39797 transitions. [2019-12-27 22:56:57,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:56:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 12738 states and 39797 transitions. [2019-12-27 22:56:57,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:56:57,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:57,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:57,183 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-27 22:56:57,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:57,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1225120988, now seen corresponding path program 1 times [2019-12-27 22:56:57,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:57,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331946603] [2019-12-27 22:56:57,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:57,284 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-27 22:56:57,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331946603] [2019-12-27 22:56:57,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:57,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:56:57,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1485860234] [2019-12-27 22:56:57,285 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:57,286 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:57,288 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 22:56:57,288 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:57,304 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:56:57,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:56:57,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:57,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:56:57,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:56:57,307 INFO L87 Difference]: Start difference. First operand 12738 states and 39797 transitions. Second operand 5 states. [2019-12-27 22:56:57,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:57,346 INFO L93 Difference]: Finished difference Result 1939 states and 4475 transitions. [2019-12-27 22:56:57,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:56:57,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:56:57,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:57,358 INFO L225 Difference]: With dead ends: 1939 [2019-12-27 22:56:57,358 INFO L226 Difference]: Without dead ends: 1939 [2019-12-27 22:56:57,359 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-27 22:56:57,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-12-27 22:56:57,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1939. [2019-12-27 22:56:57,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2019-12-27 22:56:57,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 4475 transitions. [2019-12-27 22:56:57,394 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 4475 transitions. Word has length 14 [2019-12-27 22:56:57,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:57,394 INFO L462 AbstractCegarLoop]: Abstraction has 1939 states and 4475 transitions. [2019-12-27 22:56:57,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:56:57,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 4475 transitions. [2019-12-27 22:56:57,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 22:56:57,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:57,397 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-27 22:56:57,397 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-27 22:56:57,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:57,397 INFO L82 PathProgramCache]: Analyzing trace with hash 509934292, now seen corresponding path program 1 times [2019-12-27 22:56:57,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:57,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466098781] [2019-12-27 22:56:57,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:57,484 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-27 22:56:57,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466098781] [2019-12-27 22:56:57,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:57,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:56:57,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [884094472] [2019-12-27 22:56:57,485 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:57,489 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:57,506 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 170 transitions. [2019-12-27 22:56:57,506 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:57,544 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:56:57,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:56:57,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:57,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:56:57,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:56:57,545 INFO L87 Difference]: Start difference. First operand 1939 states and 4475 transitions. Second operand 7 states. [2019-12-27 22:56:57,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:57,581 INFO L93 Difference]: Finished difference Result 670 states and 1573 transitions. [2019-12-27 22:56:57,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:56:57,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-12-27 22:56:57,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:57,584 INFO L225 Difference]: With dead ends: 670 [2019-12-27 22:56:57,584 INFO L226 Difference]: Without dead ends: 670 [2019-12-27 22:56:57,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:56:57,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-12-27 22:56:57,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 600. [2019-12-27 22:56:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-12-27 22:56:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1408 transitions. [2019-12-27 22:56:57,596 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1408 transitions. Word has length 26 [2019-12-27 22:56:57,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:57,596 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 1408 transitions. [2019-12-27 22:56:57,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:56:57,597 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1408 transitions. [2019-12-27 22:56:57,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:56:57,599 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:57,599 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:56:57,599 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-27 22:56:57,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:57,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1992668075, now seen corresponding path program 1 times [2019-12-27 22:56:57,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:57,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123755461] [2019-12-27 22:56:57,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:57,683 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-27 22:56:57,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123755461] [2019-12-27 22:56:57,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:57,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:56:57,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1488508384] [2019-12-27 22:56:57,685 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:57,862 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:57,960 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 140 states and 204 transitions. [2019-12-27 22:56:57,961 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:57,962 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:56:57,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:56:57,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:57,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:56:57,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:56:57,963 INFO L87 Difference]: Start difference. First operand 600 states and 1408 transitions. Second operand 3 states. [2019-12-27 22:56:58,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:58,009 INFO L93 Difference]: Finished difference Result 612 states and 1424 transitions. [2019-12-27 22:56:58,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:56:58,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 22:56:58,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:58,012 INFO L225 Difference]: With dead ends: 612 [2019-12-27 22:56:58,012 INFO L226 Difference]: Without dead ends: 612 [2019-12-27 22:56:58,013 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-27 22:56:58,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-12-27 22:56:58,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 606. [2019-12-27 22:56:58,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-12-27 22:56:58,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1418 transitions. [2019-12-27 22:56:58,023 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1418 transitions. Word has length 55 [2019-12-27 22:56:58,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:58,023 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 1418 transitions. [2019-12-27 22:56:58,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:56:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1418 transitions. [2019-12-27 22:56:58,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:56:58,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:58,025 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-27 22:56:58,026 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-27 22:56:58,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:58,026 INFO L82 PathProgramCache]: Analyzing trace with hash 411437521, now seen corresponding path program 1 times [2019-12-27 22:56:58,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:58,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591565667] [2019-12-27 22:56:58,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:58,227 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-27 22:56:58,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591565667] [2019-12-27 22:56:58,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:58,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:56:58,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1682524277] [2019-12-27 22:56:58,228 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:58,249 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:58,345 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 140 states and 204 transitions. [2019-12-27 22:56:58,345 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:58,755 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:56:58,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:56:58,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:58,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:56:58,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:56:58,757 INFO L87 Difference]: Start difference. First operand 606 states and 1418 transitions. Second operand 6 states. [2019-12-27 22:56:59,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:56:59,100 INFO L93 Difference]: Finished difference Result 959 states and 2236 transitions. [2019-12-27 22:56:59,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 22:56:59,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-27 22:56:59,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:56:59,104 INFO L225 Difference]: With dead ends: 959 [2019-12-27 22:56:59,105 INFO L226 Difference]: Without dead ends: 959 [2019-12-27 22:56:59,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:56:59,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2019-12-27 22:56:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 764. [2019-12-27 22:56:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2019-12-27 22:56:59,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1797 transitions. [2019-12-27 22:56:59,120 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1797 transitions. Word has length 55 [2019-12-27 22:56:59,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:56:59,121 INFO L462 AbstractCegarLoop]: Abstraction has 764 states and 1797 transitions. [2019-12-27 22:56:59,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:56:59,121 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1797 transitions. [2019-12-27 22:56:59,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:56:59,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:56:59,123 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-27 22:56:59,123 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-27 22:56:59,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:56:59,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1705593493, now seen corresponding path program 2 times [2019-12-27 22:56:59,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:56:59,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304927970] [2019-12-27 22:56:59,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:56:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:56:59,242 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-27 22:56:59,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304927970] [2019-12-27 22:56:59,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:56:59,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:56:59,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1305190678] [2019-12-27 22:56:59,244 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:56:59,272 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:56:59,374 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 193 transitions. [2019-12-27 22:56:59,375 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:56:59,471 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 22:56:59,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:56:59,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:56:59,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:56:59,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:56:59,472 INFO L87 Difference]: Start difference. First operand 764 states and 1797 transitions. Second operand 10 states. [2019-12-27 22:57:00,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:57:00,574 INFO L93 Difference]: Finished difference Result 1779 states and 3962 transitions. [2019-12-27 22:57:00,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 22:57:00,575 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-12-27 22:57:00,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:57:00,578 INFO L225 Difference]: With dead ends: 1779 [2019-12-27 22:57:00,578 INFO L226 Difference]: Without dead ends: 1779 [2019-12-27 22:57:00,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2019-12-27 22:57:00,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2019-12-27 22:57:00,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 842. [2019-12-27 22:57:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2019-12-27 22:57:00,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1994 transitions. [2019-12-27 22:57:00,603 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1994 transitions. Word has length 55 [2019-12-27 22:57:00,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:57:00,603 INFO L462 AbstractCegarLoop]: Abstraction has 842 states and 1994 transitions. [2019-12-27 22:57:00,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:57:00,603 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1994 transitions. [2019-12-27 22:57:00,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 22:57:00,605 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:57:00,605 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-27 22:57:00,606 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-27 22:57:00,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:57:00,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1720718779, now seen corresponding path program 3 times [2019-12-27 22:57:00,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:57:00,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920057561] [2019-12-27 22:57:00,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:57:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:57:00,759 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-27 22:57:00,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920057561] [2019-12-27 22:57:00,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:57:00,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:57:00,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1038211330] [2019-12-27 22:57:00,760 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:57:00,783 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:57:00,888 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 139 states and 202 transitions. [2019-12-27 22:57:00,888 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:57:00,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:57:01,003 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 22:57:01,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 22:57:01,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:57:01,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 22:57:01,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:57:01,004 INFO L87 Difference]: Start difference. First operand 842 states and 1994 transitions. Second operand 13 states. [2019-12-27 22:57:02,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:57:02,458 INFO L93 Difference]: Finished difference Result 1208 states and 2600 transitions. [2019-12-27 22:57:02,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 22:57:02,459 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-12-27 22:57:02,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:57:02,461 INFO L225 Difference]: With dead ends: 1208 [2019-12-27 22:57:02,461 INFO L226 Difference]: Without dead ends: 1208 [2019-12-27 22:57:02,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=520, Unknown=0, NotChecked=0, Total=702 [2019-12-27 22:57:02,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2019-12-27 22:57:02,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 696. [2019-12-27 22:57:02,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-12-27 22:57:02,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1599 transitions. [2019-12-27 22:57:02,480 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1599 transitions. Word has length 55 [2019-12-27 22:57:02,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:57:02,480 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 1599 transitions. [2019-12-27 22:57:02,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 22:57:02,481 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1599 transitions. [2019-12-27 22:57:02,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:57:02,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:57:02,483 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-27 22:57:02,483 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-27 22:57:02,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:57:02,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1727504643, now seen corresponding path program 1 times [2019-12-27 22:57:02,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:57:02,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308621507] [2019-12-27 22:57:02,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:57:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:57:02,606 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-27 22:57:02,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308621507] [2019-12-27 22:57:02,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:57:02,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:57:02,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1343291026] [2019-12-27 22:57:02,607 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:57:02,623 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:57:02,730 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 203 transitions. [2019-12-27 22:57:02,730 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:57:02,732 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:57:02,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:57:02,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:57:02,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:57:02,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:57:02,733 INFO L87 Difference]: Start difference. First operand 696 states and 1599 transitions. Second operand 5 states. [2019-12-27 22:57:02,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:57:02,774 INFO L93 Difference]: Finished difference Result 994 states and 2130 transitions. [2019-12-27 22:57:02,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:57:02,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 22:57:02,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:57:02,777 INFO L225 Difference]: With dead ends: 994 [2019-12-27 22:57:02,777 INFO L226 Difference]: Without dead ends: 625 [2019-12-27 22:57:02,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:57:02,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-12-27 22:57:02,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2019-12-27 22:57:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-12-27 22:57:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 1393 transitions. [2019-12-27 22:57:02,789 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 1393 transitions. Word has length 56 [2019-12-27 22:57:02,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:57:02,789 INFO L462 AbstractCegarLoop]: Abstraction has 625 states and 1393 transitions. [2019-12-27 22:57:02,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:57:02,789 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 1393 transitions. [2019-12-27 22:57:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:57:02,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:57:02,791 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:57:02,791 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-27 22:57:02,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:57:02,792 INFO L82 PathProgramCache]: Analyzing trace with hash 584948251, now seen corresponding path program 2 times [2019-12-27 22:57:02,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:57:02,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643078600] [2019-12-27 22:57:02,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:57:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:57:02,871 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-27 22:57:02,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643078600] [2019-12-27 22:57:02,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:57:02,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:57:02,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1277357783] [2019-12-27 22:57:02,873 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:57:02,908 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:57:02,980 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 239 transitions. [2019-12-27 22:57:02,980 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:57:02,995 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:57:02,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:57:02,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:57:02,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:57:02,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:57:02,997 INFO L87 Difference]: Start difference. First operand 625 states and 1393 transitions. Second operand 5 states. [2019-12-27 22:57:03,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:57:03,156 INFO L93 Difference]: Finished difference Result 753 states and 1651 transitions. [2019-12-27 22:57:03,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:57:03,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-27 22:57:03,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:57:03,158 INFO L225 Difference]: With dead ends: 753 [2019-12-27 22:57:03,158 INFO L226 Difference]: Without dead ends: 753 [2019-12-27 22:57:03,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:57:03,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-12-27 22:57:03,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 607. [2019-12-27 22:57:03,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-12-27 22:57:03,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1340 transitions. [2019-12-27 22:57:03,172 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 1340 transitions. Word has length 56 [2019-12-27 22:57:03,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:57:03,172 INFO L462 AbstractCegarLoop]: Abstraction has 607 states and 1340 transitions. [2019-12-27 22:57:03,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:57:03,172 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1340 transitions. [2019-12-27 22:57:03,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:57:03,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:57:03,174 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-27 22:57:03,174 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-27 22:57:03,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:57:03,175 INFO L82 PathProgramCache]: Analyzing trace with hash 281240766, now seen corresponding path program 1 times [2019-12-27 22:57:03,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:57:03,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807653538] [2019-12-27 22:57:03,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:57:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:57:03,238 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-27 22:57:03,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807653538] [2019-12-27 22:57:03,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:57:03,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:57:03,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1479902534] [2019-12-27 22:57:03,239 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:57:03,262 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:57:03,376 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 205 transitions. [2019-12-27 22:57:03,376 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:57:03,377 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:57:03,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:57:03,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:57:03,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:57:03,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:57:03,378 INFO L87 Difference]: Start difference. First operand 607 states and 1340 transitions. Second operand 3 states. [2019-12-27 22:57:03,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:57:03,442 INFO L93 Difference]: Finished difference Result 607 states and 1339 transitions. [2019-12-27 22:57:03,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:57:03,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 22:57:03,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:57:03,444 INFO L225 Difference]: With dead ends: 607 [2019-12-27 22:57:03,444 INFO L226 Difference]: Without dead ends: 607 [2019-12-27 22:57:03,445 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-27 22:57:03,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-12-27 22:57:03,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 434. [2019-12-27 22:57:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-12-27 22:57:03,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 945 transitions. [2019-12-27 22:57:03,454 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 945 transitions. Word has length 56 [2019-12-27 22:57:03,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:57:03,455 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 945 transitions. [2019-12-27 22:57:03,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:57:03,455 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 945 transitions. [2019-12-27 22:57:03,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 22:57:03,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:57:03,457 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-27 22:57:03,457 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-27 22:57:03,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:57:03,457 INFO L82 PathProgramCache]: Analyzing trace with hash -265184758, now seen corresponding path program 1 times [2019-12-27 22:57:03,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:57:03,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293021035] [2019-12-27 22:57:03,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:57:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:57:03,620 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-27 22:57:03,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293021035] [2019-12-27 22:57:03,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:57:03,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:57:03,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [248281592] [2019-12-27 22:57:03,621 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:57:03,654 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:57:03,844 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 243 transitions. [2019-12-27 22:57:03,844 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:57:03,864 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:57:03,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:57:03,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:57:03,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:57:03,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:57:03,866 INFO L87 Difference]: Start difference. First operand 434 states and 945 transitions. Second operand 7 states. [2019-12-27 22:57:04,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:57:04,140 INFO L93 Difference]: Finished difference Result 797 states and 1688 transitions. [2019-12-27 22:57:04,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 22:57:04,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 22:57:04,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:57:04,143 INFO L225 Difference]: With dead ends: 797 [2019-12-27 22:57:04,143 INFO L226 Difference]: Without dead ends: 286 [2019-12-27 22:57:04,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:57:04,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-12-27 22:57:04,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 207. [2019-12-27 22:57:04,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-12-27 22:57:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 355 transitions. [2019-12-27 22:57:04,152 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 355 transitions. Word has length 57 [2019-12-27 22:57:04,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:57:04,152 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 355 transitions. [2019-12-27 22:57:04,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:57:04,152 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 355 transitions. [2019-12-27 22:57:04,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 22:57:04,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:57:04,154 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-27 22:57:04,155 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-27 22:57:04,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:57:04,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1560317592, now seen corresponding path program 2 times [2019-12-27 22:57:04,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:57:04,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787301537] [2019-12-27 22:57:04,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:57:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:57:04,460 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-27 22:57:04,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787301537] [2019-12-27 22:57:04,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:57:04,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 22:57:04,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [63433163] [2019-12-27 22:57:04,461 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:57:04,477 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:57:04,574 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 218 transitions. [2019-12-27 22:57:04,574 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:57:04,661 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 22:57:04,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:57:04,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:57:04,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:57:04,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:57:04,663 INFO L87 Difference]: Start difference. First operand 207 states and 355 transitions. Second operand 15 states. [2019-12-27 22:57:06,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:57:06,418 INFO L93 Difference]: Finished difference Result 498 states and 822 transitions. [2019-12-27 22:57:06,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 22:57:06,418 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2019-12-27 22:57:06,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:57:06,419 INFO L225 Difference]: With dead ends: 498 [2019-12-27 22:57:06,420 INFO L226 Difference]: Without dead ends: 467 [2019-12-27 22:57:06,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=316, Invalid=1406, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 22:57:06,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-12-27 22:57:06,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 307. [2019-12-27 22:57:06,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-12-27 22:57:06,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 526 transitions. [2019-12-27 22:57:06,428 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 526 transitions. Word has length 57 [2019-12-27 22:57:06,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:57:06,428 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 526 transitions. [2019-12-27 22:57:06,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:57:06,428 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 526 transitions. [2019-12-27 22:57:06,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 22:57:06,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:57:06,429 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-27 22:57:06,430 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-27 22:57:06,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:57:06,430 INFO L82 PathProgramCache]: Analyzing trace with hash -438640254, now seen corresponding path program 3 times [2019-12-27 22:57:06,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:57:06,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140785971] [2019-12-27 22:57:06,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:57:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:57:06,898 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-27 22:57:06,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140785971] [2019-12-27 22:57:06,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:57:06,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 22:57:06,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [555564409] [2019-12-27 22:57:06,899 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:57:06,919 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:57:07,009 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 123 states and 164 transitions. [2019-12-27 22:57:07,010 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:57:07,024 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:57:07,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 22:57:07,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:57:07,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 22:57:07,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-27 22:57:07,025 INFO L87 Difference]: Start difference. First operand 307 states and 526 transitions. Second operand 14 states. [2019-12-27 22:57:07,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:57:07,536 INFO L93 Difference]: Finished difference Result 416 states and 694 transitions. [2019-12-27 22:57:07,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 22:57:07,536 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-27 22:57:07,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:57:07,537 INFO L225 Difference]: With dead ends: 416 [2019-12-27 22:57:07,537 INFO L226 Difference]: Without dead ends: 385 [2019-12-27 22:57:07,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2019-12-27 22:57:07,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-12-27 22:57:07,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 315. [2019-12-27 22:57:07,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-12-27 22:57:07,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 540 transitions. [2019-12-27 22:57:07,545 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 540 transitions. Word has length 57 [2019-12-27 22:57:07,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:57:07,545 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 540 transitions. [2019-12-27 22:57:07,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 22:57:07,545 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 540 transitions. [2019-12-27 22:57:07,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 22:57:07,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:57:07,546 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-27 22:57:07,547 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:57:07,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:57:07,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1131378088, now seen corresponding path program 4 times [2019-12-27 22:57:07,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:57:07,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398717746] [2019-12-27 22:57:07,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:57:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:57:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:57:07,667 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:57:07,669 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:57:07,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] ULTIMATE.startENTRY-->L798: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$r_buff0_thd1~0_7 0) (= v_~x~0_11 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$r_buff1_thd3~0_15) (= v_~y~0_25 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2492~0.base_27|) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= v_~y$r_buff0_thd3~0_23 0) (= 0 v_~weak$$choice2~0_34) (= v_~y$read_delayed~0_6 0) (= v_~y$mem_tmp~0_11 0) (= 0 v_~y$w_buff0~0_29) (= v_~y$r_buff1_thd1~0_8 0) (< 0 |v_#StackHeapBarrier_18|) (= (store .cse0 |v_ULTIMATE.start_main_~#t2492~0.base_27| 1) |v_#valid_59|) (= v_~y$w_buff1_used~0_68 0) (= 0 v_~y$r_buff1_thd0~0_50) (= v_~y$r_buff0_thd0~0_77 0) (= |v_#NULL.offset_5| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2492~0.base_27|)) (= v_~y$w_buff0_used~0_105 0) (= v_~y$r_buff0_thd2~0_18 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t2492~0.base_27| 4) |v_#length_25|) (= 0 v_~__unbuffered_cnt~0_22) (= 0 |v_ULTIMATE.start_main_~#t2492~0.offset_20|) (= v_~main$tmp_guard1~0_10 0) (= v_~z~0_12 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_16) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_16) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2492~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2492~0.base_27|) |v_ULTIMATE.start_main_~#t2492~0.offset_20| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_14|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_13|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ULTIMATE.start_main_~#t2494~0.base=|v_ULTIMATE.start_main_~#t2494~0.base_20|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_25|, ULTIMATE.start_main_~#t2494~0.offset=|v_ULTIMATE.start_main_~#t2494~0.offset_16|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_9|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_~#t2493~0.offset=|v_ULTIMATE.start_main_~#t2493~0.offset_17|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_15|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_18, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ULTIMATE.start_main_~#t2492~0.offset=|v_ULTIMATE.start_main_~#t2492~0.offset_20|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_50, ~x~0=v_~x~0_11, ~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_105, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_17|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_~#t2493~0.base=|v_ULTIMATE.start_main_~#t2493~0.base_20|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_15|, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_23, ~y~0=v_~y~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_13|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_16|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ULTIMATE.start_main_~#t2492~0.base=|v_ULTIMATE.start_main_~#t2492~0.base_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_77, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_12, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} 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_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t2494~0.base, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t2494~0.offset, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t2493~0.offset, 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, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t2492~0.offset, 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_~#t2493~0.base, 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, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t2492~0.base, ~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-27 22:57:07,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L798-1-->L800: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2493~0.base_9| 4)) (= |v_ULTIMATE.start_main_~#t2493~0.offset_9| 0) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2493~0.base_9| 1)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2493~0.base_9| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2493~0.base_9|) |v_ULTIMATE.start_main_~#t2493~0.offset_9| 1))) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2493~0.base_9|)) (not (= |v_ULTIMATE.start_main_~#t2493~0.base_9| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2493~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2493~0.offset=|v_ULTIMATE.start_main_~#t2493~0.offset_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2493~0.base=|v_ULTIMATE.start_main_~#t2493~0.base_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2493~0.offset, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t2493~0.base] because there is no mapped edge [2019-12-27 22:57:07,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L800-1-->L802: Formula: (and (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2494~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2494~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2494~0.base_10|) |v_ULTIMATE.start_main_~#t2494~0.offset_9| 2)) |v_#memory_int_11|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2494~0.base_10| 1) |v_#valid_31|) (not (= 0 |v_ULTIMATE.start_main_~#t2494~0.base_10|)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2494~0.base_10| 4) |v_#length_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2494~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t2494~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2494~0.base=|v_ULTIMATE.start_main_~#t2494~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2494~0.offset=|v_ULTIMATE.start_main_~#t2494~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2494~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t2494~0.offset] because there is no mapped edge [2019-12-27 22:57:07,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] P2ENTRY-->L4-3: Formula: (and (= |P2Thread1of1ForFork0_#in~arg.offset_In-460150441| P2Thread1of1ForFork0_~arg.offset_Out-460150441) (= 1 ~y$w_buff0_used~0_Out-460150441) (= ~y$w_buff1_used~0_Out-460150441 ~y$w_buff0_used~0_In-460150441) (= (mod ~y$w_buff1_used~0_Out-460150441 256) 0) (= P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out-460150441 |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-460150441|) (= 1 |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-460150441|) (= ~y$w_buff0~0_Out-460150441 2) (= P2Thread1of1ForFork0_~arg.base_Out-460150441 |P2Thread1of1ForFork0_#in~arg.base_In-460150441|) (= ~y$w_buff0~0_In-460150441 ~y$w_buff1~0_Out-460150441)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In-460150441|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-460150441, ~y$w_buff0~0=~y$w_buff0~0_In-460150441, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In-460150441|} OutVars{P2Thread1of1ForFork0_~arg.base=P2Thread1of1ForFork0_~arg.base_Out-460150441, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-460150441|, P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In-460150441|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out-460150441, ~y$w_buff1~0=~y$w_buff1~0_Out-460150441, ~y$w_buff0~0=~y$w_buff0~0_Out-460150441, P2Thread1of1ForFork0_~arg.offset=P2Thread1of1ForFork0_~arg.offset_Out-460150441, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In-460150441|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out-460150441, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-460150441} 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-27 22:57:07,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] P0ENTRY-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 2 v_~z~0_8) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 1 v_~x~0_7) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~z~0=v_~z~0_8, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_7, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} 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-27 22:57:07,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1802312635 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1802312635 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite11_Out-1802312635| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite11_Out-1802312635| ~y$w_buff0_used~0_In-1802312635)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1802312635, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1802312635} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1802312635, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-1802312635|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1802312635} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 22:57:07,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L746-2-->L746-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-1654860977 256) 0)) (.cse2 (= |P1Thread1of1ForFork2_#t~ite4_Out-1654860977| |P1Thread1of1ForFork2_#t~ite3_Out-1654860977|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1654860977 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In-1654860977 |P1Thread1of1ForFork2_#t~ite3_Out-1654860977|) .cse2) (and (not .cse0) .cse2 (not .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out-1654860977| ~y$w_buff1~0_In-1654860977)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1654860977, ~y$w_buff1~0=~y$w_buff1~0_In-1654860977, ~y~0=~y~0_In-1654860977, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1654860977} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1654860977, ~y$w_buff1~0=~y$w_buff1~0_In-1654860977, P1Thread1of1ForFork2_#t~ite4=|P1Thread1of1ForFork2_#t~ite4_Out-1654860977|, ~y~0=~y~0_In-1654860977, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-1654860977|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1654860977} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 22:57:07,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1102471498 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1102471498 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1102471498 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1102471498 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite12_Out1102471498| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite12_Out1102471498| ~y$w_buff1_used~0_In1102471498) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1102471498, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1102471498, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1102471498, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1102471498} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1102471498, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1102471498, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1102471498|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1102471498, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1102471498} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 22:57:07,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1426443605 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1426443605 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite5_Out-1426443605|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1426443605 |P1Thread1of1ForFork2_#t~ite5_Out-1426443605|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1426443605, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1426443605} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1426443605, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1426443605, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-1426443605|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 22:57:07,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L748-->L748-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1882077718 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In1882077718 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1882077718 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1882077718 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite6_Out1882077718| ~y$w_buff1_used~0_In1882077718)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork2_#t~ite6_Out1882077718| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1882077718, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1882077718, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1882077718, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1882077718} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1882077718, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1882077718, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1882077718, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out1882077718|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1882077718} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 22:57:07,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L749-->L749-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-875712609 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-875712609 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out-875712609| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out-875712609| ~y$r_buff0_thd2~0_In-875712609)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-875712609, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-875712609} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-875712609, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-875712609, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-875712609|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 22:57:07,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L750-->L750-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1213201932 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1213201932 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1213201932 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1213201932 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite8_Out1213201932|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In1213201932 |P1Thread1of1ForFork2_#t~ite8_Out1213201932|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1213201932, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1213201932, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1213201932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1213201932} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1213201932, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1213201932, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out1213201932|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1213201932, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1213201932} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 22:57:07,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L750-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_8| v_~y$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, 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-27 22:57:07,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L778-->L779: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In331947615 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In331947615 256) 0))) (or (and (= ~y$r_buff0_thd3~0_In331947615 ~y$r_buff0_thd3~0_Out331947615) (or .cse0 .cse1)) (and (= ~y$r_buff0_thd3~0_Out331947615 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In331947615, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In331947615} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In331947615, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out331947615, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out331947615|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 22:57:07,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In-586514850 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-586514850 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-586514850 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-586514850 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite14_Out-586514850| 0)) (and (= |P2Thread1of1ForFork0_#t~ite14_Out-586514850| ~y$r_buff1_thd3~0_In-586514850) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-586514850, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-586514850, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-586514850, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-586514850} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-586514850|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-586514850, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-586514850, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-586514850, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-586514850} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 22:57:07,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L779-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~y$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork0_#t~ite14_8|)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_12, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, 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-27 22:57:07,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L802-1-->L808: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 22:57:07,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L808-2-->L808-5: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In199000172 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In199000172 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite19_Out199000172| |ULTIMATE.start_main_#t~ite18_Out199000172|))) (or (and (= |ULTIMATE.start_main_#t~ite18_Out199000172| ~y~0_In199000172) .cse0 (or .cse1 .cse2)) (and (not .cse2) (not .cse1) .cse0 (= |ULTIMATE.start_main_#t~ite18_Out199000172| ~y$w_buff1~0_In199000172)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In199000172, ~y~0=~y~0_In199000172, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In199000172, ~y$w_buff1_used~0=~y$w_buff1_used~0_In199000172} OutVars{~y$w_buff1~0=~y$w_buff1~0_In199000172, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out199000172|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out199000172|, ~y~0=~y~0_In199000172, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In199000172, ~y$w_buff1_used~0=~y$w_buff1_used~0_In199000172} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 22:57:07,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-400917501 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-400917501 256) 0))) (or (and (= ~y$w_buff0_used~0_In-400917501 |ULTIMATE.start_main_#t~ite20_Out-400917501|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite20_Out-400917501|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-400917501, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-400917501} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-400917501, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-400917501, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-400917501|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 22:57:07,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In878992776 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In878992776 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In878992776 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In878992776 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out878992776|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In878992776 |ULTIMATE.start_main_#t~ite21_Out878992776|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In878992776, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In878992776, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In878992776, ~y$w_buff1_used~0=~y$w_buff1_used~0_In878992776} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In878992776, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In878992776, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out878992776|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In878992776, ~y$w_buff1_used~0=~y$w_buff1_used~0_In878992776} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 22:57:07,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In517626740 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In517626740 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out517626740| ~y$r_buff0_thd0~0_In517626740)) (and (= |ULTIMATE.start_main_#t~ite22_Out517626740| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In517626740, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In517626740} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In517626740, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In517626740, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out517626740|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 22:57:07,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In879146182 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In879146182 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In879146182 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In879146182 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite23_Out879146182|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In879146182 |ULTIMATE.start_main_#t~ite23_Out879146182|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In879146182, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In879146182, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In879146182, ~y$w_buff1_used~0=~y$w_buff1_used~0_In879146182} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In879146182, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In879146182, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In879146182, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out879146182|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In879146182} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 22:57:07,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L820-->L820-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1902736030 256)))) (or (and (= |ULTIMATE.start_main_#t~ite29_In1902736030| |ULTIMATE.start_main_#t~ite29_Out1902736030|) (= |ULTIMATE.start_main_#t~ite30_Out1902736030| ~y$w_buff0~0_In1902736030) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite29_Out1902736030| ~y$w_buff0~0_In1902736030) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1902736030 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In1902736030 256)) (and (= (mod ~y$r_buff1_thd0~0_In1902736030 256) 0) .cse1) (and .cse1 (= (mod ~y$w_buff1_used~0_In1902736030 256) 0)))) (= |ULTIMATE.start_main_#t~ite29_Out1902736030| |ULTIMATE.start_main_#t~ite30_Out1902736030|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1902736030, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In1902736030|, ~y$w_buff0~0=~y$w_buff0~0_In1902736030, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1902736030, ~weak$$choice2~0=~weak$$choice2~0_In1902736030, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1902736030, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1902736030} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out1902736030|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1902736030, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1902736030|, ~y$w_buff0~0=~y$w_buff0~0_In1902736030, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1902736030, ~weak$$choice2~0=~weak$$choice2~0_In1902736030, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1902736030, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1902736030} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 22:57:07,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L821-->L821-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In810075456 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In810075456 |ULTIMATE.start_main_#t~ite33_Out810075456|) (= |ULTIMATE.start_main_#t~ite32_In810075456| |ULTIMATE.start_main_#t~ite32_Out810075456|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In810075456 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In810075456 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In810075456 256))) (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In810075456 256))))) (= |ULTIMATE.start_main_#t~ite32_Out810075456| |ULTIMATE.start_main_#t~ite33_Out810075456|) .cse0 (= |ULTIMATE.start_main_#t~ite32_Out810075456| ~y$w_buff1~0_In810075456)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In810075456, ~y$w_buff0_used~0=~y$w_buff0_used~0_In810075456, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In810075456, ~weak$$choice2~0=~weak$$choice2~0_In810075456, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In810075456, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In810075456|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In810075456} OutVars{~y$w_buff1~0=~y$w_buff1~0_In810075456, ~y$w_buff0_used~0=~y$w_buff0_used~0_In810075456, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In810075456, ~weak$$choice2~0=~weak$$choice2~0_In810075456, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out810075456|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In810075456, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out810075456|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In810075456} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-27 22:57:07,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L822-->L822-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-951108261 256) 0))) (or (and (not .cse0) (= ~y$w_buff0_used~0_In-951108261 |ULTIMATE.start_main_#t~ite36_Out-951108261|) (= |ULTIMATE.start_main_#t~ite35_In-951108261| |ULTIMATE.start_main_#t~ite35_Out-951108261|)) (and (= ~y$w_buff0_used~0_In-951108261 |ULTIMATE.start_main_#t~ite35_Out-951108261|) .cse0 (= |ULTIMATE.start_main_#t~ite35_Out-951108261| |ULTIMATE.start_main_#t~ite36_Out-951108261|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-951108261 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-951108261 256) 0)) (and (= (mod ~y$r_buff1_thd0~0_In-951108261 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-951108261 256))))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-951108261, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-951108261, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-951108261|, ~weak$$choice2~0=~weak$$choice2~0_In-951108261, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-951108261, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-951108261} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-951108261, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-951108261, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-951108261|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-951108261|, ~weak$$choice2~0=~weak$$choice2~0_In-951108261, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-951108261, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-951108261} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 22:57:07,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L824-->L825: Formula: (and (not (= (mod v_~weak$$choice2~0_22 256) 0)) (= v_~y$r_buff0_thd0~0_63 v_~y$r_buff0_thd0~0_62)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_9|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_62, ~weak$$choice2~0=v_~weak$$choice2~0_22, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|} 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-27 22:57:07,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L825-->L825-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1513354669 256))) (.cse4 (= (mod ~y$r_buff1_thd0~0_In-1513354669 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1513354669 256))) (.cse6 (= 0 (mod ~y$r_buff0_thd0~0_In-1513354669 256))) (.cse5 (= (mod ~y$w_buff1_used~0_In-1513354669 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite45_Out-1513354669| |ULTIMATE.start_main_#t~ite44_Out-1513354669|))) (or (let ((.cse3 (not .cse6))) (and .cse0 (not .cse1) .cse2 (= 0 |ULTIMATE.start_main_#t~ite43_Out-1513354669|) (or .cse3 (not .cse4)) (or .cse3 (not .cse5)) (= |ULTIMATE.start_main_#t~ite44_Out-1513354669| |ULTIMATE.start_main_#t~ite43_Out-1513354669|))) (and (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1513354669| ~y$r_buff1_thd0~0_In-1513354669) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_In-1513354669| |ULTIMATE.start_main_#t~ite44_Out-1513354669|)) (and .cse0 (or (and .cse6 .cse4) .cse1 (and .cse6 .cse5)) (= ~y$r_buff1_thd0~0_In-1513354669 |ULTIMATE.start_main_#t~ite44_Out-1513354669|) .cse2)) (= |ULTIMATE.start_main_#t~ite43_In-1513354669| |ULTIMATE.start_main_#t~ite43_Out-1513354669|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1513354669, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1513354669, ~weak$$choice2~0=~weak$$choice2~0_In-1513354669, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_In-1513354669|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1513354669, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1513354669, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In-1513354669|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1513354669, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1513354669, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1513354669|, ~weak$$choice2~0=~weak$$choice2~0_In-1513354669, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1513354669, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1513354669|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1513354669|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1513354669} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 22:57:07,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L827-->L830-1: Formula: (and (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_~y~0_21 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_21, 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-27 22:57:07,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L830-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-27 22:57:07,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:57:07 BasicIcfg [2019-12-27 22:57:07,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:57:07,822 INFO L168 Benchmark]: Toolchain (without parser) took 22235.39 ms. Allocated memory was 138.9 MB in the beginning and 960.5 MB in the end (delta: 821.6 MB). Free memory was 101.3 MB in the beginning and 578.4 MB in the end (delta: -477.1 MB). Peak memory consumption was 344.5 MB. Max. memory is 7.1 GB. [2019-12-27 22:57:07,823 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 22:57:07,829 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.12 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.9 MB in the beginning and 157.3 MB in the end (delta: -56.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:57:07,830 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.60 ms. Allocated memory is still 203.4 MB. Free memory was 157.3 MB in the beginning and 154.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-27 22:57:07,831 INFO L168 Benchmark]: Boogie Preprocessor took 38.46 ms. Allocated memory is still 203.4 MB. Free memory was 154.1 MB in the beginning and 152.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 22:57:07,831 INFO L168 Benchmark]: RCFGBuilder took 806.12 ms. Allocated memory is still 203.4 MB. Free memory was 152.2 MB in the beginning and 105.5 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:57:07,834 INFO L168 Benchmark]: TraceAbstraction took 20540.96 ms. Allocated memory was 203.4 MB in the beginning and 960.5 MB in the end (delta: 757.1 MB). Free memory was 105.5 MB in the beginning and 578.4 MB in the end (delta: -472.9 MB). Peak memory consumption was 284.1 MB. Max. memory is 7.1 GB. [2019-12-27 22:57:07,841 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.24 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 774.12 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.9 MB in the beginning and 157.3 MB in the end (delta: -56.4 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.60 ms. Allocated memory is still 203.4 MB. Free memory was 157.3 MB in the beginning and 154.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.46 ms. Allocated memory is still 203.4 MB. Free memory was 154.1 MB in the beginning and 152.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 806.12 ms. Allocated memory is still 203.4 MB. Free memory was 152.2 MB in the beginning and 105.5 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20540.96 ms. Allocated memory was 203.4 MB in the beginning and 960.5 MB in the end (delta: 757.1 MB). Free memory was 105.5 MB in the beginning and 578.4 MB in the end (delta: -472.9 MB). Peak memory consumption was 284.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 161 ProgramPointsBefore, 82 ProgramPointsAfterwards, 192 TransitionsBefore, 88 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 4003 VarBasedMoverChecksPositive, 181 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 47769 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L798] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L800] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L802] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L765] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L769] 3 y$r_buff0_thd3 = (_Bool)1 [L772] 3 z = 1 VAL [__unbuffered_cnt=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=1] [L775] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, 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=1] [L740] 2 x = 2 [L743] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, 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=2] [L775] 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) [L746] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, 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=2] [L776] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L746] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 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 [L747] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L748] 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 [L749] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] EXPR 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, 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=2] [L808] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L809] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L810] 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 [L811] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L812] 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 [L815] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 0 y$flush_delayed = weak$$choice2 [L818] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, 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=2] [L819] 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, 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=2] [L819] 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) [L820] 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)) [L821] 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)) [L822] 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)) [L823] 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, 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=2] [L823] 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)) [L825] 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)) [L826] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, 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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 152 locations, 2 error locations. Result: UNSAFE, OverallTime: 20.2s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1510 SDtfs, 2174 SDslu, 4496 SDs, 0 SdLazy, 3383 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 240 GetRequests, 66 SyntacticMatches, 22 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22308occurred 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: 2.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 5020 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 689 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 617 ConstructedInterpolants, 0 QuantifiedInterpolants, 113290 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...