./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/podwr000_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/podwr000_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71874428e67d87ba9df016e59e2bc80f9d4a611c .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 18:20:50,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:20:50,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:20:50,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:20:50,509 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:20:50,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:20:50,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:20:50,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:20:50,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:20:50,533 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:20:50,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:20:50,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:20:50,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:20:50,540 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:20:50,542 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:20:50,543 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:20:50,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:20:50,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:20:50,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:20:50,552 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:20:50,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:20:50,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:20:50,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:20:50,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:20:50,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:20:50,568 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:20:50,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:20:50,571 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:20:50,572 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:20:50,573 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:20:50,573 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:20:50,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:20:50,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:20:50,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:20:50,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:20:50,578 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:20:50,579 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:20:50,579 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:20:50,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:20:50,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:20:50,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:20:50,583 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:20:50,618 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:20:50,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:20:50,622 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:20:50,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:20:50,626 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:20:50,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:20:50,627 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:20:50,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:20:50,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:20:50,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:20:50,629 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:20:50,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:20:50,631 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:20:50,631 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:20:50,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:20:50,632 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:20:50,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:20:50,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:20:50,634 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:20:50,634 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:20:50,635 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:20:50,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:20:50,635 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:20:50,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:20:50,638 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:20:50,638 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:20:50,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:20:50,639 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:20:50,639 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:20:50,640 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 71874428e67d87ba9df016e59e2bc80f9d4a611c [2019-11-28 18:20:51,008 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:20:51,033 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:20:51,036 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:20:51,038 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:20:51,040 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:20:51,041 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/podwr000_rmo.opt.i [2019-11-28 18:20:51,125 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/849ec8dcb/caaeb4c53fe84000b31766c8138d2388/FLAGfc3647832 [2019-11-28 18:20:51,721 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:20:51,722 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/podwr000_rmo.opt.i [2019-11-28 18:20:51,748 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/849ec8dcb/caaeb4c53fe84000b31766c8138d2388/FLAGfc3647832 [2019-11-28 18:20:51,990 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/849ec8dcb/caaeb4c53fe84000b31766c8138d2388 [2019-11-28 18:20:51,993 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:20:51,995 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:20:51,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:20:51,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:20:51,999 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:20:52,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:20:51" (1/1) ... [2019-11-28 18:20:52,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bcb722f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:52, skipping insertion in model container [2019-11-28 18:20:52,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:20:51" (1/1) ... [2019-11-28 18:20:52,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:20:52,080 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:20:52,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:20:52,612 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:20:52,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:20:52,775 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:20:52,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:52 WrapperNode [2019-11-28 18:20:52,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:20:52,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:20:52,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:20:52,777 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:20:52,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:52" (1/1) ... [2019-11-28 18:20:52,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:52" (1/1) ... [2019-11-28 18:20:52,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:20:52,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:20:52,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:20:52,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:20:52,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:52" (1/1) ... [2019-11-28 18:20:52,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:52" (1/1) ... [2019-11-28 18:20:52,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:52" (1/1) ... [2019-11-28 18:20:52,857 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:52" (1/1) ... [2019-11-28 18:20:52,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:52" (1/1) ... [2019-11-28 18:20:52,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:52" (1/1) ... [2019-11-28 18:20:52,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:52" (1/1) ... [2019-11-28 18:20:52,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:20:52,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:20:52,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:20:52,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:20:52,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:52" (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-11-28 18:20:52,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:20:52,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:20:52,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:20:52,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:20:52,947 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:20:52,948 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:20:52,948 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:20:52,948 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:20:52,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:20:52,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:20:52,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:20:52,953 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:20:53,677 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:20:53,678 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:20:53,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:20:53 BoogieIcfgContainer [2019-11-28 18:20:53,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:20:53,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:20:53,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:20:53,685 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:20:53,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:20:51" (1/3) ... [2019-11-28 18:20:53,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c163a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:20:53, skipping insertion in model container [2019-11-28 18:20:53,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:20:52" (2/3) ... [2019-11-28 18:20:53,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c163a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:20:53, skipping insertion in model container [2019-11-28 18:20:53,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:20:53" (3/3) ... [2019-11-28 18:20:53,690 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr000_rmo.opt.i [2019-11-28 18:20:53,701 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:20:53,701 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:20:53,710 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:20:53,711 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:20:53,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,766 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,766 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,766 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,767 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,767 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,783 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,785 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:20:53,853 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:20:53,875 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:20:53,875 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:20:53,875 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:20:53,875 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:20:53,875 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:20:53,876 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:20:53,876 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:20:53,876 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:20:53,894 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-11-28 18:20:53,896 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:20:53,993 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:20:53,994 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:20:54,011 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:20:54,036 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:20:54,084 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:20:54,085 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:20:54,093 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:20:54,110 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:20:54,111 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:20:58,845 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-11-28 18:20:58,968 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-28 18:20:59,081 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-11-28 18:20:59,081 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-11-28 18:20:59,086 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-11-28 18:20:59,615 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-11-28 18:20:59,618 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-11-28 18:20:59,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:20:59,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:20:59,633 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:20:59,633 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:20:59,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:20:59,641 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-11-28 18:20:59,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:20:59,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277948837] [2019-11-28 18:20:59,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:20:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:20:59,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:20:59,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277948837] [2019-11-28 18:20:59,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:20:59,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:20:59,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067885694] [2019-11-28 18:20:59,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:20:59,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:20:59,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:20:59,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:20:59,914 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-11-28 18:21:00,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:00,197 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-11-28 18:21:00,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:21:00,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:21:00,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:00,274 INFO L225 Difference]: With dead ends: 8074 [2019-11-28 18:21:00,275 INFO L226 Difference]: Without dead ends: 7606 [2019-11-28 18:21:00,276 INFO L630 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-11-28 18:21:00,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-11-28 18:21:00,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-11-28 18:21:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-11-28 18:21:00,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-11-28 18:21:00,679 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-11-28 18:21:00,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:00,679 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-11-28 18:21:00,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:21:00,680 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-11-28 18:21:00,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:21:00,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:00,683 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:00,683 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:00,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:00,684 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-11-28 18:21:00,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:00,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084398735] [2019-11-28 18:21:00,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:00,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:00,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084398735] [2019-11-28 18:21:00,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:00,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:21:00,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253851326] [2019-11-28 18:21:00,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:21:00,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:00,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:21:00,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:21:00,853 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-11-28 18:21:01,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:01,210 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-11-28 18:21:01,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:21:01,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:21:01,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:01,289 INFO L225 Difference]: With dead ends: 11630 [2019-11-28 18:21:01,290 INFO L226 Difference]: Without dead ends: 11623 [2019-11-28 18:21:01,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:21:01,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-11-28 18:21:01,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-11-28 18:21:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-11-28 18:21:01,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-11-28 18:21:01,712 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-11-28 18:21:01,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:01,713 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-11-28 18:21:01,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:21:01,713 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-11-28 18:21:01,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:21:01,719 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:01,719 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:01,720 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:01,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:01,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-11-28 18:21:01,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:01,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907478734] [2019-11-28 18:21:01,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:01,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:01,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907478734] [2019-11-28 18:21:01,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:01,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:21:01,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103599112] [2019-11-28 18:21:01,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:21:01,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:01,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:21:01,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:21:01,818 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-11-28 18:21:02,035 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-28 18:21:02,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:02,300 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-11-28 18:21:02,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:21:02,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 18:21:02,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:02,351 INFO L225 Difference]: With dead ends: 14471 [2019-11-28 18:21:02,351 INFO L226 Difference]: Without dead ends: 14471 [2019-11-28 18:21:02,352 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:21:02,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-11-28 18:21:02,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-11-28 18:21:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-11-28 18:21:02,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-11-28 18:21:02,760 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-11-28 18:21:02,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:02,762 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-11-28 18:21:02,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:21:02,762 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-11-28 18:21:02,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:21:02,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:02,766 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:02,766 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:02,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:02,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-11-28 18:21:02,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:02,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592163749] [2019-11-28 18:21:02,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21: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-11-28 18:21:02,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592163749] [2019-11-28 18:21:02,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:02,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:21:02,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626085956] [2019-11-28 18:21:02,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:21:02,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:02,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:21:02,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:21:02,876 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-11-28 18:21:02,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:02,938 INFO L93 Difference]: Finished difference Result 10750 states and 33336 transitions. [2019-11-28 18:21:02,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:21:02,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:21:02,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:02,967 INFO L225 Difference]: With dead ends: 10750 [2019-11-28 18:21:02,967 INFO L226 Difference]: Without dead ends: 10750 [2019-11-28 18:21:02,967 INFO L630 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-11-28 18:21:03,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10750 states. [2019-11-28 18:21:03,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10750 to 10670. [2019-11-28 18:21:03,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10670 states. [2019-11-28 18:21:03,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10670 states to 10670 states and 33104 transitions. [2019-11-28 18:21:03,277 INFO L78 Accepts]: Start accepts. Automaton has 10670 states and 33104 transitions. Word has length 16 [2019-11-28 18:21:03,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:03,278 INFO L462 AbstractCegarLoop]: Abstraction has 10670 states and 33104 transitions. [2019-11-28 18:21:03,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:21:03,278 INFO L276 IsEmpty]: Start isEmpty. Operand 10670 states and 33104 transitions. [2019-11-28 18:21:03,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:21:03,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:03,282 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:21:03,282 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:03,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:03,282 INFO L82 PathProgramCache]: Analyzing trace with hash 2099964683, now seen corresponding path program 1 times [2019-11-28 18:21:03,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:03,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763757175] [2019-11-28 18:21:03,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:03,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:03,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763757175] [2019-11-28 18:21:03,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:03,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:21:03,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605696925] [2019-11-28 18:21:03,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:21:03,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:03,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:21:03,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:21:03,363 INFO L87 Difference]: Start difference. First operand 10670 states and 33104 transitions. Second operand 4 states. [2019-11-28 18:21:03,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:03,401 INFO L93 Difference]: Finished difference Result 2054 states and 5113 transitions. [2019-11-28 18:21:03,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:21:03,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 18:21:03,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:03,408 INFO L225 Difference]: With dead ends: 2054 [2019-11-28 18:21:03,408 INFO L226 Difference]: Without dead ends: 1457 [2019-11-28 18:21:03,409 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:21:03,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2019-11-28 18:21:03,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1457. [2019-11-28 18:21:03,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1457 states. [2019-11-28 18:21:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 3211 transitions. [2019-11-28 18:21:03,442 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 3211 transitions. Word has length 16 [2019-11-28 18:21:03,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:03,443 INFO L462 AbstractCegarLoop]: Abstraction has 1457 states and 3211 transitions. [2019-11-28 18:21:03,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:21:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 3211 transitions. [2019-11-28 18:21:03,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 18:21:03,446 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:03,446 INFO L410 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] [2019-11-28 18:21:03,447 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:03,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:03,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-11-28 18:21:03,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:03,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732040999] [2019-11-28 18:21:03,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:03,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:03,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732040999] [2019-11-28 18:21:03,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:03,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:21:03,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788320178] [2019-11-28 18:21:03,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:21:03,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:03,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:21:03,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:21:03,571 INFO L87 Difference]: Start difference. First operand 1457 states and 3211 transitions. Second operand 6 states. [2019-11-28 18:21:03,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:03,962 INFO L93 Difference]: Finished difference Result 2249 states and 4761 transitions. [2019-11-28 18:21:03,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:21:03,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-28 18:21:03,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:03,969 INFO L225 Difference]: With dead ends: 2249 [2019-11-28 18:21:03,970 INFO L226 Difference]: Without dead ends: 2197 [2019-11-28 18:21:03,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:21:03,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2019-11-28 18:21:03,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 1428. [2019-11-28 18:21:03,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-11-28 18:21:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 3147 transitions. [2019-11-28 18:21:04,002 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 3147 transitions. Word has length 24 [2019-11-28 18:21:04,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:04,003 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 3147 transitions. [2019-11-28 18:21:04,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:21:04,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 3147 transitions. [2019-11-28 18:21:04,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:21:04,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:04,006 INFO L410 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] [2019-11-28 18:21:04,006 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:04,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:04,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338791, now seen corresponding path program 1 times [2019-11-28 18:21:04,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:04,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147738134] [2019-11-28 18:21:04,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:04,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147738134] [2019-11-28 18:21:04,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:04,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:21:04,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147798599] [2019-11-28 18:21:04,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:21:04,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:04,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:21:04,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:21:04,098 INFO L87 Difference]: Start difference. First operand 1428 states and 3147 transitions. Second operand 5 states. [2019-11-28 18:21:04,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:04,200 INFO L93 Difference]: Finished difference Result 752 states and 1639 transitions. [2019-11-28 18:21:04,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:21:04,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 18:21:04,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:04,202 INFO L225 Difference]: With dead ends: 752 [2019-11-28 18:21:04,202 INFO L226 Difference]: Without dead ends: 689 [2019-11-28 18:21:04,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:21:04,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-11-28 18:21:04,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2019-11-28 18:21:04,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-11-28 18:21:04,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1501 transitions. [2019-11-28 18:21:04,212 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1501 transitions. Word has length 27 [2019-11-28 18:21:04,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:04,212 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1501 transitions. [2019-11-28 18:21:04,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:21:04,213 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1501 transitions. [2019-11-28 18:21:04,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:21:04,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:04,215 INFO L410 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] [2019-11-28 18:21:04,215 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:04,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:04,216 INFO L82 PathProgramCache]: Analyzing trace with hash 178128967, now seen corresponding path program 1 times [2019-11-28 18:21:04,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:04,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062372415] [2019-11-28 18:21:04,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:04,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:04,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062372415] [2019-11-28 18:21:04,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:04,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:21:04,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678498232] [2019-11-28 18:21:04,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:21:04,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:04,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:21:04,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:21:04,317 INFO L87 Difference]: Start difference. First operand 689 states and 1501 transitions. Second operand 5 states. [2019-11-28 18:21:04,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:04,685 INFO L93 Difference]: Finished difference Result 1105 states and 2341 transitions. [2019-11-28 18:21:04,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:21:04,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-28 18:21:04,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:04,689 INFO L225 Difference]: With dead ends: 1105 [2019-11-28 18:21:04,690 INFO L226 Difference]: Without dead ends: 1105 [2019-11-28 18:21:04,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:21:04,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2019-11-28 18:21:04,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 896. [2019-11-28 18:21:04,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-11-28 18:21:04,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1944 transitions. [2019-11-28 18:21:04,709 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1944 transitions. Word has length 51 [2019-11-28 18:21:04,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:04,709 INFO L462 AbstractCegarLoop]: Abstraction has 896 states and 1944 transitions. [2019-11-28 18:21:04,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:21:04,709 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1944 transitions. [2019-11-28 18:21:04,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:21:04,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:04,712 INFO L410 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] [2019-11-28 18:21:04,712 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:04,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:04,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1015680243, now seen corresponding path program 2 times [2019-11-28 18:21:04,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:04,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013194818] [2019-11-28 18:21:04,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:04,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:04,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013194818] [2019-11-28 18:21:04,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:04,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:21:04,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50424101] [2019-11-28 18:21:04,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:21:04,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:04,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:21:04,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:21:04,789 INFO L87 Difference]: Start difference. First operand 896 states and 1944 transitions. Second operand 3 states. [2019-11-28 18:21:04,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:04,855 INFO L93 Difference]: Finished difference Result 1184 states and 2559 transitions. [2019-11-28 18:21:04,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:21:04,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 18:21:04,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:04,858 INFO L225 Difference]: With dead ends: 1184 [2019-11-28 18:21:04,858 INFO L226 Difference]: Without dead ends: 1184 [2019-11-28 18:21:04,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:21:04,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2019-11-28 18:21:04,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 956. [2019-11-28 18:21:04,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-11-28 18:21:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2092 transitions. [2019-11-28 18:21:04,876 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2092 transitions. Word has length 51 [2019-11-28 18:21:04,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:04,877 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 2092 transitions. [2019-11-28 18:21:04,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:21:04,877 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2092 transitions. [2019-11-28 18:21:04,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:21:04,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:04,880 INFO L410 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] [2019-11-28 18:21:04,880 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:04,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:04,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1042109596, now seen corresponding path program 1 times [2019-11-28 18:21:04,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:04,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402015107] [2019-11-28 18:21:04,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:04,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:04,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402015107] [2019-11-28 18:21:04,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:04,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:21:04,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252619111] [2019-11-28 18:21:04,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:21:04,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:04,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:21:04,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:21:04,993 INFO L87 Difference]: Start difference. First operand 956 states and 2092 transitions. Second operand 5 states. [2019-11-28 18:21:05,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:05,015 INFO L93 Difference]: Finished difference Result 1646 states and 3628 transitions. [2019-11-28 18:21:05,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:21:05,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-11-28 18:21:05,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:05,017 INFO L225 Difference]: With dead ends: 1646 [2019-11-28 18:21:05,018 INFO L226 Difference]: Without dead ends: 759 [2019-11-28 18:21:05,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-11-28 18:21:05,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-11-28 18:21:05,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2019-11-28 18:21:05,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-11-28 18:21:05,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1666 transitions. [2019-11-28 18:21:05,031 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1666 transitions. Word has length 52 [2019-11-28 18:21:05,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:05,032 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1666 transitions. [2019-11-28 18:21:05,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:21:05,032 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1666 transitions. [2019-11-28 18:21:05,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:21:05,034 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:05,035 INFO L410 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] [2019-11-28 18:21:05,035 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:05,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:05,035 INFO L82 PathProgramCache]: Analyzing trace with hash 2120720198, now seen corresponding path program 2 times [2019-11-28 18:21:05,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:05,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43562054] [2019-11-28 18:21:05,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:05,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:05,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43562054] [2019-11-28 18:21:05,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:05,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 18:21:05,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215199780] [2019-11-28 18:21:05,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 18:21:05,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:05,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 18:21:05,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:21:05,466 INFO L87 Difference]: Start difference. First operand 759 states and 1666 transitions. Second operand 13 states. [2019-11-28 18:21:06,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:06,890 INFO L93 Difference]: Finished difference Result 1086 states and 2309 transitions. [2019-11-28 18:21:06,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 18:21:06,891 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2019-11-28 18:21:06,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:06,893 INFO L225 Difference]: With dead ends: 1086 [2019-11-28 18:21:06,893 INFO L226 Difference]: Without dead ends: 865 [2019-11-28 18:21:06,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-11-28 18:21:06,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-11-28 18:21:06,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 790. [2019-11-28 18:21:06,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-28 18:21:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1740 transitions. [2019-11-28 18:21:06,906 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1740 transitions. Word has length 52 [2019-11-28 18:21:06,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:06,907 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1740 transitions. [2019-11-28 18:21:06,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 18:21:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1740 transitions. [2019-11-28 18:21:06,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:21:06,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:06,910 INFO L410 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] [2019-11-28 18:21:06,910 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:06,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:06,911 INFO L82 PathProgramCache]: Analyzing trace with hash 925896582, now seen corresponding path program 3 times [2019-11-28 18:21:06,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:06,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828853502] [2019-11-28 18:21:06,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:21:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:21:07,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828853502] [2019-11-28 18:21:07,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:21:07,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:21:07,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307110418] [2019-11-28 18:21:07,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:21:07,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:21:07,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:21:07,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:21:07,025 INFO L87 Difference]: Start difference. First operand 790 states and 1740 transitions. Second operand 7 states. [2019-11-28 18:21:07,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:21:07,207 INFO L93 Difference]: Finished difference Result 1290 states and 2749 transitions. [2019-11-28 18:21:07,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:21:07,208 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:21:07,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:21:07,210 INFO L225 Difference]: With dead ends: 1290 [2019-11-28 18:21:07,210 INFO L226 Difference]: Without dead ends: 919 [2019-11-28 18:21:07,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:21:07,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-11-28 18:21:07,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 754. [2019-11-28 18:21:07,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-11-28 18:21:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-11-28 18:21:07,222 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 52 [2019-11-28 18:21:07,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:21:07,222 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-11-28 18:21:07,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:21:07,223 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-11-28 18:21:07,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:21:07,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:21:07,225 INFO L410 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] [2019-11-28 18:21:07,226 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:21:07,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:21:07,226 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 4 times [2019-11-28 18:21:07,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:21:07,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672311010] [2019-11-28 18:21:07,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:21:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:21:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:21:07,337 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:21:07,337 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:21:07,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t1555~0.base_40| 1)) (= 0 v_~y$flush_delayed~0_22) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1555~0.base_40|) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd2~0_235) (= |v_ULTIMATE.start_main_~#t1555~0.offset_27| 0) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1555~0.base_40| 4)) (= 0 v_~weak$$choice2~0_96) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= v_~y$w_buff1_used~0_311 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1555~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1555~0.base_40|) |v_ULTIMATE.start_main_~#t1555~0.offset_27| 0)) |v_#memory_int_17|) (= v_~x~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= (select .cse0 |v_ULTIMATE.start_main_~#t1555~0.base_40|) 0) (= v_~y$r_buff1_thd1~0_115 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~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_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ULTIMATE.start_main_~#t1556~0.base=|v_ULTIMATE.start_main_~#t1556~0.base_41|, ~y~0=v_~y~0_133, ULTIMATE.start_main_~#t1555~0.base=|v_ULTIMATE.start_main_~#t1555~0.base_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ULTIMATE.start_main_~#t1556~0.offset=|v_ULTIMATE.start_main_~#t1556~0.offset_27|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t1555~0.offset=|v_ULTIMATE.start_main_~#t1555~0.offset_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1556~0.base, ~y~0, ULTIMATE.start_main_~#t1555~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1556~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1555~0.offset, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:21:07,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1556~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t1556~0.offset_11| 0) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1556~0.base_13|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1556~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1556~0.base_13|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1556~0.base_13|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1556~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1556~0.base_13|) |v_ULTIMATE.start_main_~#t1556~0.offset_11| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t1556~0.base=|v_ULTIMATE.start_main_~#t1556~0.base_13|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1556~0.offset=|v_ULTIMATE.start_main_~#t1556~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1556~0.base, #length, ULTIMATE.start_main_~#t1556~0.offset] because there is no mapped edge [2019-11-28 18:21:07,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= 1 ~y$r_buff0_thd1~0_Out-215687989) (= ~x~0_In-215687989 ~__unbuffered_p0_EAX~0_Out-215687989) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-215687989)) (= ~y$r_buff1_thd1~0_Out-215687989 ~y$r_buff0_thd1~0_In-215687989) (= ~y$r_buff1_thd0~0_Out-215687989 ~y$r_buff0_thd0~0_In-215687989) (= ~y$r_buff1_thd2~0_Out-215687989 ~y$r_buff0_thd2~0_In-215687989)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-215687989, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-215687989, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-215687989, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-215687989, ~x~0=~x~0_In-215687989} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-215687989, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-215687989, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-215687989, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-215687989, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-215687989, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-215687989, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-215687989, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-215687989, ~x~0=~x~0_In-215687989} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:21:07,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In2069946552 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2069946552 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out2069946552| ~y$w_buff0_used~0_In2069946552)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out2069946552|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2069946552, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2069946552} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2069946552|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2069946552, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2069946552} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:21:07,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In904429865 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_Out904429865| ~y$w_buff0_used~0_In904429865) (= |P1Thread1of1ForFork1_#t~ite21_Out904429865| |P1Thread1of1ForFork1_#t~ite20_Out904429865|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In904429865 256)))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In904429865 256)) .cse1) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In904429865 256))) (= 0 (mod ~y$w_buff0_used~0_In904429865 256))))) (and (= |P1Thread1of1ForFork1_#t~ite21_Out904429865| ~y$w_buff0_used~0_In904429865) (= |P1Thread1of1ForFork1_#t~ite20_In904429865| |P1Thread1of1ForFork1_#t~ite20_Out904429865|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In904429865, ~y$w_buff0_used~0=~y$w_buff0_used~0_In904429865, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In904429865|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In904429865, ~weak$$choice2~0=~weak$$choice2~0_In904429865, ~y$w_buff1_used~0=~y$w_buff1_used~0_In904429865} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In904429865, ~y$w_buff0_used~0=~y$w_buff0_used~0_In904429865, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out904429865|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In904429865, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out904429865|, ~weak$$choice2~0=~weak$$choice2~0_In904429865, ~y$w_buff1_used~0=~y$w_buff1_used~0_In904429865} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:21:07,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1429371038 256) 0)) (.cse4 (= (mod ~y$w_buff0_used~0_In1429371038 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out1429371038| |P1Thread1of1ForFork1_#t~ite24_Out1429371038|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1429371038 256))) (.cse5 (= (mod ~y$r_buff1_thd2~0_In1429371038 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In1429371038 256) 0))) (or (and (or (and (= |P1Thread1of1ForFork1_#t~ite24_Out1429371038| ~y$w_buff1_used~0_In1429371038) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_Out1429371038| |P1Thread1of1ForFork1_#t~ite23_In1429371038|)) (and .cse0 .cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out1429371038| ~y$w_buff1_used~0_In1429371038) (or (and .cse2 .cse3) .cse4 (and .cse5 .cse3)))) (= |P1Thread1of1ForFork1_#t~ite22_In1429371038| |P1Thread1of1ForFork1_#t~ite22_Out1429371038|)) (let ((.cse6 (not .cse3))) (and .cse0 (not .cse4) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out1429371038|) (= |P1Thread1of1ForFork1_#t~ite23_Out1429371038| |P1Thread1of1ForFork1_#t~ite22_Out1429371038|) .cse1 (or (not .cse2) .cse6) (or (not .cse5) .cse6))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1429371038, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1429371038, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1429371038, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1429371038|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In1429371038|, ~weak$$choice2~0=~weak$$choice2~0_In1429371038, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1429371038} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1429371038, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1429371038, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1429371038, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1429371038|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1429371038|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out1429371038|, ~weak$$choice2~0=~weak$$choice2~0_In1429371038, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1429371038} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:21:07,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1962104431 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1962104431 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In1962104431 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1962104431 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1962104431|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1962104431 |P0Thread1of1ForFork0_#t~ite6_Out1962104431|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1962104431, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1962104431, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1962104431, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1962104431} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1962104431|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1962104431, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1962104431, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1962104431, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1962104431} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:21:07,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1951570545 256))) (.cse0 (= ~y$r_buff0_thd1~0_In-1951570545 ~y$r_buff0_thd1~0_Out-1951570545)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-1951570545 256)))) (or (and .cse0 .cse1) (and (= ~y$r_buff0_thd1~0_Out-1951570545 0) (not .cse2) (not .cse1)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1951570545, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1951570545} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1951570545, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1951570545|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1951570545} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:21:07,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-1130650705 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1130650705 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1130650705 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-1130650705 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1130650705|)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1130650705| ~y$r_buff1_thd1~0_In-1130650705) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1130650705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1130650705, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1130650705, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1130650705} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1130650705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1130650705, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1130650705|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1130650705, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1130650705} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:21:07,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:21:07,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1083972198 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In-1083972198| |P1Thread1of1ForFork1_#t~ite29_Out-1083972198|) (= ~y$r_buff1_thd2~0_In-1083972198 |P1Thread1of1ForFork1_#t~ite30_Out-1083972198|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1083972198| |P1Thread1of1ForFork1_#t~ite30_Out-1083972198|) (= |P1Thread1of1ForFork1_#t~ite29_Out-1083972198| ~y$r_buff1_thd2~0_In-1083972198) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1083972198 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1083972198 256) 0)) (= (mod ~y$w_buff0_used~0_In-1083972198 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1083972198 256) 0))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1083972198, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1083972198|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1083972198, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1083972198, ~weak$$choice2~0=~weak$$choice2~0_In-1083972198, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1083972198} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1083972198, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1083972198|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1083972198|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1083972198, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1083972198, ~weak$$choice2~0=~weak$$choice2~0_In-1083972198, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1083972198} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:21:07,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:21:07,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-1191515578 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1191515578 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-1191515578 |P1Thread1of1ForFork1_#t~ite32_Out-1191515578|)) (and (= ~y~0_In-1191515578 |P1Thread1of1ForFork1_#t~ite32_Out-1191515578|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1191515578, ~y$w_buff1~0=~y$w_buff1~0_In-1191515578, ~y~0=~y~0_In-1191515578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1191515578} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1191515578, ~y$w_buff1~0=~y$w_buff1~0_In-1191515578, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1191515578|, ~y~0=~y~0_In-1191515578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1191515578} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:21:07,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-11-28 18:21:07,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2004972003 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-2004972003 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-2004972003|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-2004972003 |P1Thread1of1ForFork1_#t~ite34_Out-2004972003|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2004972003, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2004972003} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2004972003, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2004972003, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-2004972003|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:21:07,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1846301056 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1846301056 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1846301056 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1846301056 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1846301056|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-1846301056| ~y$w_buff1_used~0_In-1846301056) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1846301056, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1846301056, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1846301056, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1846301056} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1846301056, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1846301056, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1846301056, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1846301056|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1846301056} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:21:07,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1038494041 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1038494041 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1038494041|) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1038494041| ~y$r_buff0_thd2~0_In-1038494041) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1038494041, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1038494041} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1038494041, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1038494041, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1038494041|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:21:07,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-23099656 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-23099656 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-23099656 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-23099656 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-23099656| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-23099656 |P1Thread1of1ForFork1_#t~ite37_Out-23099656|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-23099656, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-23099656, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-23099656, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-23099656} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-23099656, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-23099656, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-23099656, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-23099656|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-23099656} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:21:07,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:21:07,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:21:07,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:21:07,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1366355049 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1366355049 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1366355049| ~y$w_buff1~0_In1366355049) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1366355049| ~y~0_In1366355049) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1366355049, ~y~0=~y~0_In1366355049, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1366355049, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1366355049} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1366355049|, ~y$w_buff1~0=~y$w_buff1~0_In1366355049, ~y~0=~y~0_In1366355049, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1366355049, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1366355049} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:21:07,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-11-28 18:21:07,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1939844252 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1939844252 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1939844252 |ULTIMATE.start_main_#t~ite42_Out-1939844252|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite42_Out-1939844252| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1939844252, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1939844252} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1939844252, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1939844252, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1939844252|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:21:07,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1580302432 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1580302432 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1580302432 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1580302432 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1580302432| ~y$w_buff1_used~0_In-1580302432) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite43_Out-1580302432| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1580302432, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1580302432, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1580302432, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1580302432} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1580302432, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1580302432, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1580302432|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1580302432, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1580302432} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:21:07,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2058170109 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2058170109 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-2058170109| 0)) (and (= |ULTIMATE.start_main_#t~ite44_Out-2058170109| ~y$r_buff0_thd0~0_In-2058170109) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2058170109, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2058170109} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2058170109, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2058170109, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-2058170109|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:21:07,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1350216292 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1350216292 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1350216292 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1350216292 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1350216292| ~y$r_buff1_thd0~0_In-1350216292) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-1350216292|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1350216292, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1350216292, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1350216292, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1350216292} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1350216292, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1350216292, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1350216292, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1350216292|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1350216292} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:21:07,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_13) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:21:07,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:21:07 BasicIcfg [2019-11-28 18:21:07,418 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:21:07,419 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:21:07,419 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:21:07,419 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:21:07,420 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:20:53" (3/4) ... [2019-11-28 18:21:07,422 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:21:07,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t1555~0.base_40| 1)) (= 0 v_~y$flush_delayed~0_22) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1555~0.base_40|) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd2~0_235) (= |v_ULTIMATE.start_main_~#t1555~0.offset_27| 0) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1555~0.base_40| 4)) (= 0 v_~weak$$choice2~0_96) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= v_~y$w_buff1_used~0_311 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1555~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1555~0.base_40|) |v_ULTIMATE.start_main_~#t1555~0.offset_27| 0)) |v_#memory_int_17|) (= v_~x~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= (select .cse0 |v_ULTIMATE.start_main_~#t1555~0.base_40|) 0) (= v_~y$r_buff1_thd1~0_115 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~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_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ULTIMATE.start_main_~#t1556~0.base=|v_ULTIMATE.start_main_~#t1556~0.base_41|, ~y~0=v_~y~0_133, ULTIMATE.start_main_~#t1555~0.base=|v_ULTIMATE.start_main_~#t1555~0.base_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ULTIMATE.start_main_~#t1556~0.offset=|v_ULTIMATE.start_main_~#t1556~0.offset_27|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t1555~0.offset=|v_ULTIMATE.start_main_~#t1555~0.offset_27|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1556~0.base, ~y~0, ULTIMATE.start_main_~#t1555~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1556~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1555~0.offset, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:21:07,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1556~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t1556~0.offset_11| 0) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1556~0.base_13|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1556~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1556~0.base_13|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1556~0.base_13|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1556~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1556~0.base_13|) |v_ULTIMATE.start_main_~#t1556~0.offset_11| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t1556~0.base=|v_ULTIMATE.start_main_~#t1556~0.base_13|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1556~0.offset=|v_ULTIMATE.start_main_~#t1556~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1556~0.base, #length, ULTIMATE.start_main_~#t1556~0.offset] because there is no mapped edge [2019-11-28 18:21:07,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= 1 ~y$r_buff0_thd1~0_Out-215687989) (= ~x~0_In-215687989 ~__unbuffered_p0_EAX~0_Out-215687989) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-215687989)) (= ~y$r_buff1_thd1~0_Out-215687989 ~y$r_buff0_thd1~0_In-215687989) (= ~y$r_buff1_thd0~0_Out-215687989 ~y$r_buff0_thd0~0_In-215687989) (= ~y$r_buff1_thd2~0_Out-215687989 ~y$r_buff0_thd2~0_In-215687989)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-215687989, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-215687989, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-215687989, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-215687989, ~x~0=~x~0_In-215687989} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-215687989, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-215687989, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-215687989, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-215687989, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-215687989, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-215687989, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-215687989, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-215687989, ~x~0=~x~0_In-215687989} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:21:07,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In2069946552 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2069946552 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out2069946552| ~y$w_buff0_used~0_In2069946552)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out2069946552|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2069946552, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2069946552} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2069946552|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2069946552, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2069946552} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:21:07,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In904429865 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_Out904429865| ~y$w_buff0_used~0_In904429865) (= |P1Thread1of1ForFork1_#t~ite21_Out904429865| |P1Thread1of1ForFork1_#t~ite20_Out904429865|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In904429865 256)))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In904429865 256)) .cse1) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In904429865 256))) (= 0 (mod ~y$w_buff0_used~0_In904429865 256))))) (and (= |P1Thread1of1ForFork1_#t~ite21_Out904429865| ~y$w_buff0_used~0_In904429865) (= |P1Thread1of1ForFork1_#t~ite20_In904429865| |P1Thread1of1ForFork1_#t~ite20_Out904429865|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In904429865, ~y$w_buff0_used~0=~y$w_buff0_used~0_In904429865, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In904429865|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In904429865, ~weak$$choice2~0=~weak$$choice2~0_In904429865, ~y$w_buff1_used~0=~y$w_buff1_used~0_In904429865} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In904429865, ~y$w_buff0_used~0=~y$w_buff0_used~0_In904429865, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out904429865|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In904429865, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out904429865|, ~weak$$choice2~0=~weak$$choice2~0_In904429865, ~y$w_buff1_used~0=~y$w_buff1_used~0_In904429865} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:21:07,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1429371038 256) 0)) (.cse4 (= (mod ~y$w_buff0_used~0_In1429371038 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out1429371038| |P1Thread1of1ForFork1_#t~ite24_Out1429371038|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1429371038 256))) (.cse5 (= (mod ~y$r_buff1_thd2~0_In1429371038 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In1429371038 256) 0))) (or (and (or (and (= |P1Thread1of1ForFork1_#t~ite24_Out1429371038| ~y$w_buff1_used~0_In1429371038) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_Out1429371038| |P1Thread1of1ForFork1_#t~ite23_In1429371038|)) (and .cse0 .cse1 (= |P1Thread1of1ForFork1_#t~ite23_Out1429371038| ~y$w_buff1_used~0_In1429371038) (or (and .cse2 .cse3) .cse4 (and .cse5 .cse3)))) (= |P1Thread1of1ForFork1_#t~ite22_In1429371038| |P1Thread1of1ForFork1_#t~ite22_Out1429371038|)) (let ((.cse6 (not .cse3))) (and .cse0 (not .cse4) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out1429371038|) (= |P1Thread1of1ForFork1_#t~ite23_Out1429371038| |P1Thread1of1ForFork1_#t~ite22_Out1429371038|) .cse1 (or (not .cse2) .cse6) (or (not .cse5) .cse6))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1429371038, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1429371038, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1429371038, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1429371038|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In1429371038|, ~weak$$choice2~0=~weak$$choice2~0_In1429371038, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1429371038} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1429371038, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1429371038, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1429371038, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1429371038|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1429371038|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out1429371038|, ~weak$$choice2~0=~weak$$choice2~0_In1429371038, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1429371038} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:21:07,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1962104431 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1962104431 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In1962104431 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1962104431 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1962104431|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1962104431 |P0Thread1of1ForFork0_#t~ite6_Out1962104431|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1962104431, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1962104431, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1962104431, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1962104431} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1962104431|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1962104431, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1962104431, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1962104431, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1962104431} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:21:07,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1951570545 256))) (.cse0 (= ~y$r_buff0_thd1~0_In-1951570545 ~y$r_buff0_thd1~0_Out-1951570545)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-1951570545 256)))) (or (and .cse0 .cse1) (and (= ~y$r_buff0_thd1~0_Out-1951570545 0) (not .cse2) (not .cse1)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1951570545, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1951570545} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1951570545, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1951570545|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1951570545} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:21:07,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-1130650705 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1130650705 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1130650705 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-1130650705 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1130650705|)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1130650705| ~y$r_buff1_thd1~0_In-1130650705) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1130650705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1130650705, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1130650705, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1130650705} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1130650705, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1130650705, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1130650705|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1130650705, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1130650705} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:21:07,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:21:07,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1083972198 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In-1083972198| |P1Thread1of1ForFork1_#t~ite29_Out-1083972198|) (= ~y$r_buff1_thd2~0_In-1083972198 |P1Thread1of1ForFork1_#t~ite30_Out-1083972198|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1083972198| |P1Thread1of1ForFork1_#t~ite30_Out-1083972198|) (= |P1Thread1of1ForFork1_#t~ite29_Out-1083972198| ~y$r_buff1_thd2~0_In-1083972198) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1083972198 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1083972198 256) 0)) (= (mod ~y$w_buff0_used~0_In-1083972198 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1083972198 256) 0))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1083972198, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1083972198|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1083972198, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1083972198, ~weak$$choice2~0=~weak$$choice2~0_In-1083972198, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1083972198} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1083972198, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1083972198|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1083972198|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1083972198, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1083972198, ~weak$$choice2~0=~weak$$choice2~0_In-1083972198, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1083972198} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:21:07,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:21:07,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-1191515578 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1191515578 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-1191515578 |P1Thread1of1ForFork1_#t~ite32_Out-1191515578|)) (and (= ~y~0_In-1191515578 |P1Thread1of1ForFork1_#t~ite32_Out-1191515578|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1191515578, ~y$w_buff1~0=~y$w_buff1~0_In-1191515578, ~y~0=~y~0_In-1191515578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1191515578} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1191515578, ~y$w_buff1~0=~y$w_buff1~0_In-1191515578, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1191515578|, ~y~0=~y~0_In-1191515578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1191515578} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:21:07,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-11-28 18:21:07,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2004972003 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-2004972003 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-2004972003|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-2004972003 |P1Thread1of1ForFork1_#t~ite34_Out-2004972003|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2004972003, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2004972003} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2004972003, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2004972003, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-2004972003|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:21:07,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1846301056 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1846301056 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1846301056 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1846301056 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1846301056|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-1846301056| ~y$w_buff1_used~0_In-1846301056) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1846301056, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1846301056, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1846301056, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1846301056} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1846301056, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1846301056, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1846301056, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1846301056|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1846301056} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:21:07,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1038494041 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1038494041 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1038494041|) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1038494041| ~y$r_buff0_thd2~0_In-1038494041) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1038494041, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1038494041} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1038494041, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1038494041, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1038494041|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:21:07,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-23099656 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-23099656 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-23099656 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-23099656 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-23099656| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-23099656 |P1Thread1of1ForFork1_#t~ite37_Out-23099656|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-23099656, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-23099656, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-23099656, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-23099656} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-23099656, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-23099656, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-23099656, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-23099656|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-23099656} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:21:07,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:21:07,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:21:07,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:21:07,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1366355049 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1366355049 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1366355049| ~y$w_buff1~0_In1366355049) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1366355049| ~y~0_In1366355049) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1366355049, ~y~0=~y~0_In1366355049, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1366355049, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1366355049} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1366355049|, ~y$w_buff1~0=~y$w_buff1~0_In1366355049, ~y~0=~y~0_In1366355049, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1366355049, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1366355049} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:21:07,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-11-28 18:21:07,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1939844252 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1939844252 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1939844252 |ULTIMATE.start_main_#t~ite42_Out-1939844252|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite42_Out-1939844252| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1939844252, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1939844252} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1939844252, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1939844252, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1939844252|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:21:07,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1580302432 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1580302432 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1580302432 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1580302432 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1580302432| ~y$w_buff1_used~0_In-1580302432) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite43_Out-1580302432| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1580302432, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1580302432, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1580302432, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1580302432} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1580302432, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1580302432, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1580302432|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1580302432, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1580302432} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:21:07,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2058170109 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2058170109 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-2058170109| 0)) (and (= |ULTIMATE.start_main_#t~ite44_Out-2058170109| ~y$r_buff0_thd0~0_In-2058170109) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2058170109, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2058170109} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2058170109, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2058170109, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-2058170109|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:21:07,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1350216292 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1350216292 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1350216292 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1350216292 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1350216292| ~y$r_buff1_thd0~0_In-1350216292) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-1350216292|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1350216292, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1350216292, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1350216292, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1350216292} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1350216292, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1350216292, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1350216292, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1350216292|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1350216292} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:21:07,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_13) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:21:07,512 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:21:07,512 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:21:07,514 INFO L168 Benchmark]: Toolchain (without parser) took 15519.71 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 466.1 MB). Free memory was 956.3 MB in the beginning and 931.6 MB in the end (delta: 24.7 MB). Peak memory consumption was 490.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:21:07,515 INFO L168 Benchmark]: CDTParser took 1.00 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:21:07,516 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -113.1 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:21:07,516 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.14 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:21:07,517 INFO L168 Benchmark]: Boogie Preprocessor took 39.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:21:07,517 INFO L168 Benchmark]: RCFGBuilder took 798.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:21:07,518 INFO L168 Benchmark]: TraceAbstraction took 13737.22 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 363.3 MB). Free memory was 1.0 GB in the beginning and 944.7 MB in the end (delta: 72.2 MB). Peak memory consumption was 435.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:21:07,519 INFO L168 Benchmark]: Witness Printer took 93.77 ms. Allocated memory is still 1.5 GB. Free memory was 944.7 MB in the beginning and 931.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:21:07,523 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.00 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 780.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -113.1 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.14 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 798.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13737.22 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 363.3 MB). Free memory was 1.0 GB in the beginning and 944.7 MB in the end (delta: 72.2 MB). Peak memory consumption was 435.6 MB. Max. memory is 11.5 GB. * Witness Printer took 93.77 ms. Allocated memory is still 1.5 GB. Free memory was 944.7 MB in the beginning and 931.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4653 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 209 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1555, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t1556, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 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 [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.4s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1402 SDtfs, 1742 SDslu, 3051 SDs, 0 SdLazy, 2369 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 5845 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 421 NumberOfCodeBlocks, 421 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 357 ConstructedInterpolants, 0 QuantifiedInterpolants, 70635 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...