./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix041_rmo.oepc.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/mix041_rmo.oepc.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 e927e7a5126aed7aac7859f17d61db0365ac12ee .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:14:53,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:14:53,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:14:53,902 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:14:53,902 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:14:53,903 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:14:53,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:14:53,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:14:53,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:14:53,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:14:53,911 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:14:53,913 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:14:53,913 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:14:53,914 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:14:53,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:14:53,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:14:53,918 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:14:53,919 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:14:53,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:14:53,923 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:14:53,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:14:53,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:14:53,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:14:53,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:14:53,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:14:53,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:14:53,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:14:53,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:14:53,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:14:53,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:14:53,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:14:53,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:14:53,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:14:53,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:14:53,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:14:53,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:14:53,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:14:53,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:14:53,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:14:53,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:14:53,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:14:53,950 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:14:53,972 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:14:53,972 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:14:53,974 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:14:53,975 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:14:53,975 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:14:53,975 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:14:53,976 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:14:53,976 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:14:53,976 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:14:53,976 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:14:53,978 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:14:53,978 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:14:53,978 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:14:53,979 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:14:53,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:14:53,979 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:14:53,980 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:14:53,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:14:53,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:14:53,981 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:14:53,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:14:53,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:14:53,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:14:53,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:14:53,982 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:14:53,983 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:14:53,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:14:53,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:14:53,983 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:14:53,984 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 -> e927e7a5126aed7aac7859f17d61db0365ac12ee [2019-11-28 18:14:54,368 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:14:54,382 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:14:54,386 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:14:54,388 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:14:54,388 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:14:54,389 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix041_rmo.oepc.i [2019-11-28 18:14:54,465 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d547285ac/7b74e0fdd66248e5b444292a6645315e/FLAGd4b9c4712 [2019-11-28 18:14:55,053 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:14:55,054 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix041_rmo.oepc.i [2019-11-28 18:14:55,078 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d547285ac/7b74e0fdd66248e5b444292a6645315e/FLAGd4b9c4712 [2019-11-28 18:14:55,281 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d547285ac/7b74e0fdd66248e5b444292a6645315e [2019-11-28 18:14:55,284 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:14:55,286 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:14:55,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:14:55,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:14:55,291 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:14:55,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:14:55" (1/1) ... [2019-11-28 18:14:55,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a736f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:55, skipping insertion in model container [2019-11-28 18:14:55,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:14:55" (1/1) ... [2019-11-28 18:14:55,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:14:55,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:14:55,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:14:55,885 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:14:55,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:14:56,040 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:14:56,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:56 WrapperNode [2019-11-28 18:14:56,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:14:56,042 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:14:56,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:14:56,042 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:14:56,051 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:14:56" (1/1) ... [2019-11-28 18:14:56,070 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:14:56" (1/1) ... [2019-11-28 18:14:56,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:14:56,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:14:56,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:14:56,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:14:56,114 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:56" (1/1) ... [2019-11-28 18:14:56,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:56" (1/1) ... [2019-11-28 18:14:56,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:56" (1/1) ... [2019-11-28 18:14:56,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:56" (1/1) ... [2019-11-28 18:14:56,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:56" (1/1) ... [2019-11-28 18:14:56,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:56" (1/1) ... [2019-11-28 18:14:56,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:56" (1/1) ... [2019-11-28 18:14:56,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:14:56,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:14:56,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:14:56,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:14:56,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:56" (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:14:56,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:14:56,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:14:56,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:14:56,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:14:56,231 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:14:56,232 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:14:56,232 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:14:56,232 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:14:56,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:14:56,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:14:56,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:14:56,235 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:14:56,935 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:14:56,935 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:14:56,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:14:56 BoogieIcfgContainer [2019-11-28 18:14:56,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:14:56,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:14:56,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:14:56,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:14:56,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:14:55" (1/3) ... [2019-11-28 18:14:56,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3c72af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:14:56, skipping insertion in model container [2019-11-28 18:14:56,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:56" (2/3) ... [2019-11-28 18:14:56,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3c72af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:14:56, skipping insertion in model container [2019-11-28 18:14:56,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:14:56" (3/3) ... [2019-11-28 18:14:56,948 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_rmo.oepc.i [2019-11-28 18:14:56,958 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:14:56,959 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:14:56,967 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:14:56,968 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:14:57,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,008 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,008 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,008 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,008 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,009 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,018 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,018 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:57,083 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:14:57,102 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:14:57,102 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:14:57,102 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:14:57,103 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:14:57,103 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:14:57,103 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:14:57,103 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:14:57,103 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:14:57,121 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-11-28 18:14:57,124 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-11-28 18:14:57,212 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-11-28 18:14:57,213 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:14:57,230 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 576 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:14:57,254 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-11-28 18:14:57,301 INFO L134 PetriNetUnfolder]: 41/180 cut-off events. [2019-11-28 18:14:57,301 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:14:57,310 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 576 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:14:57,330 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:14:57,331 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:15:01,575 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-11-28 18:15:01,698 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-28 18:15:02,197 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82827 [2019-11-28 18:15:02,198 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-11-28 18:15:02,202 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-11-28 18:15:02,907 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-11-28 18:15:02,911 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-11-28 18:15:02,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:15:02,923 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:02,925 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:15:02,926 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:15:02,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:02,936 INFO L82 PathProgramCache]: Analyzing trace with hash 792296, now seen corresponding path program 1 times [2019-11-28 18:15:02,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:02,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767222521] [2019-11-28 18:15:02,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:03,393 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:15:03,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767222521] [2019-11-28 18:15:03,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:03,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:15:03,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626866519] [2019-11-28 18:15:03,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:15:03,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:03,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:15:03,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:15:03,436 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-11-28 18:15:03,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:03,794 INFO L93 Difference]: Finished difference Result 8506 states and 27908 transitions. [2019-11-28 18:15:03,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:15:03,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:15:03,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:03,905 INFO L225 Difference]: With dead ends: 8506 [2019-11-28 18:15:03,913 INFO L226 Difference]: Without dead ends: 7522 [2019-11-28 18:15:03,915 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:15:04,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7522 states. [2019-11-28 18:15:04,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7522 to 7522. [2019-11-28 18:15:04,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7522 states. [2019-11-28 18:15:04,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7522 states to 7522 states and 24586 transitions. [2019-11-28 18:15:04,317 INFO L78 Accepts]: Start accepts. Automaton has 7522 states and 24586 transitions. Word has length 3 [2019-11-28 18:15:04,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:04,317 INFO L462 AbstractCegarLoop]: Abstraction has 7522 states and 24586 transitions. [2019-11-28 18:15:04,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:15:04,317 INFO L276 IsEmpty]: Start isEmpty. Operand 7522 states and 24586 transitions. [2019-11-28 18:15:04,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:15:04,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:04,321 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:04,321 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:15:04,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:04,322 INFO L82 PathProgramCache]: Analyzing trace with hash -476377294, now seen corresponding path program 1 times [2019-11-28 18:15:04,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:04,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812369919] [2019-11-28 18:15:04,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:04,445 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:15:04,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812369919] [2019-11-28 18:15:04,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:04,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:15:04,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885671755] [2019-11-28 18:15:04,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:15:04,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:04,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:15:04,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:15:04,449 INFO L87 Difference]: Start difference. First operand 7522 states and 24586 transitions. Second operand 4 states. [2019-11-28 18:15:04,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:04,849 INFO L93 Difference]: Finished difference Result 11740 states and 36692 transitions. [2019-11-28 18:15:04,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:15:04,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:15:04,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:04,935 INFO L225 Difference]: With dead ends: 11740 [2019-11-28 18:15:04,936 INFO L226 Difference]: Without dead ends: 11726 [2019-11-28 18:15:04,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:15:05,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11726 states. [2019-11-28 18:15:05,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11726 to 10436. [2019-11-28 18:15:05,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10436 states. [2019-11-28 18:15:05,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10436 states to 10436 states and 33285 transitions. [2019-11-28 18:15:05,486 INFO L78 Accepts]: Start accepts. Automaton has 10436 states and 33285 transitions. Word has length 11 [2019-11-28 18:15:05,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:05,486 INFO L462 AbstractCegarLoop]: Abstraction has 10436 states and 33285 transitions. [2019-11-28 18:15:05,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:15:05,487 INFO L276 IsEmpty]: Start isEmpty. Operand 10436 states and 33285 transitions. [2019-11-28 18:15:05,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:15:05,492 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:05,492 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:05,493 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:15:05,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:05,493 INFO L82 PathProgramCache]: Analyzing trace with hash 394534895, now seen corresponding path program 1 times [2019-11-28 18:15:05,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:05,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662436093] [2019-11-28 18:15:05,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:05,546 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:15:05,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662436093] [2019-11-28 18:15:05,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:05,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:15:05,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751509282] [2019-11-28 18:15:05,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:15:05,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:05,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:15:05,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:15:05,548 INFO L87 Difference]: Start difference. First operand 10436 states and 33285 transitions. Second operand 3 states. [2019-11-28 18:15:05,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:05,698 INFO L93 Difference]: Finished difference Result 15866 states and 49520 transitions. [2019-11-28 18:15:05,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:15:05,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:15:05,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:05,756 INFO L225 Difference]: With dead ends: 15866 [2019-11-28 18:15:05,756 INFO L226 Difference]: Without dead ends: 15866 [2019-11-28 18:15:05,757 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:15:05,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15866 states. [2019-11-28 18:15:06,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15866 to 11795. [2019-11-28 18:15:06,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11795 states. [2019-11-28 18:15:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11795 states to 11795 states and 37291 transitions. [2019-11-28 18:15:06,223 INFO L78 Accepts]: Start accepts. Automaton has 11795 states and 37291 transitions. Word has length 14 [2019-11-28 18:15:06,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:06,225 INFO L462 AbstractCegarLoop]: Abstraction has 11795 states and 37291 transitions. [2019-11-28 18:15:06,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:15:06,225 INFO L276 IsEmpty]: Start isEmpty. Operand 11795 states and 37291 transitions. [2019-11-28 18:15:06,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:15:06,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:06,229 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:06,230 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:15:06,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:06,230 INFO L82 PathProgramCache]: Analyzing trace with hash 304327747, now seen corresponding path program 1 times [2019-11-28 18:15:06,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:06,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095788236] [2019-11-28 18:15:06,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:06,337 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:15:06,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095788236] [2019-11-28 18:15:06,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:06,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:15:06,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247082789] [2019-11-28 18:15:06,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:15:06,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:06,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:15:06,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:15:06,340 INFO L87 Difference]: Start difference. First operand 11795 states and 37291 transitions. Second operand 4 states. [2019-11-28 18:15:06,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:06,600 INFO L93 Difference]: Finished difference Result 14131 states and 44142 transitions. [2019-11-28 18:15:06,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:15:06,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:15:06,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:06,653 INFO L225 Difference]: With dead ends: 14131 [2019-11-28 18:15:06,653 INFO L226 Difference]: Without dead ends: 14131 [2019-11-28 18:15:06,654 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:15:06,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14131 states. [2019-11-28 18:15:07,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14131 to 12855. [2019-11-28 18:15:07,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12855 states. [2019-11-28 18:15:07,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12855 states to 12855 states and 40501 transitions. [2019-11-28 18:15:07,271 INFO L78 Accepts]: Start accepts. Automaton has 12855 states and 40501 transitions. Word has length 14 [2019-11-28 18:15:07,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:07,271 INFO L462 AbstractCegarLoop]: Abstraction has 12855 states and 40501 transitions. [2019-11-28 18:15:07,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:15:07,271 INFO L276 IsEmpty]: Start isEmpty. Operand 12855 states and 40501 transitions. [2019-11-28 18:15:07,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:15:07,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:07,274 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:07,274 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:15:07,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:07,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1071051512, now seen corresponding path program 1 times [2019-11-28 18:15:07,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:07,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295400196] [2019-11-28 18:15:07,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:07,384 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:15:07,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295400196] [2019-11-28 18:15:07,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:07,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:15:07,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021166130] [2019-11-28 18:15:07,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:15:07,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:07,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:15:07,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:15:07,386 INFO L87 Difference]: Start difference. First operand 12855 states and 40501 transitions. Second operand 4 states. [2019-11-28 18:15:07,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:07,642 INFO L93 Difference]: Finished difference Result 15545 states and 48643 transitions. [2019-11-28 18:15:07,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:15:07,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:15:07,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:07,714 INFO L225 Difference]: With dead ends: 15545 [2019-11-28 18:15:07,714 INFO L226 Difference]: Without dead ends: 15545 [2019-11-28 18:15:07,715 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:15:07,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15545 states. [2019-11-28 18:15:08,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15545 to 13090. [2019-11-28 18:15:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13090 states. [2019-11-28 18:15:08,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13090 states to 13090 states and 41334 transitions. [2019-11-28 18:15:08,122 INFO L78 Accepts]: Start accepts. Automaton has 13090 states and 41334 transitions. Word has length 14 [2019-11-28 18:15:08,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:08,123 INFO L462 AbstractCegarLoop]: Abstraction has 13090 states and 41334 transitions. [2019-11-28 18:15:08,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:15:08,123 INFO L276 IsEmpty]: Start isEmpty. Operand 13090 states and 41334 transitions. [2019-11-28 18:15:08,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:15:08,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:08,128 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:08,128 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:15:08,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:08,129 INFO L82 PathProgramCache]: Analyzing trace with hash -2143506472, now seen corresponding path program 1 times [2019-11-28 18:15:08,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:08,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306533463] [2019-11-28 18:15:08,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:08,197 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:15:08,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306533463] [2019-11-28 18:15:08,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:08,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:15:08,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896509455] [2019-11-28 18:15:08,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:15:08,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:08,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:15:08,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:15:08,201 INFO L87 Difference]: Start difference. First operand 13090 states and 41334 transitions. Second operand 3 states. [2019-11-28 18:15:08,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:08,271 INFO L93 Difference]: Finished difference Result 13090 states and 40732 transitions. [2019-11-28 18:15:08,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:15:08,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:15:08,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:08,295 INFO L225 Difference]: With dead ends: 13090 [2019-11-28 18:15:08,295 INFO L226 Difference]: Without dead ends: 13090 [2019-11-28 18:15:08,296 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:15:08,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13090 states. [2019-11-28 18:15:08,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13090 to 13010. [2019-11-28 18:15:08,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13010 states. [2019-11-28 18:15:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13010 states to 13010 states and 40500 transitions. [2019-11-28 18:15:08,676 INFO L78 Accepts]: Start accepts. Automaton has 13010 states and 40500 transitions. Word has length 16 [2019-11-28 18:15:08,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:08,677 INFO L462 AbstractCegarLoop]: Abstraction has 13010 states and 40500 transitions. [2019-11-28 18:15:08,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:15:08,677 INFO L276 IsEmpty]: Start isEmpty. Operand 13010 states and 40500 transitions. [2019-11-28 18:15:08,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:15:08,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:08,682 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:08,683 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:15:08,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:08,683 INFO L82 PathProgramCache]: Analyzing trace with hash 241272403, now seen corresponding path program 1 times [2019-11-28 18:15:08,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:08,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424909432] [2019-11-28 18:15:08,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:08,754 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:15:08,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424909432] [2019-11-28 18:15:08,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:08,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:15:08,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957665879] [2019-11-28 18:15:08,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:15:08,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:08,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:15:08,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:15:08,757 INFO L87 Difference]: Start difference. First operand 13010 states and 40500 transitions. Second operand 3 states. [2019-11-28 18:15:08,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:08,905 INFO L93 Difference]: Finished difference Result 22298 states and 68842 transitions. [2019-11-28 18:15:08,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:15:08,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:15:08,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:08,958 INFO L225 Difference]: With dead ends: 22298 [2019-11-28 18:15:08,959 INFO L226 Difference]: Without dead ends: 19870 [2019-11-28 18:15:08,960 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:15:09,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19870 states. [2019-11-28 18:15:09,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19870 to 18980. [2019-11-28 18:15:09,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18980 states. [2019-11-28 18:15:09,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18980 states to 18980 states and 59240 transitions. [2019-11-28 18:15:09,829 INFO L78 Accepts]: Start accepts. Automaton has 18980 states and 59240 transitions. Word has length 16 [2019-11-28 18:15:09,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:09,829 INFO L462 AbstractCegarLoop]: Abstraction has 18980 states and 59240 transitions. [2019-11-28 18:15:09,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:15:09,830 INFO L276 IsEmpty]: Start isEmpty. Operand 18980 states and 59240 transitions. [2019-11-28 18:15:09,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:15:09,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:09,837 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:15:09,838 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:15:09,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:09,838 INFO L82 PathProgramCache]: Analyzing trace with hash -920380529, now seen corresponding path program 1 times [2019-11-28 18:15:09,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:09,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214246835] [2019-11-28 18:15:09,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:09,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:15:09,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214246835] [2019-11-28 18:15:09,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:09,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:15:09,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075684212] [2019-11-28 18:15:09,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:15:09,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:09,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:15:09,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:15:09,895 INFO L87 Difference]: Start difference. First operand 18980 states and 59240 transitions. Second operand 3 states. [2019-11-28 18:15:09,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:09,909 INFO L93 Difference]: Finished difference Result 2388 states and 5347 transitions. [2019-11-28 18:15:09,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:15:09,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 18:15:09,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:09,914 INFO L225 Difference]: With dead ends: 2388 [2019-11-28 18:15:09,914 INFO L226 Difference]: Without dead ends: 2388 [2019-11-28 18:15:09,915 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:15:09,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2019-11-28 18:15:09,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 2388. [2019-11-28 18:15:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2388 states. [2019-11-28 18:15:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 5347 transitions. [2019-11-28 18:15:09,951 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 5347 transitions. Word has length 17 [2019-11-28 18:15:09,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:09,952 INFO L462 AbstractCegarLoop]: Abstraction has 2388 states and 5347 transitions. [2019-11-28 18:15:09,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:15:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 5347 transitions. [2019-11-28 18:15:09,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 18:15:09,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:09,956 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] [2019-11-28 18:15:09,956 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:15:09,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:09,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1681809556, now seen corresponding path program 1 times [2019-11-28 18:15:09,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:09,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824388343] [2019-11-28 18:15:09,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:10,066 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:15:10,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824388343] [2019-11-28 18:15:10,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:10,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:15:10,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311006788] [2019-11-28 18:15:10,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:15:10,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:10,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:15:10,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:15:10,069 INFO L87 Difference]: Start difference. First operand 2388 states and 5347 transitions. Second operand 5 states. [2019-11-28 18:15:10,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:10,327 INFO L93 Difference]: Finished difference Result 2913 states and 6370 transitions. [2019-11-28 18:15:10,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:15:10,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 18:15:10,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:10,332 INFO L225 Difference]: With dead ends: 2913 [2019-11-28 18:15:10,332 INFO L226 Difference]: Without dead ends: 2913 [2019-11-28 18:15:10,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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:15:10,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2019-11-28 18:15:10,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 2438. [2019-11-28 18:15:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2438 states. [2019-11-28 18:15:10,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2438 states to 2438 states and 5449 transitions. [2019-11-28 18:15:10,373 INFO L78 Accepts]: Start accepts. Automaton has 2438 states and 5449 transitions. Word has length 25 [2019-11-28 18:15:10,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:10,373 INFO L462 AbstractCegarLoop]: Abstraction has 2438 states and 5449 transitions. [2019-11-28 18:15:10,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:15:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2438 states and 5449 transitions. [2019-11-28 18:15:10,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 18:15:10,377 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:10,377 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] [2019-11-28 18:15:10,378 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:15:10,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:10,378 INFO L82 PathProgramCache]: Analyzing trace with hash 968997935, now seen corresponding path program 1 times [2019-11-28 18:15:10,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:10,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753708230] [2019-11-28 18:15:10,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:10,407 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:15:10,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753708230] [2019-11-28 18:15:10,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:10,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:15:10,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919294113] [2019-11-28 18:15:10,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:15:10,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:10,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:15:10,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:15:10,409 INFO L87 Difference]: Start difference. First operand 2438 states and 5449 transitions. Second operand 3 states. [2019-11-28 18:15:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:10,447 INFO L93 Difference]: Finished difference Result 3081 states and 6522 transitions. [2019-11-28 18:15:10,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:15:10,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 18:15:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:10,451 INFO L225 Difference]: With dead ends: 3081 [2019-11-28 18:15:10,452 INFO L226 Difference]: Without dead ends: 3081 [2019-11-28 18:15:10,452 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:15:10,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2019-11-28 18:15:10,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2429. [2019-11-28 18:15:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2429 states. [2019-11-28 18:15:10,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2429 states to 2429 states and 5197 transitions. [2019-11-28 18:15:10,492 INFO L78 Accepts]: Start accepts. Automaton has 2429 states and 5197 transitions. Word has length 25 [2019-11-28 18:15:10,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:10,492 INFO L462 AbstractCegarLoop]: Abstraction has 2429 states and 5197 transitions. [2019-11-28 18:15:10,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:15:10,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 5197 transitions. [2019-11-28 18:15:10,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:15:10,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:10,496 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:15:10,496 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:15:10,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:10,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1286104553, now seen corresponding path program 1 times [2019-11-28 18:15:10,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:10,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620495801] [2019-11-28 18:15:10,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:10,593 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:15:10,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620495801] [2019-11-28 18:15:10,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:10,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:15:10,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694251144] [2019-11-28 18:15:10,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:15:10,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:10,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:15:10,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:15:10,596 INFO L87 Difference]: Start difference. First operand 2429 states and 5197 transitions. Second operand 5 states. [2019-11-28 18:15:10,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:10,828 INFO L93 Difference]: Finished difference Result 2847 states and 6006 transitions. [2019-11-28 18:15:10,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:15:10,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:15:10,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:10,833 INFO L225 Difference]: With dead ends: 2847 [2019-11-28 18:15:10,833 INFO L226 Difference]: Without dead ends: 2847 [2019-11-28 18:15:10,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 3 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:15:10,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2019-11-28 18:15:10,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 2388. [2019-11-28 18:15:10,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2388 states. [2019-11-28 18:15:10,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 5113 transitions. [2019-11-28 18:15:10,872 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 5113 transitions. Word has length 26 [2019-11-28 18:15:10,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:10,872 INFO L462 AbstractCegarLoop]: Abstraction has 2388 states and 5113 transitions. [2019-11-28 18:15:10,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:15:10,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 5113 transitions. [2019-11-28 18:15:10,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:15:10,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:10,877 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:15:10,878 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:15:10,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:10,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1804230119, now seen corresponding path program 1 times [2019-11-28 18:15:10,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:10,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553051762] [2019-11-28 18:15:10,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:10,934 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:15:10,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553051762] [2019-11-28 18:15:10,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:10,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:15:10,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093377978] [2019-11-28 18:15:10,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:15:10,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:10,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:15:10,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:15:10,936 INFO L87 Difference]: Start difference. First operand 2388 states and 5113 transitions. Second operand 4 states. [2019-11-28 18:15:10,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:10,951 INFO L93 Difference]: Finished difference Result 1174 states and 2488 transitions. [2019-11-28 18:15:10,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:15:10,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-28 18:15:10,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:10,953 INFO L225 Difference]: With dead ends: 1174 [2019-11-28 18:15:10,953 INFO L226 Difference]: Without dead ends: 1142 [2019-11-28 18:15:10,953 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:15:10,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2019-11-28 18:15:10,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 795. [2019-11-28 18:15:10,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2019-11-28 18:15:10,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1666 transitions. [2019-11-28 18:15:10,967 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1666 transitions. Word has length 28 [2019-11-28 18:15:10,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:10,967 INFO L462 AbstractCegarLoop]: Abstraction has 795 states and 1666 transitions. [2019-11-28 18:15:10,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:15:10,968 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1666 transitions. [2019-11-28 18:15:10,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:15:10,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:10,973 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:15:10,973 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:15:10,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:10,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1145830791, now seen corresponding path program 1 times [2019-11-28 18:15:10,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:10,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117123654] [2019-11-28 18:15:10,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:11,116 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:15:11,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117123654] [2019-11-28 18:15:11,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:11,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:15:11,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842187950] [2019-11-28 18:15:11,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:15:11,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:11,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:15:11,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:15:11,118 INFO L87 Difference]: Start difference. First operand 795 states and 1666 transitions. Second operand 6 states. [2019-11-28 18:15:11,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:11,641 INFO L93 Difference]: Finished difference Result 1385 states and 2829 transitions. [2019-11-28 18:15:11,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:15:11,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-28 18:15:11,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:11,643 INFO L225 Difference]: With dead ends: 1385 [2019-11-28 18:15:11,644 INFO L226 Difference]: Without dead ends: 1385 [2019-11-28 18:15:11,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 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:15:11,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2019-11-28 18:15:11,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1067. [2019-11-28 18:15:11,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1067 states. [2019-11-28 18:15:11,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 2226 transitions. [2019-11-28 18:15:11,660 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 2226 transitions. Word has length 52 [2019-11-28 18:15:11,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:11,660 INFO L462 AbstractCegarLoop]: Abstraction has 1067 states and 2226 transitions. [2019-11-28 18:15:11,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:15:11,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 2226 transitions. [2019-11-28 18:15:11,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:15:11,664 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:11,664 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:15:11,664 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:15:11,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:11,665 INFO L82 PathProgramCache]: Analyzing trace with hash -234851773, now seen corresponding path program 2 times [2019-11-28 18:15:11,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:11,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859667808] [2019-11-28 18:15:11,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:11,755 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:15:11,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859667808] [2019-11-28 18:15:11,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:11,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:15:11,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904326297] [2019-11-28 18:15:11,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:15:11,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:11,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:15:11,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:15:11,758 INFO L87 Difference]: Start difference. First operand 1067 states and 2226 transitions. Second operand 7 states. [2019-11-28 18:15:12,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:12,066 INFO L93 Difference]: Finished difference Result 2925 states and 5951 transitions. [2019-11-28 18:15:12,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:15:12,066 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:15:12,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:12,070 INFO L225 Difference]: With dead ends: 2925 [2019-11-28 18:15:12,070 INFO L226 Difference]: Without dead ends: 1958 [2019-11-28 18:15:12,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:15:12,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2019-11-28 18:15:12,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1127. [2019-11-28 18:15:12,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1127 states. [2019-11-28 18:15:12,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 2327 transitions. [2019-11-28 18:15:12,098 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 2327 transitions. Word has length 52 [2019-11-28 18:15:12,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:12,098 INFO L462 AbstractCegarLoop]: Abstraction has 1127 states and 2327 transitions. [2019-11-28 18:15:12,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:15:12,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 2327 transitions. [2019-11-28 18:15:12,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:15:12,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:12,103 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:15:12,103 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:15:12,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:12,104 INFO L82 PathProgramCache]: Analyzing trace with hash -480319677, now seen corresponding path program 3 times [2019-11-28 18:15:12,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:12,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105505708] [2019-11-28 18:15:12,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:15:12,273 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:15:12,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105505708] [2019-11-28 18:15:12,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:15:12,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:15:12,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103371052] [2019-11-28 18:15:12,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:15:12,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:15:12,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:15:12,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:15:12,275 INFO L87 Difference]: Start difference. First operand 1127 states and 2327 transitions. Second operand 5 states. [2019-11-28 18:15:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:15:12,337 INFO L93 Difference]: Finished difference Result 1319 states and 2723 transitions. [2019-11-28 18:15:12,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:15:12,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-11-28 18:15:12,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:15:12,339 INFO L225 Difference]: With dead ends: 1319 [2019-11-28 18:15:12,339 INFO L226 Difference]: Without dead ends: 1319 [2019-11-28 18:15:12,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:15:12,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-11-28 18:15:12,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1022. [2019-11-28 18:15:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1022 states. [2019-11-28 18:15:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 2138 transitions. [2019-11-28 18:15:12,360 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 2138 transitions. Word has length 52 [2019-11-28 18:15:12,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:15:12,360 INFO L462 AbstractCegarLoop]: Abstraction has 1022 states and 2138 transitions. [2019-11-28 18:15:12,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:15:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 2138 transitions. [2019-11-28 18:15:12,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:15:12,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:15:12,362 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, 1] [2019-11-28 18:15:12,363 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:15:12,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:15:12,363 INFO L82 PathProgramCache]: Analyzing trace with hash -409769665, now seen corresponding path program 1 times [2019-11-28 18:15:12,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:15:12,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325736470] [2019-11-28 18:15:12,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:15:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:15:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:15:12,843 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:15:12,844 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:15:12,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= v_~z$mem_tmp~0_25 0) (= v_~y~0_23 0) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t1097~0.base_27| 1)) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_98 0) (= v_~main$tmp_guard1~0_44 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1097~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1097~0.base_27|) |v_ULTIMATE.start_main_~#t1097~0.offset_19| 0)) |v_#memory_int_11|) (= v_~z$w_buff1~0_160 0) (= 0 v_~weak$$choice0~0_23) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$r_buff0_thd1~0_174 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1097~0.base_27|)) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p1_EAX~0_45) (= v_~z$w_buff0~0_252 0) (= v_~z~0_120 0) (= v_~z$r_buff0_thd0~0_134 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~main$tmp_guard0~0_20 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$flush_delayed~0_33) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1097~0.base_27|) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff1_thd2~0_196 0) (= v_~z$r_buff1_thd0~0_144 0) (= 0 v_~weak$$choice2~0_99) (= v_~z$w_buff0_used~0_606 0) (= |v_ULTIMATE.start_main_~#t1097~0.offset_19| 0) (= v_~z$w_buff1_used~0_306 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1097~0.base_27| 4)) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EBX~0_43 0) (= v_~z$r_buff0_thd2~0_279 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_196, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_160, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~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_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_370|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_93|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_134, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_45, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, #length=|v_#length_17|, ~y~0=v_~y~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_279, ULTIMATE.start_main_~#t1098~0.offset=|v_ULTIMATE.start_main_~#t1098~0.offset_14|, ~z$mem_tmp~0=v_~z$mem_tmp~0_25, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_43, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_606, ~z$w_buff0~0=v_~z$w_buff0~0_252, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_306, ~z$flush_delayed~0=v_~z$flush_delayed~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_main_~#t1097~0.base=|v_ULTIMATE.start_main_~#t1097~0.base_27|, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_23, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_58|, ULTIMATE.start_main_~#t1098~0.base=|v_ULTIMATE.start_main_~#t1098~0.base_22|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, #memory_int=|v_#memory_int_11|, 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_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~z~0=v_~z~0_120, ~weak$$choice2~0=v_~weak$$choice2~0_99, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_174, ULTIMATE.start_main_~#t1097~0.offset=|v_ULTIMATE.start_main_~#t1097~0.offset_19|, ~x~0=v_~x~0_98} 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_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1098~0.offset, ~z$mem_tmp~0, ~__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, ULTIMATE.start_main_~#t1097~0.base, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t1098~0.base, ~z$r_buff1_thd1~0, #memory_int, 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, ULTIMATE.start_main_~#t1097~0.offset, ~x~0] because there is no mapped edge [2019-11-28 18:15:12,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L4-->L740: Formula: (and (= ~z$r_buff0_thd1~0_In1521318692 ~z$r_buff1_thd1~0_Out1521318692) (= ~z$r_buff1_thd2~0_Out1521318692 ~z$r_buff0_thd2~0_In1521318692) (= 1 ~x~0_Out1521318692) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1521318692)) (= ~z$r_buff0_thd0~0_In1521318692 ~z$r_buff1_thd0~0_Out1521318692) (= 1 ~z$r_buff0_thd1~0_Out1521318692)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1521318692, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1521318692, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1521318692, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1521318692} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1521318692, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1521318692, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1521318692, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1521318692, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1521318692, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1521318692, ~x~0=~x~0_Out1521318692, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1521318692} AuxVars[] AssignedVars[~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-11-28 18:15:12,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L802-1-->L804: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1098~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1098~0.base_11| 0)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1098~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1098~0.base_11|) |v_ULTIMATE.start_main_~#t1098~0.offset_10| 1)) |v_#memory_int_5|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1098~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1098~0.base_11|) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1098~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t1098~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1098~0.offset=|v_ULTIMATE.start_main_~#t1098~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1098~0.base=|v_ULTIMATE.start_main_~#t1098~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1098~0.offset, ULTIMATE.start_main_~#t1098~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-11-28 18:15:12,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-1302662648 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1302662648 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1302662648| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1302662648 |P0Thread1of1ForFork0_#t~ite5_Out-1302662648|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1302662648, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1302662648} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1302662648|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1302662648, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1302662648} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:15:12,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1166939922 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-1166939922 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1166939922 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1166939922 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1166939922| ~z$w_buff1_used~0_In-1166939922) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1166939922| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1166939922, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1166939922, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1166939922, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1166939922} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1166939922|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1166939922, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1166939922, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1166939922, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1166939922} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:15:12,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse0 (= ~z$r_buff0_thd1~0_In1181693188 ~z$r_buff0_thd1~0_Out1181693188)) (.cse1 (= (mod ~z$w_buff0_used~0_In1181693188 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In1181693188 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (= 0 ~z$r_buff0_thd1~0_Out1181693188) (not .cse1) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1181693188, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1181693188} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1181693188, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1181693188|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1181693188} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:15:12,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In941548413 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In941548413 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In941548413 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In941548413 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In941548413 |P0Thread1of1ForFork0_#t~ite8_Out941548413|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out941548413|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In941548413, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In941548413, ~z$w_buff1_used~0=~z$w_buff1_used~0_In941548413, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In941548413} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In941548413, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out941548413|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In941548413, ~z$w_buff1_used~0=~z$w_buff1_used~0_In941548413, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In941548413} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:15:12,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L744-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} 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:15:12,859 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd2~0_61 v_~z$r_buff0_thd2~0_60)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_61} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_5|, ~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_60, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:15:12,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L773-->L773-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-489401594 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out-489401594| ~z$r_buff1_thd2~0_In-489401594) (= |P1Thread1of1ForFork1_#t~ite29_In-489401594| |P1Thread1of1ForFork1_#t~ite29_Out-489401594|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite30_Out-489401594| |P1Thread1of1ForFork1_#t~ite29_Out-489401594|) .cse0 (= ~z$r_buff1_thd2~0_In-489401594 |P1Thread1of1ForFork1_#t~ite29_Out-489401594|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-489401594 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-489401594 256))) (and (= 0 (mod ~z$w_buff1_used~0_In-489401594 256)) .cse1) (= (mod ~z$w_buff0_used~0_In-489401594 256) 0)))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-489401594|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-489401594, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-489401594, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-489401594, ~weak$$choice2~0=~weak$$choice2~0_In-489401594, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-489401594} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-489401594|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-489401594|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-489401594, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-489401594, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-489401594, ~weak$$choice2~0=~weak$$choice2~0_In-489401594, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-489401594} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:15:12,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= v_~z~0_27 v_~z$mem_tmp~0_6) (= 0 v_~z$flush_delayed~0_8) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-11-28 18:15:12,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1966608533 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1966608533 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In-1966608533 |P1Thread1of1ForFork1_#t~ite32_Out-1966608533|)) (and (not .cse1) (= ~z$w_buff1~0_In-1966608533 |P1Thread1of1ForFork1_#t~ite32_Out-1966608533|) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1966608533, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1966608533, ~z$w_buff1~0=~z$w_buff1~0_In-1966608533, ~z~0=~z~0_In-1966608533} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1966608533, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1966608533, ~z$w_buff1~0=~z$w_buff1~0_In-1966608533, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1966608533|, ~z~0=~z~0_In-1966608533} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:15:12,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~z~0_39 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~z~0=v_~z~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~z~0] because there is no mapped edge [2019-11-28 18:15:12,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-798487740 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-798487740 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-798487740| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-798487740| ~z$w_buff0_used~0_In-798487740)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-798487740, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-798487740} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-798487740, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-798487740|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-798487740} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:15:12,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In10079499 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In10079499 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In10079499 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In10079499 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out10079499|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In10079499 |P1Thread1of1ForFork1_#t~ite35_Out10079499|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In10079499, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In10079499, ~z$w_buff1_used~0=~z$w_buff1_used~0_In10079499, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In10079499} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In10079499, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In10079499, ~z$w_buff1_used~0=~z$w_buff1_used~0_In10079499, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out10079499|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In10079499} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:15:12,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1701444247 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1701444247 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In1701444247 |P1Thread1of1ForFork1_#t~ite36_Out1701444247|)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out1701444247| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1701444247, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1701444247} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1701444247, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1701444247, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1701444247|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:15:12,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1427951806 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1427951806 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1427951806 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-1427951806 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-1427951806| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$r_buff1_thd2~0_In-1427951806 |P1Thread1of1ForFork1_#t~ite37_Out-1427951806|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1427951806, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1427951806, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1427951806, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1427951806} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1427951806, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1427951806, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1427951806, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1427951806, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1427951806|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:15:12,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L783-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite37_22| v_~z$r_buff1_thd2~0_88) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_28 (+ v_~__unbuffered_cnt~0_29 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_88, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} 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:15:12,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L804-1-->L810: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_16) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, 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:15:12,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In424466076 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In424466076 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite41_Out424466076| |ULTIMATE.start_main_#t~ite40_Out424466076|))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In424466076 |ULTIMATE.start_main_#t~ite40_Out424466076|) .cse2) (and (= ~z~0_In424466076 |ULTIMATE.start_main_#t~ite40_Out424466076|) (or .cse0 .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In424466076, ~z$w_buff1_used~0=~z$w_buff1_used~0_In424466076, ~z$w_buff1~0=~z$w_buff1~0_In424466076, ~z~0=~z~0_In424466076} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out424466076|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out424466076|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In424466076, ~z$w_buff1_used~0=~z$w_buff1_used~0_In424466076, ~z$w_buff1~0=~z$w_buff1~0_In424466076, ~z~0=~z~0_In424466076} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:15:12,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1188766187 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1188766187 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-1188766187|)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1188766187 |ULTIMATE.start_main_#t~ite42_Out-1188766187|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1188766187, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1188766187} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1188766187, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1188766187, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1188766187|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:15:12,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-923529326 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-923529326 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-923529326 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-923529326 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-923529326| ~z$w_buff1_used~0_In-923529326) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite43_Out-923529326| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-923529326, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-923529326, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-923529326, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-923529326} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-923529326, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-923529326, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-923529326, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-923529326, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-923529326|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:15:12,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-519639578 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-519639578 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-519639578|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-519639578 |ULTIMATE.start_main_#t~ite44_Out-519639578|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-519639578, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-519639578} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-519639578, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-519639578, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-519639578|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:15:12,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1117416204 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1117416204 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1117416204 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1117416204 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1117416204| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-1117416204| ~z$r_buff1_thd0~0_In-1117416204) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1117416204, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1117416204, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1117416204, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1117416204} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1117416204, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1117416204, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1117416204, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1117416204, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1117416204|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:15:12,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_107 |v_ULTIMATE.start_main_#t~ite45_60|) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_28 0) (= 1 v_~__unbuffered_p1_EAX~0_28) (= v_~x~0_67 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_22) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_22 256))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_67, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_60|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_107, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~x~0=v_~x~0_67, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_59|, 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:15:12,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:15:12 BasicIcfg [2019-11-28 18:15:12,961 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:15:12,961 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:15:12,961 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:15:12,961 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:15:12,962 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:14:56" (3/4) ... [2019-11-28 18:15:12,964 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:15:12,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= v_~z$mem_tmp~0_25 0) (= v_~y~0_23 0) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t1097~0.base_27| 1)) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_98 0) (= v_~main$tmp_guard1~0_44 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1097~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1097~0.base_27|) |v_ULTIMATE.start_main_~#t1097~0.offset_19| 0)) |v_#memory_int_11|) (= v_~z$w_buff1~0_160 0) (= 0 v_~weak$$choice0~0_23) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$r_buff0_thd1~0_174 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1097~0.base_27|)) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p1_EAX~0_45) (= v_~z$w_buff0~0_252 0) (= v_~z~0_120 0) (= v_~z$r_buff0_thd0~0_134 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~main$tmp_guard0~0_20 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$flush_delayed~0_33) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1097~0.base_27|) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff1_thd2~0_196 0) (= v_~z$r_buff1_thd0~0_144 0) (= 0 v_~weak$$choice2~0_99) (= v_~z$w_buff0_used~0_606 0) (= |v_ULTIMATE.start_main_~#t1097~0.offset_19| 0) (= v_~z$w_buff1_used~0_306 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1097~0.base_27| 4)) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EBX~0_43 0) (= v_~z$r_buff0_thd2~0_279 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_196, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_160, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~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_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_370|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_93|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_134, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_45, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, #length=|v_#length_17|, ~y~0=v_~y~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_279, ULTIMATE.start_main_~#t1098~0.offset=|v_ULTIMATE.start_main_~#t1098~0.offset_14|, ~z$mem_tmp~0=v_~z$mem_tmp~0_25, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_43, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_606, ~z$w_buff0~0=v_~z$w_buff0~0_252, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_306, ~z$flush_delayed~0=v_~z$flush_delayed~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ULTIMATE.start_main_~#t1097~0.base=|v_ULTIMATE.start_main_~#t1097~0.base_27|, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_23, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_58|, ULTIMATE.start_main_~#t1098~0.base=|v_ULTIMATE.start_main_~#t1098~0.base_22|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, #memory_int=|v_#memory_int_11|, 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_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~z~0=v_~z~0_120, ~weak$$choice2~0=v_~weak$$choice2~0_99, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_174, ULTIMATE.start_main_~#t1097~0.offset=|v_ULTIMATE.start_main_~#t1097~0.offset_19|, ~x~0=v_~x~0_98} 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_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1098~0.offset, ~z$mem_tmp~0, ~__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, ULTIMATE.start_main_~#t1097~0.base, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~#t1098~0.base, ~z$r_buff1_thd1~0, #memory_int, 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, ULTIMATE.start_main_~#t1097~0.offset, ~x~0] because there is no mapped edge [2019-11-28 18:15:12,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L4-->L740: Formula: (and (= ~z$r_buff0_thd1~0_In1521318692 ~z$r_buff1_thd1~0_Out1521318692) (= ~z$r_buff1_thd2~0_Out1521318692 ~z$r_buff0_thd2~0_In1521318692) (= 1 ~x~0_Out1521318692) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1521318692)) (= ~z$r_buff0_thd0~0_In1521318692 ~z$r_buff1_thd0~0_Out1521318692) (= 1 ~z$r_buff0_thd1~0_Out1521318692)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1521318692, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1521318692, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1521318692, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1521318692} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1521318692, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1521318692, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1521318692, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1521318692, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1521318692, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1521318692, ~x~0=~x~0_Out1521318692, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1521318692} AuxVars[] AssignedVars[~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-11-28 18:15:12,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L802-1-->L804: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1098~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1098~0.base_11| 0)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1098~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1098~0.base_11|) |v_ULTIMATE.start_main_~#t1098~0.offset_10| 1)) |v_#memory_int_5|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1098~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1098~0.base_11|) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1098~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t1098~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1098~0.offset=|v_ULTIMATE.start_main_~#t1098~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1098~0.base=|v_ULTIMATE.start_main_~#t1098~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1098~0.offset, ULTIMATE.start_main_~#t1098~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-11-28 18:15:12,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-1302662648 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1302662648 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1302662648| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1302662648 |P0Thread1of1ForFork0_#t~ite5_Out-1302662648|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1302662648, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1302662648} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1302662648|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1302662648, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1302662648} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:15:12,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1166939922 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-1166939922 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1166939922 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1166939922 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1166939922| ~z$w_buff1_used~0_In-1166939922) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1166939922| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1166939922, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1166939922, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1166939922, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1166939922} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1166939922|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1166939922, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1166939922, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1166939922, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1166939922} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:15:12,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse0 (= ~z$r_buff0_thd1~0_In1181693188 ~z$r_buff0_thd1~0_Out1181693188)) (.cse1 (= (mod ~z$w_buff0_used~0_In1181693188 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In1181693188 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (= 0 ~z$r_buff0_thd1~0_Out1181693188) (not .cse1) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1181693188, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1181693188} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1181693188, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1181693188|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1181693188} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:15:12,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In941548413 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In941548413 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In941548413 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In941548413 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In941548413 |P0Thread1of1ForFork0_#t~ite8_Out941548413|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out941548413|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In941548413, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In941548413, ~z$w_buff1_used~0=~z$w_buff1_used~0_In941548413, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In941548413} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In941548413, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out941548413|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In941548413, ~z$w_buff1_used~0=~z$w_buff1_used~0_In941548413, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In941548413} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:15:12,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L744-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} 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:15:12,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd2~0_61 v_~z$r_buff0_thd2~0_60)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_61} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_5|, ~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_60, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:15:12,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L773-->L773-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-489401594 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out-489401594| ~z$r_buff1_thd2~0_In-489401594) (= |P1Thread1of1ForFork1_#t~ite29_In-489401594| |P1Thread1of1ForFork1_#t~ite29_Out-489401594|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite30_Out-489401594| |P1Thread1of1ForFork1_#t~ite29_Out-489401594|) .cse0 (= ~z$r_buff1_thd2~0_In-489401594 |P1Thread1of1ForFork1_#t~ite29_Out-489401594|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-489401594 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-489401594 256))) (and (= 0 (mod ~z$w_buff1_used~0_In-489401594 256)) .cse1) (= (mod ~z$w_buff0_used~0_In-489401594 256) 0)))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-489401594|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-489401594, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-489401594, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-489401594, ~weak$$choice2~0=~weak$$choice2~0_In-489401594, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-489401594} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-489401594|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-489401594|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-489401594, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-489401594, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-489401594, ~weak$$choice2~0=~weak$$choice2~0_In-489401594, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-489401594} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:15:12,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= v_~z~0_27 v_~z$mem_tmp~0_6) (= 0 v_~z$flush_delayed~0_8) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-11-28 18:15:12,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1966608533 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1966608533 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In-1966608533 |P1Thread1of1ForFork1_#t~ite32_Out-1966608533|)) (and (not .cse1) (= ~z$w_buff1~0_In-1966608533 |P1Thread1of1ForFork1_#t~ite32_Out-1966608533|) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1966608533, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1966608533, ~z$w_buff1~0=~z$w_buff1~0_In-1966608533, ~z~0=~z~0_In-1966608533} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1966608533, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1966608533, ~z$w_buff1~0=~z$w_buff1~0_In-1966608533, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1966608533|, ~z~0=~z~0_In-1966608533} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:15:12,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~z~0_39 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~z~0=v_~z~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~z~0] because there is no mapped edge [2019-11-28 18:15:12,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-798487740 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-798487740 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-798487740| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-798487740| ~z$w_buff0_used~0_In-798487740)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-798487740, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-798487740} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-798487740, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-798487740|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-798487740} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:15:12,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In10079499 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In10079499 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In10079499 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In10079499 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out10079499|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In10079499 |P1Thread1of1ForFork1_#t~ite35_Out10079499|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In10079499, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In10079499, ~z$w_buff1_used~0=~z$w_buff1_used~0_In10079499, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In10079499} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In10079499, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In10079499, ~z$w_buff1_used~0=~z$w_buff1_used~0_In10079499, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out10079499|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In10079499} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:15:12,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1701444247 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1701444247 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In1701444247 |P1Thread1of1ForFork1_#t~ite36_Out1701444247|)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out1701444247| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1701444247, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1701444247} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1701444247, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1701444247, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1701444247|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:15:12,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1427951806 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1427951806 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1427951806 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-1427951806 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-1427951806| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$r_buff1_thd2~0_In-1427951806 |P1Thread1of1ForFork1_#t~ite37_Out-1427951806|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1427951806, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1427951806, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1427951806, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1427951806} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1427951806, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1427951806, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1427951806, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1427951806, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1427951806|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:15:12,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L783-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite37_22| v_~z$r_buff1_thd2~0_88) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_28 (+ v_~__unbuffered_cnt~0_29 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_88, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} 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:15:12,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L804-1-->L810: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_16) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, 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:15:12,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In424466076 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In424466076 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite41_Out424466076| |ULTIMATE.start_main_#t~ite40_Out424466076|))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In424466076 |ULTIMATE.start_main_#t~ite40_Out424466076|) .cse2) (and (= ~z~0_In424466076 |ULTIMATE.start_main_#t~ite40_Out424466076|) (or .cse0 .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In424466076, ~z$w_buff1_used~0=~z$w_buff1_used~0_In424466076, ~z$w_buff1~0=~z$w_buff1~0_In424466076, ~z~0=~z~0_In424466076} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out424466076|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out424466076|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In424466076, ~z$w_buff1_used~0=~z$w_buff1_used~0_In424466076, ~z$w_buff1~0=~z$w_buff1~0_In424466076, ~z~0=~z~0_In424466076} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:15:12,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1188766187 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1188766187 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-1188766187|)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1188766187 |ULTIMATE.start_main_#t~ite42_Out-1188766187|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1188766187, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1188766187} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1188766187, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1188766187, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1188766187|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:15:12,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-923529326 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-923529326 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-923529326 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-923529326 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-923529326| ~z$w_buff1_used~0_In-923529326) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite43_Out-923529326| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-923529326, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-923529326, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-923529326, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-923529326} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-923529326, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-923529326, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-923529326, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-923529326, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-923529326|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:15:12,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-519639578 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-519639578 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-519639578|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-519639578 |ULTIMATE.start_main_#t~ite44_Out-519639578|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-519639578, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-519639578} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-519639578, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-519639578, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-519639578|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:15:12,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1117416204 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1117416204 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1117416204 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1117416204 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1117416204| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-1117416204| ~z$r_buff1_thd0~0_In-1117416204) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1117416204, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1117416204, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1117416204, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1117416204} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1117416204, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1117416204, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1117416204, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1117416204, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1117416204|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:15:12,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_107 |v_ULTIMATE.start_main_#t~ite45_60|) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_28 0) (= 1 v_~__unbuffered_p1_EAX~0_28) (= v_~x~0_67 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_22) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_22 256))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_67, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_60|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_107, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~x~0=v_~x~0_67, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_59|, 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:15:13,112 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:15:13,112 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:15:13,114 INFO L168 Benchmark]: Toolchain (without parser) took 17828.18 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 882.4 MB). Free memory was 956.3 MB in the beginning and 1.6 GB in the end (delta: -632.2 MB). Peak memory consumption was 250.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:13,115 INFO L168 Benchmark]: CDTParser took 0.40 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:15:13,115 INFO L168 Benchmark]: CACSL2BoogieTranslator took 754.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -105.8 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:13,115 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.40 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:15:13,116 INFO L168 Benchmark]: Boogie Preprocessor took 43.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:13,125 INFO L168 Benchmark]: RCFGBuilder took 790.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:13,126 INFO L168 Benchmark]: TraceAbstraction took 16022.37 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 786.4 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -599.5 MB). Peak memory consumption was 791.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:13,129 INFO L168 Benchmark]: Witness Printer took 151.10 ms. Allocated memory is still 1.9 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:15:13,131 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.40 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 754.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -105.8 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.40 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 790.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16022.37 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 786.4 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -599.5 MB). Peak memory consumption was 791.5 MB. Max. memory is 11.5 GB. * Witness Printer took 151.10 ms. Allocated memory is still 1.9 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 148 ProgramPointsBefore, 77 ProgramPointsAfterwards, 182 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 13 FixpointIterations, 30 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 25 ChoiceCompositions, 4608 VarBasedMoverChecksPositive, 304 VarBasedMoverChecksNegative, 234 SemBasedMoverChecksPositive, 187 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 82827 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1097, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L726] 1 z$w_buff1 = z$w_buff0 [L727] 1 z$w_buff0 = 1 [L728] 1 z$w_buff1_used = z$w_buff0_used [L729] 1 z$w_buff0_used = (_Bool)1 [L740] 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_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L804] FCALL, FORK 0 pthread_create(&t1098, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=1, 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] [L754] 2 x = 2 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z VAL [__unbuffered_cnt=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=5, weak$$choice2=1, x=2, 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] [L767] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L740] 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) [L741] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L742] 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 [L767] 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) [L768] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 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)) [L769] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 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)) [L770] 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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))=0, x=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 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)) [L771] EXPR 2 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)) VAL [__unbuffered_cnt=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=5, weak$$choice2=1, 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))=0, x=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 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)) [L773] 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)) [L774] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L779] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 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 [L782] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L810] EXPR 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_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L810] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L811] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L812] 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 [L813] 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, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.7s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1996 SDtfs, 1392 SDslu, 3429 SDs, 0 SdLazy, 1550 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 18 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18980occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 13441 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 418 NumberOfCodeBlocks, 418 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 350 ConstructedInterpolants, 0 QuantifiedInterpolants, 47796 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...