./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix034_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/mix034_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 586905fd6d18b653e017f1f614979fdf0ba4a3cb ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:12:32,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:12:32,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:12:32,869 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:12:32,870 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:12:32,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:12:32,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:12:32,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:12:32,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:12:32,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:12:32,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:12:32,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:12:32,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:12:32,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:12:32,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:12:32,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:12:32,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:12:32,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:12:32,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:12:32,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:12:32,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:12:32,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:12:32,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:12:32,919 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:12:32,921 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:12:32,922 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:12:32,922 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:12:32,924 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:12:32,924 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:12:32,925 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:12:32,926 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:12:32,926 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:12:32,927 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:12:32,928 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:12:32,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:12:32,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:12:32,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:12:32,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:12:32,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:12:32,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:12:32,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:12:32,935 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:12:32,953 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:12:32,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:12:32,955 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:12:32,955 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:12:32,955 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:12:32,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:12:32,956 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:12:32,956 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:12:32,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:12:32,957 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:12:32,957 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:12:32,957 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:12:32,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:12:32,958 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:12:32,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:12:32,958 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:12:32,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:12:32,959 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:12:32,959 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:12:32,960 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:12:32,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:12:32,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:12:32,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:12:32,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:12:32,961 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:12:32,961 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:12:32,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:12:32,962 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:12:32,962 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:12:32,963 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 -> 586905fd6d18b653e017f1f614979fdf0ba4a3cb [2019-11-28 18:12:33,265 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:12:33,284 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:12:33,287 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:12:33,288 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:12:33,288 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:12:33,289 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix034_rmo.opt.i [2019-11-28 18:12:33,354 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d3ca0c93/0fdc34aa0a9943aa93ddd5fc446e0070/FLAG00777ba5f [2019-11-28 18:12:33,920 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:12:33,921 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix034_rmo.opt.i [2019-11-28 18:12:33,941 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d3ca0c93/0fdc34aa0a9943aa93ddd5fc446e0070/FLAG00777ba5f [2019-11-28 18:12:34,190 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d3ca0c93/0fdc34aa0a9943aa93ddd5fc446e0070 [2019-11-28 18:12:34,193 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:12:34,195 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:12:34,196 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:12:34,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:12:34,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:12:34,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:12:34" (1/1) ... [2019-11-28 18:12:34,202 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:12:34, skipping insertion in model container [2019-11-28 18:12:34,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:12:34" (1/1) ... [2019-11-28 18:12:34,208 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:12:34,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:12:34,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:12:34,724 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:12:34,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:12:34,910 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:12:34,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:34 WrapperNode [2019-11-28 18:12:34,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:12:34,912 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:12:34,912 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:12:34,912 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:12:34,921 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:12:34" (1/1) ... [2019-11-28 18:12:34,946 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:12:34" (1/1) ... [2019-11-28 18:12:34,976 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:12:34,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:12:34,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:12:34,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:12:34,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:34" (1/1) ... [2019-11-28 18:12:34,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:34" (1/1) ... [2019-11-28 18:12:34,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:34" (1/1) ... [2019-11-28 18:12:34,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:34" (1/1) ... [2019-11-28 18:12:35,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:34" (1/1) ... [2019-11-28 18:12:35,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:34" (1/1) ... [2019-11-28 18:12:35,009 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:34" (1/1) ... [2019-11-28 18:12:35,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:12:35,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:12:35,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:12:35,015 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:12:35,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:34" (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:12:35,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:12:35,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:12:35,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:12:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:12:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:12:35,079 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:12:35,079 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:12:35,080 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:12:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:12:35,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:12:35,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:12:35,082 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:12:35,767 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:12:35,769 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:12:35,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:35 BoogieIcfgContainer [2019-11-28 18:12:35,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:12:35,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:12:35,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:12:35,776 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:12:35,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:12:34" (1/3) ... [2019-11-28 18:12:35,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d283633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:12:35, skipping insertion in model container [2019-11-28 18:12:35,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:34" (2/3) ... [2019-11-28 18:12:35,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d283633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:12:35, skipping insertion in model container [2019-11-28 18:12:35,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:35" (3/3) ... [2019-11-28 18:12:35,780 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_rmo.opt.i [2019-11-28 18:12:35,789 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:12:35,790 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:12:35,797 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:12:35,798 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:12:35,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,834 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,834 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,835 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,835 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,836 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,846 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,847 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,858 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,859 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,860 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,861 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,862 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,865 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:35,893 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:12:35,909 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:12:35,909 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:12:35,909 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:12:35,910 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:12:35,910 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:12:35,910 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:12:35,910 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:12:35,910 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:12:35,930 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 183 transitions [2019-11-28 18:12:35,932 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-11-28 18:12:36,043 INFO L134 PetriNetUnfolder]: 41/181 cut-off events. [2019-11-28 18:12:36,043 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:12:36,058 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 578 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:12:36,080 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 149 places, 183 transitions [2019-11-28 18:12:36,125 INFO L134 PetriNetUnfolder]: 41/181 cut-off events. [2019-11-28 18:12:36,125 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:12:36,135 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 181 events. 41/181 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 578 event pairs. 6/144 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:12:36,153 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:12:36,154 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:12:41,120 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-11-28 18:12:41,231 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-28 18:12:41,496 INFO L206 etLargeBlockEncoding]: Checked pairs total: 72636 [2019-11-28 18:12:41,496 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-11-28 18:12:41,500 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-11-28 18:12:42,312 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8766 states. [2019-11-28 18:12:42,316 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states. [2019-11-28 18:12:42,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:12:42,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:42,329 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:12:42,330 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:12:42,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:42,340 INFO L82 PathProgramCache]: Analyzing trace with hash 798122, now seen corresponding path program 1 times [2019-11-28 18:12:42,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:42,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066046384] [2019-11-28 18:12:42,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:42,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:42,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066046384] [2019-11-28 18:12:42,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:42,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:12:42,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697956210] [2019-11-28 18:12:42,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:42,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:42,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:42,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:42,724 INFO L87 Difference]: Start difference. First operand 8766 states. Second operand 3 states. [2019-11-28 18:12:42,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:42,966 INFO L93 Difference]: Finished difference Result 8598 states and 28114 transitions. [2019-11-28 18:12:42,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:42,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:12:42,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:43,054 INFO L225 Difference]: With dead ends: 8598 [2019-11-28 18:12:43,054 INFO L226 Difference]: Without dead ends: 7662 [2019-11-28 18:12:43,056 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:12:43,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7662 states. [2019-11-28 18:12:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7662 to 7662. [2019-11-28 18:12:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7662 states. [2019-11-28 18:12:43,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7662 states to 7662 states and 24964 transitions. [2019-11-28 18:12:43,509 INFO L78 Accepts]: Start accepts. Automaton has 7662 states and 24964 transitions. Word has length 3 [2019-11-28 18:12:43,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:43,510 INFO L462 AbstractCegarLoop]: Abstraction has 7662 states and 24964 transitions. [2019-11-28 18:12:43,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:43,510 INFO L276 IsEmpty]: Start isEmpty. Operand 7662 states and 24964 transitions. [2019-11-28 18:12:43,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:12:43,518 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:43,518 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:43,518 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:12:43,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:43,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1441761450, now seen corresponding path program 1 times [2019-11-28 18:12:43,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:43,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698621854] [2019-11-28 18:12:43,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:43,647 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:12:43,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698621854] [2019-11-28 18:12:43,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:43,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:43,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059831559] [2019-11-28 18:12:43,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:43,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:43,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:43,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:43,651 INFO L87 Difference]: Start difference. First operand 7662 states and 24964 transitions. Second operand 3 states. [2019-11-28 18:12:43,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:43,693 INFO L93 Difference]: Finished difference Result 1232 states and 2811 transitions. [2019-11-28 18:12:43,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:43,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-28 18:12:43,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:43,704 INFO L225 Difference]: With dead ends: 1232 [2019-11-28 18:12:43,705 INFO L226 Difference]: Without dead ends: 1232 [2019-11-28 18:12:43,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:43,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-11-28 18:12:43,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-11-28 18:12:43,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-11-28 18:12:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2811 transitions. [2019-11-28 18:12:43,745 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2811 transitions. Word has length 11 [2019-11-28 18:12:43,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:43,746 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2811 transitions. [2019-11-28 18:12:43,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:43,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2811 transitions. [2019-11-28 18:12:43,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:12:43,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:43,753 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:43,754 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:12:43,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:43,754 INFO L82 PathProgramCache]: Analyzing trace with hash -973399749, now seen corresponding path program 1 times [2019-11-28 18:12:43,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:43,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641932285] [2019-11-28 18:12:43,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:43,855 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:12:43,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641932285] [2019-11-28 18:12:43,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:43,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:43,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353518109] [2019-11-28 18:12:43,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:43,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:43,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:43,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:43,859 INFO L87 Difference]: Start difference. First operand 1232 states and 2811 transitions. Second operand 3 states. [2019-11-28 18:12:43,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:43,923 INFO L93 Difference]: Finished difference Result 1943 states and 4408 transitions. [2019-11-28 18:12:43,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:43,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:12:43,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:43,935 INFO L225 Difference]: With dead ends: 1943 [2019-11-28 18:12:43,935 INFO L226 Difference]: Without dead ends: 1943 [2019-11-28 18:12:43,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:43,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2019-11-28 18:12:43,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1365. [2019-11-28 18:12:43,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2019-11-28 18:12:43,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 3186 transitions. [2019-11-28 18:12:43,984 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 3186 transitions. Word has length 14 [2019-11-28 18:12:43,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:43,985 INFO L462 AbstractCegarLoop]: Abstraction has 1365 states and 3186 transitions. [2019-11-28 18:12:43,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:43,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 3186 transitions. [2019-11-28 18:12:43,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:12:43,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:43,987 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:43,987 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:12:43,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:43,988 INFO L82 PathProgramCache]: Analyzing trace with hash -895424426, now seen corresponding path program 1 times [2019-11-28 18:12:43,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:43,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633924322] [2019-11-28 18:12:43,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:44,067 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:12:44,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633924322] [2019-11-28 18:12:44,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:44,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:44,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759552163] [2019-11-28 18:12:44,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:44,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:44,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:44,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:44,072 INFO L87 Difference]: Start difference. First operand 1365 states and 3186 transitions. Second operand 4 states. [2019-11-28 18:12:44,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:44,316 INFO L93 Difference]: Finished difference Result 1724 states and 3916 transitions. [2019-11-28 18:12:44,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:44,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:12:44,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:44,326 INFO L225 Difference]: With dead ends: 1724 [2019-11-28 18:12:44,327 INFO L226 Difference]: Without dead ends: 1724 [2019-11-28 18:12:44,327 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:12:44,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2019-11-28 18:12:44,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1660. [2019-11-28 18:12:44,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-11-28 18:12:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 3792 transitions. [2019-11-28 18:12:44,369 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 3792 transitions. Word has length 14 [2019-11-28 18:12:44,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:44,369 INFO L462 AbstractCegarLoop]: Abstraction has 1660 states and 3792 transitions. [2019-11-28 18:12:44,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:44,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 3792 transitions. [2019-11-28 18:12:44,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:12:44,370 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:44,371 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:44,371 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:12:44,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:44,372 INFO L82 PathProgramCache]: Analyzing trace with hash -270244683, now seen corresponding path program 1 times [2019-11-28 18:12:44,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:44,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93515336] [2019-11-28 18:12:44,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:44,432 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:12:44,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93515336] [2019-11-28 18:12:44,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:44,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:44,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008804428] [2019-11-28 18:12:44,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:44,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:44,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:44,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:44,435 INFO L87 Difference]: Start difference. First operand 1660 states and 3792 transitions. Second operand 4 states. [2019-11-28 18:12:44,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:44,612 INFO L93 Difference]: Finished difference Result 1991 states and 4482 transitions. [2019-11-28 18:12:44,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:44,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:12:44,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:44,623 INFO L225 Difference]: With dead ends: 1991 [2019-11-28 18:12:44,624 INFO L226 Difference]: Without dead ends: 1991 [2019-11-28 18:12:44,624 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:12:44,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-11-28 18:12:44,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1731. [2019-11-28 18:12:44,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2019-11-28 18:12:44,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 3946 transitions. [2019-11-28 18:12:44,665 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 3946 transitions. Word has length 14 [2019-11-28 18:12:44,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:44,665 INFO L462 AbstractCegarLoop]: Abstraction has 1731 states and 3946 transitions. [2019-11-28 18:12:44,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:44,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 3946 transitions. [2019-11-28 18:12:44,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 18:12:44,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:44,669 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:12:44,669 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:12:44,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:44,669 INFO L82 PathProgramCache]: Analyzing trace with hash 2057308803, now seen corresponding path program 1 times [2019-11-28 18:12:44,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:44,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991384984] [2019-11-28 18:12:44,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:44,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:12:44,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991384984] [2019-11-28 18:12:44,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:44,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:44,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810445533] [2019-11-28 18:12:44,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:44,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:44,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:44,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:44,851 INFO L87 Difference]: Start difference. First operand 1731 states and 3946 transitions. Second operand 5 states. [2019-11-28 18:12:45,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:45,121 INFO L93 Difference]: Finished difference Result 2258 states and 4996 transitions. [2019-11-28 18:12:45,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:12:45,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-28 18:12:45,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:45,133 INFO L225 Difference]: With dead ends: 2258 [2019-11-28 18:12:45,134 INFO L226 Difference]: Without dead ends: 2258 [2019-11-28 18:12:45,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:45,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2019-11-28 18:12:45,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2002. [2019-11-28 18:12:45,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2002 states. [2019-11-28 18:12:45,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 4502 transitions. [2019-11-28 18:12:45,187 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 4502 transitions. Word has length 24 [2019-11-28 18:12:45,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:45,188 INFO L462 AbstractCegarLoop]: Abstraction has 2002 states and 4502 transitions. [2019-11-28 18:12:45,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:45,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 4502 transitions. [2019-11-28 18:12:45,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:12:45,191 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:45,192 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] [2019-11-28 18:12:45,192 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:12:45,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:45,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1461081411, now seen corresponding path program 1 times [2019-11-28 18:12:45,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:45,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999146221] [2019-11-28 18:12:45,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:45,302 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:12:45,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999146221] [2019-11-28 18:12:45,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:45,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:12:45,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361861877] [2019-11-28 18:12:45,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:45,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:45,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:45,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:45,304 INFO L87 Difference]: Start difference. First operand 2002 states and 4502 transitions. Second operand 5 states. [2019-11-28 18:12:45,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:45,759 INFO L93 Difference]: Finished difference Result 2854 states and 6297 transitions. [2019-11-28 18:12:45,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:12:45,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:12:45,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:45,767 INFO L225 Difference]: With dead ends: 2854 [2019-11-28 18:12:45,768 INFO L226 Difference]: Without dead ends: 2854 [2019-11-28 18:12:45,768 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:12:45,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2019-11-28 18:12:45,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 2447. [2019-11-28 18:12:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2447 states. [2019-11-28 18:12:45,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 5484 transitions. [2019-11-28 18:12:45,821 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 5484 transitions. Word has length 26 [2019-11-28 18:12:45,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:45,821 INFO L462 AbstractCegarLoop]: Abstraction has 2447 states and 5484 transitions. [2019-11-28 18:12:45,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:45,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 5484 transitions. [2019-11-28 18:12:45,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:12:45,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:45,825 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] [2019-11-28 18:12:45,826 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:12:45,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:45,826 INFO L82 PathProgramCache]: Analyzing trace with hash 605769272, now seen corresponding path program 1 times [2019-11-28 18:12:45,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:45,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232321288] [2019-11-28 18:12:45,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:45,921 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:12:45,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232321288] [2019-11-28 18:12:45,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:45,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:45,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504785087] [2019-11-28 18:12:45,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:45,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:45,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:45,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:45,923 INFO L87 Difference]: Start difference. First operand 2447 states and 5484 transitions. Second operand 5 states. [2019-11-28 18:12:46,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:46,181 INFO L93 Difference]: Finished difference Result 2949 states and 6475 transitions. [2019-11-28 18:12:46,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:12:46,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:12:46,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:46,194 INFO L225 Difference]: With dead ends: 2949 [2019-11-28 18:12:46,194 INFO L226 Difference]: Without dead ends: 2949 [2019-11-28 18:12:46,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:46,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2019-11-28 18:12:46,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 2382. [2019-11-28 18:12:46,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2382 states. [2019-11-28 18:12:46,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 5344 transitions. [2019-11-28 18:12:46,248 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 5344 transitions. Word has length 26 [2019-11-28 18:12:46,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:46,249 INFO L462 AbstractCegarLoop]: Abstraction has 2382 states and 5344 transitions. [2019-11-28 18:12:46,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 5344 transitions. [2019-11-28 18:12:46,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:12:46,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:46,253 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:12:46,253 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:12:46,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:46,254 INFO L82 PathProgramCache]: Analyzing trace with hash 461323697, now seen corresponding path program 1 times [2019-11-28 18:12:46,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:46,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622315132] [2019-11-28 18:12:46,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:46,366 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:12:46,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622315132] [2019-11-28 18:12:46,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:46,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:46,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531155072] [2019-11-28 18:12:46,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:46,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:46,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:46,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:46,368 INFO L87 Difference]: Start difference. First operand 2382 states and 5344 transitions. Second operand 4 states. [2019-11-28 18:12:46,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:46,388 INFO L93 Difference]: Finished difference Result 2381 states and 5342 transitions. [2019-11-28 18:12:46,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:12:46,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-28 18:12:46,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:46,395 INFO L225 Difference]: With dead ends: 2381 [2019-11-28 18:12:46,395 INFO L226 Difference]: Without dead ends: 2381 [2019-11-28 18:12:46,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:46,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2019-11-28 18:12:46,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 2381. [2019-11-28 18:12:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2381 states. [2019-11-28 18:12:46,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 5342 transitions. [2019-11-28 18:12:46,443 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 5342 transitions. Word has length 27 [2019-11-28 18:12:46,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:46,443 INFO L462 AbstractCegarLoop]: Abstraction has 2381 states and 5342 transitions. [2019-11-28 18:12:46,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:46,443 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 5342 transitions. [2019-11-28 18:12:46,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:12:46,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:46,447 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] [2019-11-28 18:12:46,448 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:12:46,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:46,448 INFO L82 PathProgramCache]: Analyzing trace with hash 93559855, now seen corresponding path program 1 times [2019-11-28 18:12:46,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:46,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144926310] [2019-11-28 18:12:46,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:46,504 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:12:46,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144926310] [2019-11-28 18:12:46,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:46,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:46,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381771313] [2019-11-28 18:12:46,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:46,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:46,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:46,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:46,506 INFO L87 Difference]: Start difference. First operand 2381 states and 5342 transitions. Second operand 4 states. [2019-11-28 18:12:46,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:46,522 INFO L93 Difference]: Finished difference Result 1330 states and 2854 transitions. [2019-11-28 18:12:46,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:12:46,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-28 18:12:46,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:46,526 INFO L225 Difference]: With dead ends: 1330 [2019-11-28 18:12:46,526 INFO L226 Difference]: Without dead ends: 1330 [2019-11-28 18:12:46,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:46,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2019-11-28 18:12:46,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1235. [2019-11-28 18:12:46,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2019-11-28 18:12:46,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 2679 transitions. [2019-11-28 18:12:46,551 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 2679 transitions. Word has length 28 [2019-11-28 18:12:46,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:46,551 INFO L462 AbstractCegarLoop]: Abstraction has 1235 states and 2679 transitions. [2019-11-28 18:12:46,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:46,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 2679 transitions. [2019-11-28 18:12:46,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 18:12:46,558 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:46,558 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] [2019-11-28 18:12:46,558 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:12:46,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:46,559 INFO L82 PathProgramCache]: Analyzing trace with hash -466202404, now seen corresponding path program 1 times [2019-11-28 18:12:46,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:46,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060701577] [2019-11-28 18:12:46,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:46,677 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:12:46,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060701577] [2019-11-28 18:12:46,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:46,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:12:46,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350837412] [2019-11-28 18:12:46,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:12:46,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:46,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:12:46,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:12:46,679 INFO L87 Difference]: Start difference. First operand 1235 states and 2679 transitions. Second operand 6 states. [2019-11-28 18:12:47,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:47,329 INFO L93 Difference]: Finished difference Result 1625 states and 3433 transitions. [2019-11-28 18:12:47,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:12:47,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-11-28 18:12:47,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:47,332 INFO L225 Difference]: With dead ends: 1625 [2019-11-28 18:12:47,332 INFO L226 Difference]: Without dead ends: 1625 [2019-11-28 18:12:47,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:12:47,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2019-11-28 18:12:47,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1289. [2019-11-28 18:12:47,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1289 states. [2019-11-28 18:12:47,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 2791 transitions. [2019-11-28 18:12:47,356 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 2791 transitions. Word has length 50 [2019-11-28 18:12:47,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:47,357 INFO L462 AbstractCegarLoop]: Abstraction has 1289 states and 2791 transitions. [2019-11-28 18:12:47,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:12:47,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 2791 transitions. [2019-11-28 18:12:47,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 18:12:47,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:47,361 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] [2019-11-28 18:12:47,361 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:12:47,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:47,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1640582438, now seen corresponding path program 2 times [2019-11-28 18:12:47,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:47,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364497617] [2019-11-28 18:12:47,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:47,421 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:12:47,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364497617] [2019-11-28 18:12:47,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:47,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:47,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98651174] [2019-11-28 18:12:47,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:47,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:47,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:47,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:47,423 INFO L87 Difference]: Start difference. First operand 1289 states and 2791 transitions. Second operand 3 states. [2019-11-28 18:12:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:47,474 INFO L93 Difference]: Finished difference Result 1646 states and 3525 transitions. [2019-11-28 18:12:47,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:47,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 18:12:47,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:47,478 INFO L225 Difference]: With dead ends: 1646 [2019-11-28 18:12:47,479 INFO L226 Difference]: Without dead ends: 1646 [2019-11-28 18:12:47,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:12:47,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2019-11-28 18:12:47,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1333. [2019-11-28 18:12:47,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-11-28 18:12:47,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 2894 transitions. [2019-11-28 18:12:47,509 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 2894 transitions. Word has length 50 [2019-11-28 18:12:47,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:47,510 INFO L462 AbstractCegarLoop]: Abstraction has 1333 states and 2894 transitions. [2019-11-28 18:12:47,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:47,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 2894 transitions. [2019-11-28 18:12:47,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:12:47,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:47,515 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:12:47,515 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:12:47,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:47,516 INFO L82 PathProgramCache]: Analyzing trace with hash -475366277, now seen corresponding path program 1 times [2019-11-28 18:12:47,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:47,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685395938] [2019-11-28 18:12:47,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:47,582 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:12:47,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685395938] [2019-11-28 18:12:47,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:47,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:47,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606175569] [2019-11-28 18:12:47,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:47,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:47,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:47,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:47,584 INFO L87 Difference]: Start difference. First operand 1333 states and 2894 transitions. Second operand 3 states. [2019-11-28 18:12:47,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:47,600 INFO L93 Difference]: Finished difference Result 1332 states and 2892 transitions. [2019-11-28 18:12:47,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:47,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 18:12:47,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:47,604 INFO L225 Difference]: With dead ends: 1332 [2019-11-28 18:12:47,604 INFO L226 Difference]: Without dead ends: 1332 [2019-11-28 18:12:47,605 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:12:47,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2019-11-28 18:12:47,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1082. [2019-11-28 18:12:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1082 states. [2019-11-28 18:12:47,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 2405 transitions. [2019-11-28 18:12:47,628 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 2405 transitions. Word has length 51 [2019-11-28 18:12:47,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:47,629 INFO L462 AbstractCegarLoop]: Abstraction has 1082 states and 2405 transitions. [2019-11-28 18:12:47,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:47,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 2405 transitions. [2019-11-28 18:12:47,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:12:47,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:47,632 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:12:47,632 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:47,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:47,633 INFO L82 PathProgramCache]: Analyzing trace with hash 953721779, now seen corresponding path program 1 times [2019-11-28 18:12:47,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:47,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516592938] [2019-11-28 18:12:47,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:47,762 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:12:47,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516592938] [2019-11-28 18:12:47,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:47,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:12:47,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065619670] [2019-11-28 18:12:47,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:12:47,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:47,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:12:47,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:47,764 INFO L87 Difference]: Start difference. First operand 1082 states and 2405 transitions. Second operand 7 states. [2019-11-28 18:12:48,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:48,057 INFO L93 Difference]: Finished difference Result 2908 states and 6314 transitions. [2019-11-28 18:12:48,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:12:48,058 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:12:48,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:48,063 INFO L225 Difference]: With dead ends: 2908 [2019-11-28 18:12:48,063 INFO L226 Difference]: Without dead ends: 1983 [2019-11-28 18:12:48,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:12:48,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2019-11-28 18:12:48,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1139. [2019-11-28 18:12:48,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2019-11-28 18:12:48,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 2528 transitions. [2019-11-28 18:12:48,093 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 2528 transitions. Word has length 52 [2019-11-28 18:12:48,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:48,094 INFO L462 AbstractCegarLoop]: Abstraction has 1139 states and 2528 transitions. [2019-11-28 18:12:48,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:12:48,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 2528 transitions. [2019-11-28 18:12:48,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:12:48,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:48,097 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:12:48,098 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:48,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:48,098 INFO L82 PathProgramCache]: Analyzing trace with hash 860763375, now seen corresponding path program 2 times [2019-11-28 18:12:48,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:48,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714643657] [2019-11-28 18:12:48,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:48,208 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:12:48,209 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:12:48,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t907~0.base_35|) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 |v_ULTIMATE.start_main_~#t907~0.offset_24|) (= 0 v_~z$flush_delayed~0_37) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t907~0.base_35| 4) |v_#length_15|) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~weak$$choice2~0_106 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t907~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t907~0.base_35|) |v_ULTIMATE.start_main_~#t907~0.offset_24| 0)) |v_#memory_int_15|) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t907~0.base_35| 1)) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t907~0.base_35|)) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, #length=|v_#length_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ULTIMATE.start_main_~#t907~0.offset=|v_ULTIMATE.start_main_~#t907~0.offset_24|, ULTIMATE.start_main_~#t908~0.base=|v_ULTIMATE.start_main_~#t908~0.base_17|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t908~0.offset=|v_ULTIMATE.start_main_~#t908~0.offset_15|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t907~0.base=|v_ULTIMATE.start_main_~#t907~0.base_35|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t907~0.offset, ULTIMATE.start_main_~#t908~0.base, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t908~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_~#t907~0.base, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-11-28 18:12:48,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t908~0.base_13|)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t908~0.base_13| 1) |v_#valid_29|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t908~0.base_13|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t908~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t908~0.base_13|) |v_ULTIMATE.start_main_~#t908~0.offset_11| 1)) |v_#memory_int_9|) (= 0 |v_ULTIMATE.start_main_~#t908~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t908~0.base_13| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t908~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t908~0.offset=|v_ULTIMATE.start_main_~#t908~0.offset_11|, ULTIMATE.start_main_~#t908~0.base=|v_ULTIMATE.start_main_~#t908~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t908~0.offset, ULTIMATE.start_main_~#t908~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-11-28 18:12:48,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff1_used~0_Out-1210423467 ~z$w_buff0_used~0_In-1210423467) (= |P0Thread1of1ForFork0_#in~arg.offset_In-1210423467| P0Thread1of1ForFork0_~arg.offset_Out-1210423467) (= ~z$w_buff0~0_In-1210423467 ~z$w_buff1~0_Out-1210423467) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1210423467| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1210423467) (= |P0Thread1of1ForFork0_#in~arg.base_In-1210423467| P0Thread1of1ForFork0_~arg.base_Out-1210423467) (= ~z$w_buff0_used~0_Out-1210423467 1) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1210423467| (ite (not (and (not (= 0 (mod ~z$w_buff1_used~0_Out-1210423467 256))) (not (= (mod ~z$w_buff0_used~0_Out-1210423467 256) 0)))) 1 0)) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1210423467)) (= 1 ~z$w_buff0~0_Out-1210423467)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1210423467|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1210423467, ~z$w_buff0~0=~z$w_buff0~0_In-1210423467, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1210423467|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1210423467|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1210423467, ~z$w_buff0~0=~z$w_buff0~0_Out-1210423467, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1210423467, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1210423467, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1210423467|, ~z$w_buff1~0=~z$w_buff1~0_Out-1210423467, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-1210423467, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1210423467|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-1210423467} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:12:48,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-575162735 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite23_In-575162735| |P1Thread1of1ForFork1_#t~ite23_Out-575162735|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite24_Out-575162735| ~z$w_buff1_used~0_In-575162735)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-575162735 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd2~0_In-575162735 256)) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In-575162735 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-575162735 256)))) .cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out-575162735| |P1Thread1of1ForFork1_#t~ite24_Out-575162735|) (= |P1Thread1of1ForFork1_#t~ite23_Out-575162735| ~z$w_buff1_used~0_In-575162735)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-575162735, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-575162735, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-575162735, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-575162735|, ~weak$$choice2~0=~weak$$choice2~0_In-575162735, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-575162735} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-575162735, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-575162735, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-575162735|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-575162735, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-575162735|, ~weak$$choice2~0=~weak$$choice2~0_In-575162735, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-575162735} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-11-28 18:12:48,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite28_49| |v_P1Thread1of1ForFork1_#t~ite28_48|) (= |v_P1Thread1of1ForFork1_#t~ite29_44| |v_P1Thread1of1ForFork1_#t~ite29_45|) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_38|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_45|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_49|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_44|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_38|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_24|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_48|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_27|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:12:48,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-11-28 18:12:48,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1002015962 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1002015962 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1002015962|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1002015962 |P0Thread1of1ForFork0_#t~ite5_Out-1002015962|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1002015962, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1002015962} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1002015962|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1002015962, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1002015962} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:12:48,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1892658668 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-1892658668 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-1892658668 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1892658668 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1892658668 |P0Thread1of1ForFork0_#t~ite6_Out-1892658668|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1892658668|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1892658668, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1892658668, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1892658668, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1892658668} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1892658668|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1892658668, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1892658668, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1892658668, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1892658668} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:12:48,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In841633989 256))) (.cse0 (= ~z$r_buff0_thd1~0_In841633989 ~z$r_buff0_thd1~0_Out841633989)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In841633989 256)))) (or (and .cse0 .cse1) (and (not .cse1) (not .cse2) (= 0 ~z$r_buff0_thd1~0_Out841633989)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In841633989, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In841633989} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In841633989, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out841633989|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out841633989} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:12:48,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In644589061 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In644589061 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In644589061 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In644589061 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out644589061| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out644589061| ~z$r_buff1_thd1~0_In644589061) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In644589061, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In644589061, ~z$w_buff1_used~0=~z$w_buff1_used~0_In644589061, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In644589061} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In644589061, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out644589061|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In644589061, ~z$w_buff1_used~0=~z$w_buff1_used~0_In644589061, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In644589061} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:12:48,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In1782165688 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1782165688 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite32_Out1782165688| |P1Thread1of1ForFork1_#t~ite33_Out1782165688|))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out1782165688| ~z$w_buff1~0_In1782165688) .cse1 (not .cse2)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out1782165688| ~z~0_In1782165688) (or .cse2 .cse0) .cse1))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1782165688, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1782165688, ~z$w_buff1~0=~z$w_buff1~0_In1782165688, ~z~0=~z~0_In1782165688} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1782165688, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1782165688, ~z$w_buff1~0=~z$w_buff1~0_In1782165688, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1782165688|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1782165688|, ~z~0=~z~0_In1782165688} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:12:48,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1863230857 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1863230857 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out1863230857| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out1863230857| ~z$w_buff0_used~0_In1863230857) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1863230857, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1863230857} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1863230857, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1863230857|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1863230857} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:12:48,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd2~0_In-1366434930 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1366434930 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1366434930 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-1366434930 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1366434930| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite35_Out-1366434930| ~z$w_buff1_used~0_In-1366434930) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1366434930, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1366434930, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1366434930, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1366434930} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1366434930, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1366434930, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1366434930, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1366434930|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1366434930} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:12:48,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In505485861 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In505485861 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out505485861|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In505485861 |P1Thread1of1ForFork1_#t~ite36_Out505485861|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In505485861, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In505485861} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In505485861, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In505485861, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out505485861|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:12:48,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1828538026 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1828538026 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In1828538026 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1828538026 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1828538026|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd2~0_In1828538026 |P1Thread1of1ForFork1_#t~ite37_Out1828538026|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1828538026, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1828538026, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1828538026, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1828538026} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1828538026, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1828538026, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1828538026, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1828538026, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1828538026|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:12:48,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:12:48,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:12:48,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_22) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-11-28 18:12:48,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-625304708 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-625304708 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-625304708| ~z$w_buff1~0_In-625304708)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-625304708| ~z~0_In-625304708)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-625304708, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-625304708, ~z$w_buff1~0=~z$w_buff1~0_In-625304708, ~z~0=~z~0_In-625304708} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-625304708|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-625304708, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-625304708, ~z$w_buff1~0=~z$w_buff1~0_In-625304708, ~z~0=~z~0_In-625304708} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:48,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-11-28 18:12:48,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1390879965 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1390879965 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1390879965 |ULTIMATE.start_main_#t~ite42_Out-1390879965|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-1390879965|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1390879965, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1390879965} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1390879965, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1390879965, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1390879965|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:12:48,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1390565776 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In1390565776 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1390565776 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1390565776 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1390565776|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In1390565776 |ULTIMATE.start_main_#t~ite43_Out1390565776|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1390565776, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1390565776, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1390565776, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1390565776} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1390565776, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1390565776, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1390565776, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1390565776, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1390565776|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:12:48,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1524769268 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1524769268 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1524769268| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out1524769268| ~z$r_buff0_thd0~0_In1524769268) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1524769268, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1524769268} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1524769268, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1524769268, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1524769268|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:12:48,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1882938618 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1882938618 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1882938618 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1882938618 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out1882938618| 0)) (and (= |ULTIMATE.start_main_#t~ite45_Out1882938618| ~z$r_buff1_thd0~0_In1882938618) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1882938618, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1882938618, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1882938618, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1882938618} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1882938618, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1882938618, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1882938618, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1882938618, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1882938618|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:12:48,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:12:48,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:12:48 BasicIcfg [2019-11-28 18:12:48,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:12:48,341 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:12:48,341 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:12:48,342 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:12:48,342 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:35" (3/4) ... [2019-11-28 18:12:48,345 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:12:48,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L804: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_86) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t907~0.base_35|) (= v_~z$w_buff1_used~0_473 0) (= v_~z$r_buff0_thd0~0_147 0) (= 0 |v_ULTIMATE.start_main_~#t907~0.offset_24|) (= 0 v_~z$flush_delayed~0_37) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t907~0.base_35| 4) |v_#length_15|) (= v_~y~0_17 0) (= v_~z$w_buff0~0_405 0) (= v_~z$r_buff1_thd2~0_225 0) (= v_~z$w_buff1~0_248 0) (= v_~z~0_137 0) (= v_~main$tmp_guard0~0_15 0) (= v_~z$r_buff1_thd1~0_122 0) (= v_~__unbuffered_p1_EBX~0_35 0) (= 0 v_~__unbuffered_cnt~0_56) (= v_~weak$$choice2~0_106 0) (= 0 v_~__unbuffered_p1_EAX~0_37) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t907~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t907~0.base_35|) |v_ULTIMATE.start_main_~#t907~0.offset_24| 0)) |v_#memory_int_15|) (= v_~z$r_buff1_thd0~0_141 0) (= v_~z$read_delayed_var~0.offset_7 0) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t907~0.base_35| 1)) (= v_~z$r_buff0_thd2~0_374 0) (= 0 v_~weak$$choice0~0_18) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t907~0.base_35|)) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff0_used~0_734 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x~0_79 0) (= v_~z$r_buff0_thd1~0_206 0) (= 0 |v_#NULL.base_5|) (= v_~z$mem_tmp~0_21 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_225, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_248, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_271|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_129|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_75|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_86, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_141, #length=|v_#length_15|, ~y~0=v_~y~0_17, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_374, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ULTIMATE.start_main_~#t907~0.offset=|v_ULTIMATE.start_main_~#t907~0.offset_24|, ULTIMATE.start_main_~#t908~0.base=|v_ULTIMATE.start_main_~#t908~0.base_17|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_734, ~z$w_buff0~0=v_~z$w_buff0~0_405, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_473, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_15, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t908~0.offset=|v_ULTIMATE.start_main_~#t908~0.offset_15|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_55|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_122, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t907~0.base=|v_ULTIMATE.start_main_~#t907~0.base_35|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_17|, ~z~0=v_~z~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_106, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_206, ~x~0=v_~x~0_79} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t907~0.offset, ULTIMATE.start_main_~#t908~0.base, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t908~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_~#t907~0.base, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-11-28 18:12:48,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L804-1-->L806: Formula: (and (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t908~0.base_13|)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t908~0.base_13| 1) |v_#valid_29|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t908~0.base_13|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t908~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t908~0.base_13|) |v_ULTIMATE.start_main_~#t908~0.offset_11| 1)) |v_#memory_int_9|) (= 0 |v_ULTIMATE.start_main_~#t908~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t908~0.base_13| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t908~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t908~0.offset=|v_ULTIMATE.start_main_~#t908~0.offset_11|, ULTIMATE.start_main_~#t908~0.base=|v_ULTIMATE.start_main_~#t908~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t908~0.offset, ULTIMATE.start_main_~#t908~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-11-28 18:12:48,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff1_used~0_Out-1210423467 ~z$w_buff0_used~0_In-1210423467) (= |P0Thread1of1ForFork0_#in~arg.offset_In-1210423467| P0Thread1of1ForFork0_~arg.offset_Out-1210423467) (= ~z$w_buff0~0_In-1210423467 ~z$w_buff1~0_Out-1210423467) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1210423467| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1210423467) (= |P0Thread1of1ForFork0_#in~arg.base_In-1210423467| P0Thread1of1ForFork0_~arg.base_Out-1210423467) (= ~z$w_buff0_used~0_Out-1210423467 1) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1210423467| (ite (not (and (not (= 0 (mod ~z$w_buff1_used~0_Out-1210423467 256))) (not (= (mod ~z$w_buff0_used~0_Out-1210423467 256) 0)))) 1 0)) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1210423467)) (= 1 ~z$w_buff0~0_Out-1210423467)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1210423467|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1210423467, ~z$w_buff0~0=~z$w_buff0~0_In-1210423467, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1210423467|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1210423467|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1210423467, ~z$w_buff0~0=~z$w_buff0~0_Out-1210423467, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1210423467, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1210423467, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1210423467|, ~z$w_buff1~0=~z$w_buff1~0_Out-1210423467, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-1210423467, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1210423467|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-1210423467} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:12:48,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L773-->L773-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-575162735 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite23_In-575162735| |P1Thread1of1ForFork1_#t~ite23_Out-575162735|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite24_Out-575162735| ~z$w_buff1_used~0_In-575162735)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-575162735 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd2~0_In-575162735 256)) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In-575162735 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-575162735 256)))) .cse0 (= |P1Thread1of1ForFork1_#t~ite23_Out-575162735| |P1Thread1of1ForFork1_#t~ite24_Out-575162735|) (= |P1Thread1of1ForFork1_#t~ite23_Out-575162735| ~z$w_buff1_used~0_In-575162735)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-575162735, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-575162735, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-575162735, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-575162735|, ~weak$$choice2~0=~weak$$choice2~0_In-575162735, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-575162735} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-575162735, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-575162735, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-575162735|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-575162735, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-575162735|, ~weak$$choice2~0=~weak$$choice2~0_In-575162735, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-575162735} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-11-28 18:12:48,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L774-->L775-8: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite28_49| |v_P1Thread1of1ForFork1_#t~ite28_48|) (= |v_P1Thread1of1ForFork1_#t~ite29_44| |v_P1Thread1of1ForFork1_#t~ite29_45|) (= v_~z$r_buff1_thd2~0_205 |v_P1Thread1of1ForFork1_#t~ite30_38|) (= v_~z$r_buff0_thd2~0_355 v_~z$r_buff0_thd2~0_354) (not (= 0 (mod v_~weak$$choice2~0_96 256)))) InVars {P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_45|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_355, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_49|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_44|, P1Thread1of1ForFork1_#t~ite30=|v_P1Thread1of1ForFork1_#t~ite30_38|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ~weak$$choice2~0=v_~weak$$choice2~0_96, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_24|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_354, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_48|, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_27|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_29|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite28, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:12:48,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L777-->L781: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_31 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_31} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-11-28 18:12:48,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L743-->L743-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1002015962 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1002015962 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1002015962|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1002015962 |P0Thread1of1ForFork0_#t~ite5_Out-1002015962|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1002015962, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1002015962} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1002015962|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1002015962, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1002015962} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:12:48,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L744-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1892658668 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-1892658668 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-1892658668 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1892658668 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1892658668 |P0Thread1of1ForFork0_#t~ite6_Out-1892658668|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1892658668|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1892658668, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1892658668, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1892658668, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1892658668} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1892658668|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1892658668, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1892658668, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1892658668, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1892658668} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:12:48,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L745-->L746: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In841633989 256))) (.cse0 (= ~z$r_buff0_thd1~0_In841633989 ~z$r_buff0_thd1~0_Out841633989)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In841633989 256)))) (or (and .cse0 .cse1) (and (not .cse1) (not .cse2) (= 0 ~z$r_buff0_thd1~0_Out841633989)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In841633989, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In841633989} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In841633989, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out841633989|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out841633989} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:12:48,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L746-->L746-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In644589061 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In644589061 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In644589061 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In644589061 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out644589061| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite8_Out644589061| ~z$r_buff1_thd1~0_In644589061) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In644589061, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In644589061, ~z$w_buff1_used~0=~z$w_buff1_used~0_In644589061, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In644589061} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In644589061, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out644589061|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In644589061, ~z$w_buff1_used~0=~z$w_buff1_used~0_In644589061, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In644589061} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:12:48,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L781-2-->L781-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In1782165688 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1782165688 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite32_Out1782165688| |P1Thread1of1ForFork1_#t~ite33_Out1782165688|))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out1782165688| ~z$w_buff1~0_In1782165688) .cse1 (not .cse2)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out1782165688| ~z~0_In1782165688) (or .cse2 .cse0) .cse1))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1782165688, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1782165688, ~z$w_buff1~0=~z$w_buff1~0_In1782165688, ~z~0=~z~0_In1782165688} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1782165688, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1782165688, ~z$w_buff1~0=~z$w_buff1~0_In1782165688, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1782165688|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1782165688|, ~z~0=~z~0_In1782165688} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:12:48,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1863230857 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1863230857 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out1863230857| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out1863230857| ~z$w_buff0_used~0_In1863230857) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1863230857, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1863230857} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1863230857, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1863230857|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1863230857} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:12:48,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L783-->L783-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd2~0_In-1366434930 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1366434930 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1366434930 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-1366434930 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1366434930| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite35_Out-1366434930| ~z$w_buff1_used~0_In-1366434930) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1366434930, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1366434930, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1366434930, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1366434930} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1366434930, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1366434930, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1366434930, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1366434930|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1366434930} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:12:48,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L784-->L784-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In505485861 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In505485861 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out505485861|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In505485861 |P1Thread1of1ForFork1_#t~ite36_Out505485861|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In505485861, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In505485861} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In505485861, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In505485861, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out505485861|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:12:48,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1828538026 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1828538026 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In1828538026 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1828538026 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1828538026|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd2~0_In1828538026 |P1Thread1of1ForFork1_#t~ite37_Out1828538026|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1828538026, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1828538026, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1828538026, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1828538026} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1828538026, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1828538026, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1828538026, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1828538026, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1828538026|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:12:48,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L785-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_128 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:12:48,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L746-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= v_~z$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:12:48,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-1-->L812: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_22) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-11-28 18:12:48,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L812-2-->L812-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-625304708 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-625304708 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-625304708| ~z$w_buff1~0_In-625304708)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-625304708| ~z~0_In-625304708)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-625304708, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-625304708, ~z$w_buff1~0=~z$w_buff1~0_In-625304708, ~z~0=~z~0_In-625304708} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-625304708|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-625304708, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-625304708, ~z$w_buff1~0=~z$w_buff1~0_In-625304708, ~z~0=~z~0_In-625304708} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:48,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L812-4-->L813: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-11-28 18:12:48,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1390879965 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1390879965 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1390879965 |ULTIMATE.start_main_#t~ite42_Out-1390879965|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-1390879965|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1390879965, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1390879965} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1390879965, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1390879965, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1390879965|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:12:48,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1390565776 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In1390565776 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1390565776 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1390565776 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1390565776|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In1390565776 |ULTIMATE.start_main_#t~ite43_Out1390565776|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1390565776, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1390565776, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1390565776, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1390565776} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1390565776, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1390565776, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1390565776, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1390565776, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1390565776|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:12:48,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1524769268 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1524769268 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1524769268| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out1524769268| ~z$r_buff0_thd0~0_In1524769268) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1524769268, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1524769268} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1524769268, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1524769268, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1524769268|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:12:48,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1882938618 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1882938618 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1882938618 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1882938618 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out1882938618| 0)) (and (= |ULTIMATE.start_main_#t~ite45_Out1882938618| ~z$r_buff1_thd0~0_In1882938618) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1882938618, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1882938618, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1882938618, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1882938618} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1882938618, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1882938618, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1882938618, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1882938618, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1882938618|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:12:48,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L816-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_52) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_15) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_15 256)) (= |v_ULTIMATE.start_main_#t~ite45_42| v_~z$r_buff1_thd0~0_93)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_52, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_93, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_41|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:12:48,452 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:12:48,452 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:12:48,454 INFO L168 Benchmark]: Toolchain (without parser) took 14259.50 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 441.5 MB). Free memory was 956.3 MB in the beginning and 1.2 GB in the end (delta: -223.5 MB). Peak memory consumption was 218.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:48,455 INFO L168 Benchmark]: CDTParser took 0.30 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:12:48,456 INFO L168 Benchmark]: CACSL2BoogieTranslator took 715.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -159.2 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:48,456 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:48,457 INFO L168 Benchmark]: Boogie Preprocessor took 38.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:12:48,457 INFO L168 Benchmark]: RCFGBuilder took 757.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:48,458 INFO L168 Benchmark]: TraceAbstraction took 12567.62 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 299.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -144.3 MB). Peak memory consumption was 155.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:48,459 INFO L168 Benchmark]: Witness Printer took 111.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:48,462 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 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 715.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -159.2 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 757.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12567.62 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 299.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -144.3 MB). Peak memory consumption was 155.1 MB. Max. memory is 11.5 GB. * Witness Printer took 111.21 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 149 ProgramPointsBefore, 76 ProgramPointsAfterwards, 183 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 11 FixpointIterations, 31 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 26 ChoiceCompositions, 4657 VarBasedMoverChecksPositive, 296 VarBasedMoverChecksNegative, 137 SemBasedMoverChecksPositive, 234 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 72636 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L804] FCALL, FORK 0 pthread_create(&t907, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] FCALL, FORK 0 pthread_create(&t908, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L812] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.3s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1817 SDtfs, 1325 SDslu, 3283 SDs, 0 SdLazy, 1767 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 23 SyntacticMatches, 10 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8766occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 3970 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 442 NumberOfCodeBlocks, 442 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 376 ConstructedInterpolants, 0 QuantifiedInterpolants, 59804 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...