./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix018_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_100184fb-5753-4e3e-b8e4-b26d34b5056c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_100184fb-5753-4e3e-b8e4-b26d34b5056c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_100184fb-5753-4e3e-b8e4-b26d34b5056c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_100184fb-5753-4e3e-b8e4-b26d34b5056c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix018_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_100184fb-5753-4e3e-b8e4-b26d34b5056c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_100184fb-5753-4e3e-b8e4-b26d34b5056c/bin/uautomizer --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 b19110f000788c08c75af23713839cc8c42dbd78 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-12-07 18:21:36,183 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:21:36,185 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:21:36,192 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:21:36,192 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:21:36,193 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:21:36,194 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:21:36,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:21:36,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:21:36,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:21:36,198 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:21:36,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:21:36,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:21:36,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:21:36,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:21:36,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:21:36,202 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:21:36,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:21:36,204 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:21:36,205 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:21:36,207 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:21:36,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:21:36,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:21:36,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:21:36,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:21:36,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:21:36,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:21:36,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:21:36,212 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:21:36,213 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:21:36,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:21:36,213 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:21:36,214 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:21:36,215 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:21:36,215 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:21:36,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:21:36,216 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:21:36,216 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:21:36,216 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:21:36,217 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:21:36,217 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:21:36,218 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_100184fb-5753-4e3e-b8e4-b26d34b5056c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:21:36,230 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:21:36,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:21:36,231 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:21:36,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:21:36,232 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:21:36,232 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:21:36,232 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:21:36,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:21:36,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:21:36,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:21:36,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:21:36,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:21:36,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:21:36,233 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:21:36,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:21:36,234 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:21:36,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:21:36,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:21:36,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:21:36,234 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:21:36,235 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:21:36,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:21:36,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:21:36,235 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:21:36,235 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:21:36,236 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:21:36,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:21:36,236 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:21:36,236 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:21:36,236 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_100184fb-5753-4e3e-b8e4-b26d34b5056c/bin/uautomizer 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 -> b19110f000788c08c75af23713839cc8c42dbd78 [2019-12-07 18:21:36,339 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:21:36,347 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:21:36,350 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:21:36,351 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:21:36,351 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:21:36,351 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_100184fb-5753-4e3e-b8e4-b26d34b5056c/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix018_tso.opt.i [2019-12-07 18:21:36,389 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_100184fb-5753-4e3e-b8e4-b26d34b5056c/bin/uautomizer/data/b5abe1748/68ce43f7d15244e396edf06f78dfcddf/FLAG85c7569df [2019-12-07 18:21:36,845 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:21:36,846 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_100184fb-5753-4e3e-b8e4-b26d34b5056c/sv-benchmarks/c/pthread-wmm/mix018_tso.opt.i [2019-12-07 18:21:36,857 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_100184fb-5753-4e3e-b8e4-b26d34b5056c/bin/uautomizer/data/b5abe1748/68ce43f7d15244e396edf06f78dfcddf/FLAG85c7569df [2019-12-07 18:21:36,867 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_100184fb-5753-4e3e-b8e4-b26d34b5056c/bin/uautomizer/data/b5abe1748/68ce43f7d15244e396edf06f78dfcddf [2019-12-07 18:21:36,869 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:21:36,870 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:21:36,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:21:36,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:21:36,873 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:21:36,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:21:36" (1/1) ... [2019-12-07 18:21:36,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3482028c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:36, skipping insertion in model container [2019-12-07 18:21:36,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:21:36" (1/1) ... [2019-12-07 18:21:36,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:21:36,911 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:21:37,193 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:21:37,200 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:21:37,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:21:37,288 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:21:37,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:37 WrapperNode [2019-12-07 18:21:37,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:21:37,289 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:21:37,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:21:37,289 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:21:37,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:37" (1/1) ... [2019-12-07 18:21:37,308 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:37" (1/1) ... [2019-12-07 18:21:37,328 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:21:37,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:21:37,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:21:37,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:21:37,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:37" (1/1) ... [2019-12-07 18:21:37,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:37" (1/1) ... [2019-12-07 18:21:37,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:37" (1/1) ... [2019-12-07 18:21:37,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:37" (1/1) ... [2019-12-07 18:21:37,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:37" (1/1) ... [2019-12-07 18:21:37,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:37" (1/1) ... [2019-12-07 18:21:37,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:37" (1/1) ... [2019-12-07 18:21:37,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:21:37,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:21:37,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:21:37,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:21:37,356 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_100184fb-5753-4e3e-b8e4-b26d34b5056c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:21:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:21:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:21:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:21:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:21:37,400 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:21:37,401 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:21:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:21:37,401 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:21:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 18:21:37,401 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 18:21:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 18:21:37,401 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 18:21:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:21:37,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:21:37,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:21:37,403 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 18:21:37,821 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:21:37,821 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:21:37,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:21:37 BoogieIcfgContainer [2019-12-07 18:21:37,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:21:37,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:21:37,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:21:37,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:21:37,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:21:36" (1/3) ... [2019-12-07 18:21:37,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ad3b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:21:37, skipping insertion in model container [2019-12-07 18:21:37,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:37" (2/3) ... [2019-12-07 18:21:37,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ad3b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:21:37, skipping insertion in model container [2019-12-07 18:21:37,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:21:37" (3/3) ... [2019-12-07 18:21:37,827 INFO L109 eAbstractionObserver]: Analyzing ICFG mix018_tso.opt.i [2019-12-07 18:21:37,833 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:21:37,833 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:21:37,838 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:21:37,839 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:21:37,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,866 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,866 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,867 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,867 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,868 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,868 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,879 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,879 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,879 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,879 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,879 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,880 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,880 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,880 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,880 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,880 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,880 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,880 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,880 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,880 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,881 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,881 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,881 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,881 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,881 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,881 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,881 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,881 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,881 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,881 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,881 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,882 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,882 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,882 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,882 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,882 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,882 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,882 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,882 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,882 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,882 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,883 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,883 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,883 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,883 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,883 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,883 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,883 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,883 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,883 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,883 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,884 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,884 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,884 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,884 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,884 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,884 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,884 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,884 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,884 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,884 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,885 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,885 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,885 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,885 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,885 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,885 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,885 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,885 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,885 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,885 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,885 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,886 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,886 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,886 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,886 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,886 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,886 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,886 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,886 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,886 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,886 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,888 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,888 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,888 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,888 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,888 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,888 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,888 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,888 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,888 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,888 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,889 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,889 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,889 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,889 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,889 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,889 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,889 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,889 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,889 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,889 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,889 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,890 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,890 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,890 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,890 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,890 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,890 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,890 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,890 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,890 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,890 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,891 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,891 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,891 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,891 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:37,903 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 18:21:37,915 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:21:37,915 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:21:37,915 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:21:37,915 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:21:37,916 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:21:37,916 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:21:37,916 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:21:37,916 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:21:37,927 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 254 transitions [2019-12-07 18:21:37,928 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 18:21:37,995 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 18:21:37,995 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:21:38,007 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 928 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 18:21:38,029 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 18:21:38,068 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 18:21:38,068 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:21:38,077 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 928 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 18:21:38,104 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 18:21:38,105 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:21:41,691 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 18:21:41,990 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 18:21:42,107 INFO L206 etLargeBlockEncoding]: Checked pairs total: 142340 [2019-12-07 18:21:42,108 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2019-12-07 18:21:42,110 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 131 transitions [2019-12-07 18:21:50,350 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 90046 states. [2019-12-07 18:21:50,352 INFO L276 IsEmpty]: Start isEmpty. Operand 90046 states. [2019-12-07 18:21:50,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 18:21:50,357 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:50,357 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:50,357 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:50,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:50,361 INFO L82 PathProgramCache]: Analyzing trace with hash 259811849, now seen corresponding path program 1 times [2019-12-07 18:21:50,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:50,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181403330] [2019-12-07 18:21:50,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:50,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:21:50,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181403330] [2019-12-07 18:21:50,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:50,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:21:50,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229453763] [2019-12-07 18:21:50,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:21:50,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:50,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:21:50,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:21:50,540 INFO L87 Difference]: Start difference. First operand 90046 states. Second operand 3 states. [2019-12-07 18:21:51,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:51,246 INFO L93 Difference]: Finished difference Result 89182 states and 411616 transitions. [2019-12-07 18:21:51,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:21:51,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 18:21:51,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:51,735 INFO L225 Difference]: With dead ends: 89182 [2019-12-07 18:21:51,736 INFO L226 Difference]: Without dead ends: 83470 [2019-12-07 18:21:51,736 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-12-07 18:21:53,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83470 states. [2019-12-07 18:21:54,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83470 to 83470. [2019-12-07 18:21:54,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83470 states. [2019-12-07 18:21:54,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83470 states to 83470 states and 385016 transitions. [2019-12-07 18:21:54,965 INFO L78 Accepts]: Start accepts. Automaton has 83470 states and 385016 transitions. Word has length 9 [2019-12-07 18:21:54,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:54,966 INFO L462 AbstractCegarLoop]: Abstraction has 83470 states and 385016 transitions. [2019-12-07 18:21:54,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:21:54,966 INFO L276 IsEmpty]: Start isEmpty. Operand 83470 states and 385016 transitions. [2019-12-07 18:21:54,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:21:54,972 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:54,972 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:54,972 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:54,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:54,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1558204525, now seen corresponding path program 1 times [2019-12-07 18:21:54,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:54,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980944477] [2019-12-07 18:21:54,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:21:55,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980944477] [2019-12-07 18:21:55,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:55,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:21:55,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675075260] [2019-12-07 18:21:55,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:21:55,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:55,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:21:55,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:21:55,044 INFO L87 Difference]: Start difference. First operand 83470 states and 385016 transitions. Second operand 4 states. [2019-12-07 18:21:55,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:55,872 INFO L93 Difference]: Finished difference Result 129310 states and 576248 transitions. [2019-12-07 18:21:55,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:21:55,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 18:21:55,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:58,137 INFO L225 Difference]: With dead ends: 129310 [2019-12-07 18:21:58,137 INFO L226 Difference]: Without dead ends: 129254 [2019-12-07 18:21:58,138 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-12-07 18:21:59,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129254 states. [2019-12-07 18:22:01,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129254 to 124642. [2019-12-07 18:22:01,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124642 states. [2019-12-07 18:22:02,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124642 states to 124642 states and 558856 transitions. [2019-12-07 18:22:02,011 INFO L78 Accepts]: Start accepts. Automaton has 124642 states and 558856 transitions. Word has length 15 [2019-12-07 18:22:02,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:02,011 INFO L462 AbstractCegarLoop]: Abstraction has 124642 states and 558856 transitions. [2019-12-07 18:22:02,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:22:02,011 INFO L276 IsEmpty]: Start isEmpty. Operand 124642 states and 558856 transitions. [2019-12-07 18:22:02,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:22:02,018 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:02,018 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:02,018 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:02,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:02,019 INFO L82 PathProgramCache]: Analyzing trace with hash -545556496, now seen corresponding path program 1 times [2019-12-07 18:22:02,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:02,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057884636] [2019-12-07 18:22:02,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:02,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:02,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057884636] [2019-12-07 18:22:02,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:02,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:22:02,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255207349] [2019-12-07 18:22:02,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:22:02,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:02,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:22:02,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:22:02,083 INFO L87 Difference]: Start difference. First operand 124642 states and 558856 transitions. Second operand 4 states. [2019-12-07 18:22:03,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:03,010 INFO L93 Difference]: Finished difference Result 158782 states and 702836 transitions. [2019-12-07 18:22:03,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:22:03,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 18:22:03,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:03,468 INFO L225 Difference]: With dead ends: 158782 [2019-12-07 18:22:03,468 INFO L226 Difference]: Without dead ends: 158730 [2019-12-07 18:22:03,468 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-12-07 18:22:05,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158730 states. [2019-12-07 18:22:09,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158730 to 142378. [2019-12-07 18:22:09,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142378 states. [2019-12-07 18:22:09,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142378 states to 142378 states and 635380 transitions. [2019-12-07 18:22:09,799 INFO L78 Accepts]: Start accepts. Automaton has 142378 states and 635380 transitions. Word has length 18 [2019-12-07 18:22:09,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:09,799 INFO L462 AbstractCegarLoop]: Abstraction has 142378 states and 635380 transitions. [2019-12-07 18:22:09,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:22:09,799 INFO L276 IsEmpty]: Start isEmpty. Operand 142378 states and 635380 transitions. [2019-12-07 18:22:09,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:22:09,811 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:09,811 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:09,811 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:09,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:09,812 INFO L82 PathProgramCache]: Analyzing trace with hash 267646308, now seen corresponding path program 1 times [2019-12-07 18:22:09,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:09,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592470604] [2019-12-07 18:22:09,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:09,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:09,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592470604] [2019-12-07 18:22:09,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:09,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:22:09,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54069827] [2019-12-07 18:22:09,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:22:09,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:09,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:22:09,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:09,846 INFO L87 Difference]: Start difference. First operand 142378 states and 635380 transitions. Second operand 3 states. [2019-12-07 18:22:11,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:11,454 INFO L93 Difference]: Finished difference Result 243978 states and 1046540 transitions. [2019-12-07 18:22:11,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:22:11,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 18:22:11,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:12,163 INFO L225 Difference]: With dead ends: 243978 [2019-12-07 18:22:12,163 INFO L226 Difference]: Without dead ends: 243978 [2019-12-07 18:22:12,163 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-12-07 18:22:14,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243978 states. [2019-12-07 18:22:20,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243978 to 220082. [2019-12-07 18:22:20,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220082 states. [2019-12-07 18:22:21,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220082 states to 220082 states and 955428 transitions. [2019-12-07 18:22:21,140 INFO L78 Accepts]: Start accepts. Automaton has 220082 states and 955428 transitions. Word has length 19 [2019-12-07 18:22:21,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:21,140 INFO L462 AbstractCegarLoop]: Abstraction has 220082 states and 955428 transitions. [2019-12-07 18:22:21,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:22:21,140 INFO L276 IsEmpty]: Start isEmpty. Operand 220082 states and 955428 transitions. [2019-12-07 18:22:21,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:22:21,153 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:21,153 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] [2019-12-07 18:22:21,153 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:21,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:21,153 INFO L82 PathProgramCache]: Analyzing trace with hash -993922956, now seen corresponding path program 1 times [2019-12-07 18:22:21,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:21,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976314960] [2019-12-07 18:22:21,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:21,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:21,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976314960] [2019-12-07 18:22:21,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:21,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:22:21,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005906923] [2019-12-07 18:22:21,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:22:21,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:21,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:22:21,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:21,197 INFO L87 Difference]: Start difference. First operand 220082 states and 955428 transitions. Second operand 3 states. [2019-12-07 18:22:22,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:22,711 INFO L93 Difference]: Finished difference Result 207942 states and 891892 transitions. [2019-12-07 18:22:22,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:22:22,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 18:22:22,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:23,284 INFO L225 Difference]: With dead ends: 207942 [2019-12-07 18:22:23,285 INFO L226 Difference]: Without dead ends: 207942 [2019-12-07 18:22:23,285 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-12-07 18:22:25,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207942 states. [2019-12-07 18:22:30,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207942 to 205878. [2019-12-07 18:22:30,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205878 states. [2019-12-07 18:22:31,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205878 states to 205878 states and 883844 transitions. [2019-12-07 18:22:31,520 INFO L78 Accepts]: Start accepts. Automaton has 205878 states and 883844 transitions. Word has length 20 [2019-12-07 18:22:31,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:31,520 INFO L462 AbstractCegarLoop]: Abstraction has 205878 states and 883844 transitions. [2019-12-07 18:22:31,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:22:31,520 INFO L276 IsEmpty]: Start isEmpty. Operand 205878 states and 883844 transitions. [2019-12-07 18:22:31,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:22:31,531 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:31,531 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] [2019-12-07 18:22:31,531 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:31,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:31,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1422939487, now seen corresponding path program 1 times [2019-12-07 18:22:31,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:31,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22673194] [2019-12-07 18:22:31,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:31,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:31,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22673194] [2019-12-07 18:22:31,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:31,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:22:31,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116509381] [2019-12-07 18:22:31,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:22:31,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:31,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:22:31,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:31,592 INFO L87 Difference]: Start difference. First operand 205878 states and 883844 transitions. Second operand 3 states. [2019-12-07 18:22:33,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:33,242 INFO L93 Difference]: Finished difference Result 271349 states and 1099719 transitions. [2019-12-07 18:22:33,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:22:33,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 18:22:33,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:33,971 INFO L225 Difference]: With dead ends: 271349 [2019-12-07 18:22:33,971 INFO L226 Difference]: Without dead ends: 270911 [2019-12-07 18:22:33,971 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-12-07 18:22:36,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270911 states. [2019-12-07 18:22:40,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270911 to 264871. [2019-12-07 18:22:40,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264871 states. [2019-12-07 18:22:41,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264871 states to 264871 states and 1082715 transitions. [2019-12-07 18:22:41,414 INFO L78 Accepts]: Start accepts. Automaton has 264871 states and 1082715 transitions. Word has length 20 [2019-12-07 18:22:41,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:41,414 INFO L462 AbstractCegarLoop]: Abstraction has 264871 states and 1082715 transitions. [2019-12-07 18:22:41,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:22:41,414 INFO L276 IsEmpty]: Start isEmpty. Operand 264871 states and 1082715 transitions. [2019-12-07 18:22:41,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:22:41,427 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:41,427 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] [2019-12-07 18:22:41,427 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:41,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:41,427 INFO L82 PathProgramCache]: Analyzing trace with hash -346227298, now seen corresponding path program 1 times [2019-12-07 18:22:41,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:41,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994088106] [2019-12-07 18:22:41,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:41,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:41,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994088106] [2019-12-07 18:22:41,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:41,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:22:41,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718149393] [2019-12-07 18:22:41,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:22:41,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:41,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:22:41,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:22:41,488 INFO L87 Difference]: Start difference. First operand 264871 states and 1082715 transitions. Second operand 4 states. [2019-12-07 18:22:45,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:45,570 INFO L93 Difference]: Finished difference Result 260883 states and 1063625 transitions. [2019-12-07 18:22:45,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:22:45,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 18:22:45,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:46,259 INFO L225 Difference]: With dead ends: 260883 [2019-12-07 18:22:46,259 INFO L226 Difference]: Without dead ends: 260883 [2019-12-07 18:22:46,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:22:48,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260883 states. [2019-12-07 18:22:51,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260883 to 221554. [2019-12-07 18:22:51,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221554 states. [2019-12-07 18:22:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221554 states to 221554 states and 931574 transitions. [2019-12-07 18:22:52,675 INFO L78 Accepts]: Start accepts. Automaton has 221554 states and 931574 transitions. Word has length 21 [2019-12-07 18:22:52,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:52,676 INFO L462 AbstractCegarLoop]: Abstraction has 221554 states and 931574 transitions. [2019-12-07 18:22:52,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:22:52,676 INFO L276 IsEmpty]: Start isEmpty. Operand 221554 states and 931574 transitions. [2019-12-07 18:22:52,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:22:52,688 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:52,688 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] [2019-12-07 18:22:52,688 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:52,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:52,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1950965462, now seen corresponding path program 1 times [2019-12-07 18:22:52,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:52,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335006273] [2019-12-07 18:22:52,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:52,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335006273] [2019-12-07 18:22:52,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:52,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:22:52,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063503629] [2019-12-07 18:22:52,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:22:52,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:52,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:22:52,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:22:52,733 INFO L87 Difference]: Start difference. First operand 221554 states and 931574 transitions. Second operand 4 states. [2019-12-07 18:22:54,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:54,633 INFO L93 Difference]: Finished difference Result 275045 states and 1145051 transitions. [2019-12-07 18:22:54,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:22:54,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 18:22:54,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:55,388 INFO L225 Difference]: With dead ends: 275045 [2019-12-07 18:22:55,388 INFO L226 Difference]: Without dead ends: 274977 [2019-12-07 18:22:55,389 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-12-07 18:22:57,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274977 states. [2019-12-07 18:23:01,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274977 to 225042. [2019-12-07 18:23:01,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225042 states. [2019-12-07 18:23:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225042 states to 225042 states and 945884 transitions. [2019-12-07 18:23:02,365 INFO L78 Accepts]: Start accepts. Automaton has 225042 states and 945884 transitions. Word has length 21 [2019-12-07 18:23:02,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:02,366 INFO L462 AbstractCegarLoop]: Abstraction has 225042 states and 945884 transitions. [2019-12-07 18:23:02,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:23:02,366 INFO L276 IsEmpty]: Start isEmpty. Operand 225042 states and 945884 transitions. [2019-12-07 18:23:02,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:23:02,395 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:02,395 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:02,395 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:02,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:02,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1910405908, now seen corresponding path program 1 times [2019-12-07 18:23:02,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:02,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338955286] [2019-12-07 18:23:02,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:02,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:02,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338955286] [2019-12-07 18:23:02,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:02,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:23:02,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698058535] [2019-12-07 18:23:02,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:23:02,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:02,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:23:02,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:23:02,435 INFO L87 Difference]: Start difference. First operand 225042 states and 945884 transitions. Second operand 4 states. [2019-12-07 18:23:03,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:03,242 INFO L93 Difference]: Finished difference Result 192013 states and 745772 transitions. [2019-12-07 18:23:03,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:23:03,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-07 18:23:03,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:03,665 INFO L225 Difference]: With dead ends: 192013 [2019-12-07 18:23:03,665 INFO L226 Difference]: Without dead ends: 177763 [2019-12-07 18:23:03,665 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-12-07 18:23:07,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177763 states. [2019-12-07 18:23:09,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177763 to 177763. [2019-12-07 18:23:09,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177763 states. [2019-12-07 18:23:10,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177763 states to 177763 states and 695433 transitions. [2019-12-07 18:23:10,185 INFO L78 Accepts]: Start accepts. Automaton has 177763 states and 695433 transitions. Word has length 24 [2019-12-07 18:23:10,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:10,185 INFO L462 AbstractCegarLoop]: Abstraction has 177763 states and 695433 transitions. [2019-12-07 18:23:10,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:23:10,186 INFO L276 IsEmpty]: Start isEmpty. Operand 177763 states and 695433 transitions. [2019-12-07 18:23:10,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 18:23:10,210 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:10,210 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-12-07 18:23:10,211 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:10,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:10,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1761806270, now seen corresponding path program 1 times [2019-12-07 18:23:10,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:10,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639314025] [2019-12-07 18:23:10,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:10,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:10,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639314025] [2019-12-07 18:23:10,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:10,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:23:10,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098099177] [2019-12-07 18:23:10,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:23:10,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:10,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:23:10,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:23:10,255 INFO L87 Difference]: Start difference. First operand 177763 states and 695433 transitions. Second operand 5 states. [2019-12-07 18:23:10,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:10,580 INFO L93 Difference]: Finished difference Result 86373 states and 290855 transitions. [2019-12-07 18:23:10,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:23:10,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 18:23:10,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:10,708 INFO L225 Difference]: With dead ends: 86373 [2019-12-07 18:23:10,708 INFO L226 Difference]: Without dead ends: 75041 [2019-12-07 18:23:10,709 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:23:11,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75041 states. [2019-12-07 18:23:12,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75041 to 74883. [2019-12-07 18:23:12,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74883 states. [2019-12-07 18:23:12,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74883 states to 74883 states and 249122 transitions. [2019-12-07 18:23:12,395 INFO L78 Accepts]: Start accepts. Automaton has 74883 states and 249122 transitions. Word has length 25 [2019-12-07 18:23:12,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:12,395 INFO L462 AbstractCegarLoop]: Abstraction has 74883 states and 249122 transitions. [2019-12-07 18:23:12,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:23:12,395 INFO L276 IsEmpty]: Start isEmpty. Operand 74883 states and 249122 transitions. [2019-12-07 18:23:12,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 18:23:12,406 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:12,406 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-12-07 18:23:12,406 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:12,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:12,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1382879271, now seen corresponding path program 1 times [2019-12-07 18:23:12,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:12,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423469343] [2019-12-07 18:23:12,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:12,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:12,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423469343] [2019-12-07 18:23:12,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:12,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:23:12,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291891017] [2019-12-07 18:23:12,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:23:12,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:12,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:23:12,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:23:12,457 INFO L87 Difference]: Start difference. First operand 74883 states and 249122 transitions. Second operand 6 states. [2019-12-07 18:23:12,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:12,558 INFO L93 Difference]: Finished difference Result 21412 states and 68416 transitions. [2019-12-07 18:23:12,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:23:12,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-07 18:23:12,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:12,583 INFO L225 Difference]: With dead ends: 21412 [2019-12-07 18:23:12,583 INFO L226 Difference]: Without dead ends: 16961 [2019-12-07 18:23:12,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:23:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16961 states. [2019-12-07 18:23:12,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16961 to 16044. [2019-12-07 18:23:12,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16044 states. [2019-12-07 18:23:12,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16044 states to 16044 states and 50831 transitions. [2019-12-07 18:23:12,800 INFO L78 Accepts]: Start accepts. Automaton has 16044 states and 50831 transitions. Word has length 26 [2019-12-07 18:23:12,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:12,800 INFO L462 AbstractCegarLoop]: Abstraction has 16044 states and 50831 transitions. [2019-12-07 18:23:12,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:23:12,800 INFO L276 IsEmpty]: Start isEmpty. Operand 16044 states and 50831 transitions. [2019-12-07 18:23:12,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 18:23:12,809 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:12,809 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] [2019-12-07 18:23:12,809 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:12,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:12,809 INFO L82 PathProgramCache]: Analyzing trace with hash 617853445, now seen corresponding path program 1 times [2019-12-07 18:23:12,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:12,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126061045] [2019-12-07 18:23:12,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:12,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:12,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126061045] [2019-12-07 18:23:12,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:12,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:23:12,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541000944] [2019-12-07 18:23:12,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:23:12,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:12,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:23:12,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:23:12,871 INFO L87 Difference]: Start difference. First operand 16044 states and 50831 transitions. Second operand 7 states. [2019-12-07 18:23:12,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:12,981 INFO L93 Difference]: Finished difference Result 13723 states and 45511 transitions. [2019-12-07 18:23:12,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:23:12,982 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-07 18:23:12,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:13,000 INFO L225 Difference]: With dead ends: 13723 [2019-12-07 18:23:13,000 INFO L226 Difference]: Without dead ends: 13437 [2019-12-07 18:23:13,000 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:23:13,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13437 states. [2019-12-07 18:23:13,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13437 to 12642. [2019-12-07 18:23:13,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12642 states. [2019-12-07 18:23:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12642 states to 12642 states and 43006 transitions. [2019-12-07 18:23:13,178 INFO L78 Accepts]: Start accepts. Automaton has 12642 states and 43006 transitions. Word has length 34 [2019-12-07 18:23:13,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:13,178 INFO L462 AbstractCegarLoop]: Abstraction has 12642 states and 43006 transitions. [2019-12-07 18:23:13,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:23:13,178 INFO L276 IsEmpty]: Start isEmpty. Operand 12642 states and 43006 transitions. [2019-12-07 18:23:13,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 18:23:13,192 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:13,192 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:13,192 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:13,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:13,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1029868635, now seen corresponding path program 1 times [2019-12-07 18:23:13,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:13,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311136904] [2019-12-07 18:23:13,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:13,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311136904] [2019-12-07 18:23:13,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:13,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:23:13,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398456258] [2019-12-07 18:23:13,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:23:13,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:13,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:23:13,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:23:13,512 INFO L87 Difference]: Start difference. First operand 12642 states and 43006 transitions. Second operand 4 states. [2019-12-07 18:23:13,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:13,585 INFO L93 Difference]: Finished difference Result 16309 states and 52115 transitions. [2019-12-07 18:23:13,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:23:13,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 18:23:13,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:13,604 INFO L225 Difference]: With dead ends: 16309 [2019-12-07 18:23:13,605 INFO L226 Difference]: Without dead ends: 15371 [2019-12-07 18:23:13,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:23:13,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15371 states. [2019-12-07 18:23:13,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15371 to 12048. [2019-12-07 18:23:13,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12048 states. [2019-12-07 18:23:13,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12048 states to 12048 states and 40783 transitions. [2019-12-07 18:23:13,784 INFO L78 Accepts]: Start accepts. Automaton has 12048 states and 40783 transitions. Word has length 65 [2019-12-07 18:23:13,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:13,784 INFO L462 AbstractCegarLoop]: Abstraction has 12048 states and 40783 transitions. [2019-12-07 18:23:13,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:23:13,784 INFO L276 IsEmpty]: Start isEmpty. Operand 12048 states and 40783 transitions. [2019-12-07 18:23:13,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 18:23:13,796 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:13,796 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:13,796 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:13,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:13,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1486943137, now seen corresponding path program 2 times [2019-12-07 18:23:13,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:13,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796089478] [2019-12-07 18:23:13,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:13,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796089478] [2019-12-07 18:23:13,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:13,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:23:13,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60573478] [2019-12-07 18:23:13,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:23:13,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:13,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:23:13,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:23:13,883 INFO L87 Difference]: Start difference. First operand 12048 states and 40783 transitions. Second operand 7 states. [2019-12-07 18:23:14,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:14,105 INFO L93 Difference]: Finished difference Result 30753 states and 102112 transitions. [2019-12-07 18:23:14,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:23:14,106 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-07 18:23:14,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:14,134 INFO L225 Difference]: With dead ends: 30753 [2019-12-07 18:23:14,134 INFO L226 Difference]: Without dead ends: 21688 [2019-12-07 18:23:14,135 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:23:14,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21688 states. [2019-12-07 18:23:14,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21688 to 16374. [2019-12-07 18:23:14,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16374 states. [2019-12-07 18:23:14,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16374 states to 16374 states and 53954 transitions. [2019-12-07 18:23:14,390 INFO L78 Accepts]: Start accepts. Automaton has 16374 states and 53954 transitions. Word has length 65 [2019-12-07 18:23:14,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:14,390 INFO L462 AbstractCegarLoop]: Abstraction has 16374 states and 53954 transitions. [2019-12-07 18:23:14,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:23:14,390 INFO L276 IsEmpty]: Start isEmpty. Operand 16374 states and 53954 transitions. [2019-12-07 18:23:14,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 18:23:14,407 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:14,407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:14,407 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:14,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:14,407 INFO L82 PathProgramCache]: Analyzing trace with hash -853991273, now seen corresponding path program 3 times [2019-12-07 18:23:14,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:14,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593361966] [2019-12-07 18:23:14,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:14,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:14,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593361966] [2019-12-07 18:23:14,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:14,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:23:14,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530876308] [2019-12-07 18:23:14,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:23:14,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:14,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:23:14,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:23:14,479 INFO L87 Difference]: Start difference. First operand 16374 states and 53954 transitions. Second operand 4 states. [2019-12-07 18:23:14,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:14,571 INFO L93 Difference]: Finished difference Result 23846 states and 75507 transitions. [2019-12-07 18:23:14,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:23:14,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 18:23:14,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:14,597 INFO L225 Difference]: With dead ends: 23846 [2019-12-07 18:23:14,597 INFO L226 Difference]: Without dead ends: 19182 [2019-12-07 18:23:14,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:23:14,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19182 states. [2019-12-07 18:23:14,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19182 to 12262. [2019-12-07 18:23:14,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12262 states. [2019-12-07 18:23:14,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12262 states to 12262 states and 41664 transitions. [2019-12-07 18:23:14,803 INFO L78 Accepts]: Start accepts. Automaton has 12262 states and 41664 transitions. Word has length 65 [2019-12-07 18:23:14,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:14,803 INFO L462 AbstractCegarLoop]: Abstraction has 12262 states and 41664 transitions. [2019-12-07 18:23:14,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:23:14,803 INFO L276 IsEmpty]: Start isEmpty. Operand 12262 states and 41664 transitions. [2019-12-07 18:23:14,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:23:14,816 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:14,816 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:14,816 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:14,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:14,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1094551306, now seen corresponding path program 1 times [2019-12-07 18:23:14,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:14,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599103044] [2019-12-07 18:23:14,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:14,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:14,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599103044] [2019-12-07 18:23:14,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:14,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:23:14,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088271579] [2019-12-07 18:23:14,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:23:14,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:14,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:23:14,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:23:14,885 INFO L87 Difference]: Start difference. First operand 12262 states and 41664 transitions. Second operand 5 states. [2019-12-07 18:23:14,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:14,961 INFO L93 Difference]: Finished difference Result 17013 states and 53759 transitions. [2019-12-07 18:23:14,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:23:14,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-07 18:23:14,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:14,972 INFO L225 Difference]: With dead ends: 17013 [2019-12-07 18:23:14,973 INFO L226 Difference]: Without dead ends: 8397 [2019-12-07 18:23:14,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:23:14,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8397 states. [2019-12-07 18:23:15,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8397 to 7650. [2019-12-07 18:23:15,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7650 states. [2019-12-07 18:23:15,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7650 states to 7650 states and 23463 transitions. [2019-12-07 18:23:15,067 INFO L78 Accepts]: Start accepts. Automaton has 7650 states and 23463 transitions. Word has length 66 [2019-12-07 18:23:15,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:15,067 INFO L462 AbstractCegarLoop]: Abstraction has 7650 states and 23463 transitions. [2019-12-07 18:23:15,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:23:15,067 INFO L276 IsEmpty]: Start isEmpty. Operand 7650 states and 23463 transitions. [2019-12-07 18:23:15,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:23:15,073 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:15,073 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:15,073 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:15,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:15,074 INFO L82 PathProgramCache]: Analyzing trace with hash 935217690, now seen corresponding path program 2 times [2019-12-07 18:23:15,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:15,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155997017] [2019-12-07 18:23:15,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:15,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:15,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155997017] [2019-12-07 18:23:15,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:15,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:23:15,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149812190] [2019-12-07 18:23:15,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:23:15,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:15,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:23:15,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:23:15,104 INFO L87 Difference]: Start difference. First operand 7650 states and 23463 transitions. Second operand 3 states. [2019-12-07 18:23:15,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:15,129 INFO L93 Difference]: Finished difference Result 8444 states and 25246 transitions. [2019-12-07 18:23:15,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:23:15,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 18:23:15,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:15,135 INFO L225 Difference]: With dead ends: 8444 [2019-12-07 18:23:15,135 INFO L226 Difference]: Without dead ends: 4598 [2019-12-07 18:23:15,136 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-12-07 18:23:15,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4598 states. [2019-12-07 18:23:15,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4598 to 4598. [2019-12-07 18:23:15,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4598 states. [2019-12-07 18:23:15,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4598 states to 4598 states and 12323 transitions. [2019-12-07 18:23:15,189 INFO L78 Accepts]: Start accepts. Automaton has 4598 states and 12323 transitions. Word has length 66 [2019-12-07 18:23:15,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:15,189 INFO L462 AbstractCegarLoop]: Abstraction has 4598 states and 12323 transitions. [2019-12-07 18:23:15,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:23:15,189 INFO L276 IsEmpty]: Start isEmpty. Operand 4598 states and 12323 transitions. [2019-12-07 18:23:15,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:23:15,192 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:15,192 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:15,192 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:15,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:15,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1473700222, now seen corresponding path program 3 times [2019-12-07 18:23:15,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:15,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407259483] [2019-12-07 18:23:15,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:15,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:15,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407259483] [2019-12-07 18:23:15,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:15,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:23:15,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884240066] [2019-12-07 18:23:15,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:23:15,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:15,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:23:15,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:23:15,253 INFO L87 Difference]: Start difference. First operand 4598 states and 12323 transitions. Second operand 5 states. [2019-12-07 18:23:15,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:15,293 INFO L93 Difference]: Finished difference Result 5071 states and 13379 transitions. [2019-12-07 18:23:15,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:23:15,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-07 18:23:15,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:15,294 INFO L225 Difference]: With dead ends: 5071 [2019-12-07 18:23:15,294 INFO L226 Difference]: Without dead ends: 555 [2019-12-07 18:23:15,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:23:15,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-12-07 18:23:15,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-12-07 18:23:15,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-12-07 18:23:15,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1183 transitions. [2019-12-07 18:23:15,299 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1183 transitions. Word has length 66 [2019-12-07 18:23:15,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:15,299 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 1183 transitions. [2019-12-07 18:23:15,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:23:15,299 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1183 transitions. [2019-12-07 18:23:15,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:23:15,300 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:15,300 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:15,300 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:15,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:15,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1960507102, now seen corresponding path program 4 times [2019-12-07 18:23:15,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:15,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165778001] [2019-12-07 18:23:15,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:23:15,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:23:15,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165778001] [2019-12-07 18:23:15,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:23:15,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:23:15,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102430134] [2019-12-07 18:23:15,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:23:15,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:23:15,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:23:15,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:23:15,370 INFO L87 Difference]: Start difference. First operand 555 states and 1183 transitions. Second operand 7 states. [2019-12-07 18:23:15,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:23:15,537 INFO L93 Difference]: Finished difference Result 1169 states and 2456 transitions. [2019-12-07 18:23:15,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:23:15,537 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 18:23:15,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:23:15,538 INFO L225 Difference]: With dead ends: 1169 [2019-12-07 18:23:15,538 INFO L226 Difference]: Without dead ends: 854 [2019-12-07 18:23:15,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:23:15,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-12-07 18:23:15,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 638. [2019-12-07 18:23:15,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-12-07 18:23:15,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1324 transitions. [2019-12-07 18:23:15,544 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1324 transitions. Word has length 66 [2019-12-07 18:23:15,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:23:15,544 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 1324 transitions. [2019-12-07 18:23:15,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:23:15,544 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1324 transitions. [2019-12-07 18:23:15,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:23:15,545 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:23:15,545 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:23:15,545 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:23:15,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:23:15,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1469521026, now seen corresponding path program 5 times [2019-12-07 18:23:15,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:23:15,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632991195] [2019-12-07 18:23:15,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:23:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:23:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:23:15,631 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:23:15,631 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:23:15,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse0 (store |v_#valid_89| 0 0))) (and (= v_~__unbuffered_cnt~0_140 0) (= 0 v_~__unbuffered_p2_EAX~0_75) (= v_~main$tmp_guard1~0_60 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t493~0.base_38| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t493~0.base_38|) |v_ULTIMATE.start_main_~#t493~0.offset_25| 0)) |v_#memory_int_25|) (= v_~z$r_buff0_thd2~0_131 0) (= 0 v_~z$flush_delayed~0_223) (= |v_#NULL.offset_6| 0) (= v_~z$w_buff1~0_366 0) (= v_~z$r_buff0_thd0~0_214 0) (= v_~z$r_buff1_thd2~0_149 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd1~0_149 0) (= v_~z$read_delayed_var~0.base_8 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~y~0_46 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t493~0.base_38|) (= |v_ULTIMATE.start_main_~#t493~0.offset_25| 0) (= v_~a~0_48 0) (= 0 v_~z$mem_tmp~0_195) (= 0 v_~z$r_buff1_thd4~0_355) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_712 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t493~0.base_38| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t493~0.base_38|)) (= (store .cse0 |v_ULTIMATE.start_main_~#t493~0.base_38| 1) |v_#valid_87|) (< 0 |v_#StackHeapBarrier_20|) (= v_~z$w_buff0~0_640 0) (= v_~main$tmp_guard0~0_47 0) (= 0 v_~__unbuffered_p1_EAX~0_63) (= v_~z~0_314 0) (= 0 v_~__unbuffered_p3_EBX~0_65) (= 0 v_~z$r_buff0_thd3~0_453) (= v_~z$w_buff0_used~0_1093 0) (= 0 v_~__unbuffered_p3_EAX~0_90) (= v_~weak$$choice2~0_273 0) (= 0 v_~weak$$choice0~0_182) (= 0 v_~z$r_buff0_thd4~0_575) (= v_~z$r_buff1_thd0~0_227 0) (= 0 v_~z$r_buff1_thd3~0_381) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~x~0_88 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_149, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_119|, ULTIMATE.start_main_~#t496~0.base=|v_ULTIMATE.start_main_~#t496~0.base_22|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_214, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_575, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_90, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, ULTIMATE.start_main_~#t493~0.offset=|v_ULTIMATE.start_main_~#t493~0.offset_25|, ULTIMATE.start_main_~#t493~0.base=|v_ULTIMATE.start_main_~#t493~0.base_38|, ~z$mem_tmp~0=v_~z$mem_tmp~0_195, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_712, ~z$flush_delayed~0=v_~z$flush_delayed~0_223, ULTIMATE.start_main_~#t496~0.offset=|v_ULTIMATE.start_main_~#t496~0.offset_16|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_182, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_183|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_149, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_453, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_88, ULTIMATE.start_main_~#t495~0.offset=|v_ULTIMATE.start_main_~#t495~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_355, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_~#t495~0.base=|v_ULTIMATE.start_main_~#t495~0.base_30|, ~z$w_buff1~0=v_~z$w_buff1~0_366, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_60, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t494~0.offset=|v_ULTIMATE.start_main_~#t494~0.offset_26|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_227, ~y~0=v_~y~0_46, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_131, ULTIMATE.start_main_~#t494~0.base=|v_ULTIMATE.start_main_~#t494~0.base_40|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1093, ~z$w_buff0~0=v_~z$w_buff0~0_640, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_381, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_47, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_65, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_37|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_58|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_314, ~weak$$choice2~0=v_~weak$$choice2~0_273, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_~#t496~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t493~0.offset, ULTIMATE.start_main_~#t493~0.base, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t496~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t495~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ULTIMATE.start_main_~#t495~0.base, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t494~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t494~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:23:15,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L851-1-->L853: Formula: (and (= 0 (select |v_#valid_46| |v_ULTIMATE.start_main_~#t494~0.base_11|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t494~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t494~0.base_11|)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t494~0.base_11|) (= |v_#valid_45| (store |v_#valid_46| |v_ULTIMATE.start_main_~#t494~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t494~0.offset_10|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t494~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t494~0.base_11|) |v_ULTIMATE.start_main_~#t494~0.offset_10| 1)) |v_#memory_int_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t494~0.base=|v_ULTIMATE.start_main_~#t494~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_~#t494~0.offset=|v_ULTIMATE.start_main_~#t494~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t494~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t494~0.offset] because there is no mapped edge [2019-12-07 18:23:15,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t495~0.offset_11|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t495~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t495~0.base_11| 0)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t495~0.base_11| 4)) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t495~0.base_11| 1)) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t495~0.base_11|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t495~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t495~0.base_11|) |v_ULTIMATE.start_main_~#t495~0.offset_11| 2)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_43|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t495~0.base=|v_ULTIMATE.start_main_~#t495~0.base_11|, #length=|v_#length_21|, ULTIMATE.start_main_~#t495~0.offset=|v_ULTIMATE.start_main_~#t495~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t495~0.base, #length, ULTIMATE.start_main_~#t495~0.offset] because there is no mapped edge [2019-12-07 18:23:15,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L855-1-->L857: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t496~0.base_9|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t496~0.base_9| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t496~0.base_9|) |v_ULTIMATE.start_main_~#t496~0.offset_8| 3)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t496~0.base_9|)) (= 0 |v_ULTIMATE.start_main_~#t496~0.offset_8|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t496~0.base_9| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t496~0.base_9|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t496~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t496~0.base=|v_ULTIMATE.start_main_~#t496~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_4|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t496~0.offset=|v_ULTIMATE.start_main_~#t496~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t496~0.base, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length, ULTIMATE.start_main_~#t496~0.offset] because there is no mapped edge [2019-12-07 18:23:15,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L4-->L813: Formula: (and (= ~z$r_buff1_thd4~0_Out-367636226 ~z$r_buff0_thd4~0_In-367636226) (= ~z$r_buff1_thd2~0_Out-367636226 ~z$r_buff0_thd2~0_In-367636226) (= 1 ~z$r_buff0_thd4~0_Out-367636226) (= |P3Thread1of1ForFork2_#t~nondet27_In-367636226| ~weak$$choice2~0_Out-367636226) (= ~z~0_In-367636226 ~z$mem_tmp~0_Out-367636226) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-367636226)) (= ~z$r_buff0_thd0~0_In-367636226 ~z$r_buff1_thd0~0_Out-367636226) (= ~weak$$choice2~0_Out-367636226 ~z$flush_delayed~0_Out-367636226) (= ~z$r_buff1_thd1~0_Out-367636226 ~z$r_buff0_thd1~0_In-367636226) (= |P3Thread1of1ForFork2_#t~nondet26_In-367636226| ~weak$$choice0~0_Out-367636226) (= ~z$r_buff1_thd3~0_Out-367636226 ~z$r_buff0_thd3~0_In-367636226)) InVars {P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_In-367636226|, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_In-367636226|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-367636226, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-367636226, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-367636226, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-367636226, ~z~0=~z~0_In-367636226, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-367636226, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-367636226} OutVars{P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_Out-367636226|, ~z$mem_tmp~0=~z$mem_tmp~0_Out-367636226, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_Out-367636226|, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-367636226, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-367636226, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-367636226, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-367636226, ~z$flush_delayed~0=~z$flush_delayed~0_Out-367636226, ~weak$$choice0~0=~weak$$choice0~0_Out-367636226, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-367636226, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-367636226, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-367636226, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-367636226, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-367636226, ~z~0=~z~0_In-367636226, ~weak$$choice2~0=~weak$$choice2~0_Out-367636226, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-367636226, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-367636226} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~nondet26, ~z$mem_tmp~0, P3Thread1of1ForFork2_#t~nondet27, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0] because there is no mapped edge [2019-12-07 18:23:15,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L813-2-->L813-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out1001372669| |P3Thread1of1ForFork2_#t~ite29_Out1001372669|)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1001372669 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1001372669 256)))) (or (and .cse0 (not .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out1001372669| ~z$w_buff0~0_In1001372669) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= |P3Thread1of1ForFork2_#t~ite28_Out1001372669| ~z$w_buff1~0_In1001372669)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1001372669, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1001372669, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1001372669, ~z$w_buff1~0=~z$w_buff1~0_In1001372669} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1001372669|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out1001372669|, ~z$w_buff0~0=~z$w_buff0~0_In1001372669, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1001372669, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1001372669, ~z$w_buff1~0=~z$w_buff1~0_In1001372669} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 18:23:15,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L818-->L819: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~z$r_buff0_thd4~0_131 v_~z$r_buff0_thd4~0_130)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_10|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 18:23:15,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1255391775 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out-1255391775| ~z$mem_tmp~0_In-1255391775)) (and .cse0 (= ~z~0_In-1255391775 |P3Thread1of1ForFork2_#t~ite48_Out-1255391775|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1255391775, ~z$flush_delayed~0=~z$flush_delayed~0_In-1255391775, ~z~0=~z~0_In-1255391775} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1255391775, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-1255391775|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1255391775, ~z~0=~z~0_In-1255391775} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 18:23:15,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_12| v_P0Thread1of1ForFork3_~arg.offset_10) (= v_P0Thread1of1ForFork3_~arg.base_10 |v_P0Thread1of1ForFork3_#in~arg.base_12|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_15 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_23 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_10, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_10, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 18:23:15,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~y~0_32 v_~__unbuffered_p1_EAX~0_9) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~x~0_11 2)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~y~0=v_~y~0_32} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_32, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 18:23:15,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In966073600 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In966073600 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite51_Out966073600| 0) (not .cse1)) (and (= ~z$w_buff0_used~0_In966073600 |P3Thread1of1ForFork2_#t~ite51_Out966073600|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In966073600, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In966073600} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out966073600|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In966073600, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In966073600} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 18:23:15,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In335834940 256)))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out335834940| ~z~0_In335834940)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite25_Out335834940| ~z$mem_tmp~0_In335834940)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In335834940, ~z$flush_delayed~0=~z$flush_delayed~0_In335834940, ~z~0=~z~0_In335834940} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In335834940, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out335834940|, ~z$flush_delayed~0=~z$flush_delayed~0_In335834940, ~z~0=~z~0_In335834940} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 18:23:15,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L830-->L830-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1765120801 256))) (.cse3 (= (mod ~z$r_buff0_thd4~0_In1765120801 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1765120801 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In1765120801 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite52_Out1765120801| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite52_Out1765120801| ~z$w_buff1_used~0_In1765120801) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1765120801, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1765120801, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1765120801, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1765120801} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out1765120801|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1765120801, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1765120801, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1765120801, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1765120801} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 18:23:15,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L831-->L832: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In1846651847 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1846651847 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_Out1846651847 ~z$r_buff0_thd4~0_In1846651847))) (or (and (not .cse0) (= ~z$r_buff0_thd4~0_Out1846651847 0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1846651847, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1846651847} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out1846651847|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1846651847, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1846651847} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 18:23:15,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1726631923 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-1726631923 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In-1726631923 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1726631923 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-1726631923| 0)) (and (= ~z$r_buff1_thd4~0_In-1726631923 |P3Thread1of1ForFork2_#t~ite54_Out-1726631923|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1726631923, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1726631923, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1726631923, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1726631923} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-1726631923|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1726631923, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1726631923, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1726631923, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1726631923} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 18:23:15,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L832-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P3Thread1of1ForFork2_#t~ite54_22| v_~z$r_buff1_thd4~0_191) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_21|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_191, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:23:15,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L783-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_137) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~z~0_175 |v_P2Thread1of1ForFork1_#t~ite25_36|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_137, ~z~0=v_~z~0_175, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 18:23:15,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L861-->L863-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_139 256)) (= 0 (mod v_~z$r_buff0_thd0~0_18 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:23:15,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L863-2-->L863-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In961291966 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In961291966 256)))) (or (and (= |ULTIMATE.start_main_#t~ite59_Out961291966| ~z$w_buff1~0_In961291966) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out961291966| ~z~0_In961291966)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In961291966, ~z$w_buff1_used~0=~z$w_buff1_used~0_In961291966, ~z$w_buff1~0=~z$w_buff1~0_In961291966, ~z~0=~z~0_In961291966} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In961291966, ~z$w_buff1_used~0=~z$w_buff1_used~0_In961291966, ~z$w_buff1~0=~z$w_buff1~0_In961291966, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out961291966|, ~z~0=~z~0_In961291966} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 18:23:15,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L863-4-->L864: Formula: (= v_~z~0_54 |v_ULTIMATE.start_main_#t~ite59_8|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_7|, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 18:23:15,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L864-->L864-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1319271745 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1319271745 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1319271745|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-1319271745| ~z$w_buff0_used~0_In-1319271745)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1319271745, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1319271745} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1319271745, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1319271745|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1319271745} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 18:23:15,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L865-->L865-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-576908823 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-576908823 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-576908823 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-576908823 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out-576908823|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-576908823 |ULTIMATE.start_main_#t~ite62_Out-576908823|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-576908823, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-576908823, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-576908823, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-576908823} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-576908823|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-576908823, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-576908823, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-576908823, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-576908823} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 18:23:15,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L866-->L866-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-574765893 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-574765893 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite63_Out-574765893|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-574765893 |ULTIMATE.start_main_#t~ite63_Out-574765893|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-574765893, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-574765893} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-574765893|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-574765893, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-574765893} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 18:23:15,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L867-->L867-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1889497564 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1889497564 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1889497564 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1889497564 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite64_Out1889497564| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite64_Out1889497564| ~z$r_buff1_thd0~0_In1889497564) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1889497564, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1889497564, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1889497564, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1889497564} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1889497564, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1889497564, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1889497564, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1889497564, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1889497564|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 18:23:15,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L867-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 1 v_~__unbuffered_p3_EAX~0_35) (= 0 v_~__unbuffered_p3_EBX~0_22) (= v_~x~0_35 2))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite64_41|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_35, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_171, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_35, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:23:15,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:23:15 BasicIcfg [2019-12-07 18:23:15,714 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:23:15,714 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:23:15,714 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:23:15,714 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:23:15,715 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:21:37" (3/4) ... [2019-12-07 18:23:15,716 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:23:15,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse0 (store |v_#valid_89| 0 0))) (and (= v_~__unbuffered_cnt~0_140 0) (= 0 v_~__unbuffered_p2_EAX~0_75) (= v_~main$tmp_guard1~0_60 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t493~0.base_38| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t493~0.base_38|) |v_ULTIMATE.start_main_~#t493~0.offset_25| 0)) |v_#memory_int_25|) (= v_~z$r_buff0_thd2~0_131 0) (= 0 v_~z$flush_delayed~0_223) (= |v_#NULL.offset_6| 0) (= v_~z$w_buff1~0_366 0) (= v_~z$r_buff0_thd0~0_214 0) (= v_~z$r_buff1_thd2~0_149 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd1~0_149 0) (= v_~z$read_delayed_var~0.base_8 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~y~0_46 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t493~0.base_38|) (= |v_ULTIMATE.start_main_~#t493~0.offset_25| 0) (= v_~a~0_48 0) (= 0 v_~z$mem_tmp~0_195) (= 0 v_~z$r_buff1_thd4~0_355) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_712 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t493~0.base_38| 4)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t493~0.base_38|)) (= (store .cse0 |v_ULTIMATE.start_main_~#t493~0.base_38| 1) |v_#valid_87|) (< 0 |v_#StackHeapBarrier_20|) (= v_~z$w_buff0~0_640 0) (= v_~main$tmp_guard0~0_47 0) (= 0 v_~__unbuffered_p1_EAX~0_63) (= v_~z~0_314 0) (= 0 v_~__unbuffered_p3_EBX~0_65) (= 0 v_~z$r_buff0_thd3~0_453) (= v_~z$w_buff0_used~0_1093 0) (= 0 v_~__unbuffered_p3_EAX~0_90) (= v_~weak$$choice2~0_273 0) (= 0 v_~weak$$choice0~0_182) (= 0 v_~z$r_buff0_thd4~0_575) (= v_~z$r_buff1_thd0~0_227 0) (= 0 v_~z$r_buff1_thd3~0_381) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~x~0_88 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_149, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_119|, ULTIMATE.start_main_~#t496~0.base=|v_ULTIMATE.start_main_~#t496~0.base_22|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_214, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_575, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_90, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, ULTIMATE.start_main_~#t493~0.offset=|v_ULTIMATE.start_main_~#t493~0.offset_25|, ULTIMATE.start_main_~#t493~0.base=|v_ULTIMATE.start_main_~#t493~0.base_38|, ~z$mem_tmp~0=v_~z$mem_tmp~0_195, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_712, ~z$flush_delayed~0=v_~z$flush_delayed~0_223, ULTIMATE.start_main_~#t496~0.offset=|v_ULTIMATE.start_main_~#t496~0.offset_16|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_182, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_183|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_149, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_453, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_88, ULTIMATE.start_main_~#t495~0.offset=|v_ULTIMATE.start_main_~#t495~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_355, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_~#t495~0.base=|v_ULTIMATE.start_main_~#t495~0.base_30|, ~z$w_buff1~0=v_~z$w_buff1~0_366, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_60, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t494~0.offset=|v_ULTIMATE.start_main_~#t494~0.offset_26|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_227, ~y~0=v_~y~0_46, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_131, ULTIMATE.start_main_~#t494~0.base=|v_ULTIMATE.start_main_~#t494~0.base_40|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1093, ~z$w_buff0~0=v_~z$w_buff0~0_640, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_381, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_47, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_65, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_37|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_58|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_314, ~weak$$choice2~0=v_~weak$$choice2~0_273, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_~#t496~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t493~0.offset, ULTIMATE.start_main_~#t493~0.base, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t496~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t495~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ULTIMATE.start_main_~#t495~0.base, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t494~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t494~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:23:15,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L851-1-->L853: Formula: (and (= 0 (select |v_#valid_46| |v_ULTIMATE.start_main_~#t494~0.base_11|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t494~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t494~0.base_11|)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t494~0.base_11|) (= |v_#valid_45| (store |v_#valid_46| |v_ULTIMATE.start_main_~#t494~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t494~0.offset_10|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t494~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t494~0.base_11|) |v_ULTIMATE.start_main_~#t494~0.offset_10| 1)) |v_#memory_int_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t494~0.base=|v_ULTIMATE.start_main_~#t494~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_~#t494~0.offset=|v_ULTIMATE.start_main_~#t494~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t494~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t494~0.offset] because there is no mapped edge [2019-12-07 18:23:15,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t495~0.offset_11|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t495~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t495~0.base_11| 0)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t495~0.base_11| 4)) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t495~0.base_11| 1)) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t495~0.base_11|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t495~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t495~0.base_11|) |v_ULTIMATE.start_main_~#t495~0.offset_11| 2)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_43|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t495~0.base=|v_ULTIMATE.start_main_~#t495~0.base_11|, #length=|v_#length_21|, ULTIMATE.start_main_~#t495~0.offset=|v_ULTIMATE.start_main_~#t495~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t495~0.base, #length, ULTIMATE.start_main_~#t495~0.offset] because there is no mapped edge [2019-12-07 18:23:15,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L855-1-->L857: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t496~0.base_9|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t496~0.base_9| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t496~0.base_9|) |v_ULTIMATE.start_main_~#t496~0.offset_8| 3)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t496~0.base_9|)) (= 0 |v_ULTIMATE.start_main_~#t496~0.offset_8|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t496~0.base_9| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t496~0.base_9|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t496~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t496~0.base=|v_ULTIMATE.start_main_~#t496~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_4|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t496~0.offset=|v_ULTIMATE.start_main_~#t496~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t496~0.base, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length, ULTIMATE.start_main_~#t496~0.offset] because there is no mapped edge [2019-12-07 18:23:15,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L4-->L813: Formula: (and (= ~z$r_buff1_thd4~0_Out-367636226 ~z$r_buff0_thd4~0_In-367636226) (= ~z$r_buff1_thd2~0_Out-367636226 ~z$r_buff0_thd2~0_In-367636226) (= 1 ~z$r_buff0_thd4~0_Out-367636226) (= |P3Thread1of1ForFork2_#t~nondet27_In-367636226| ~weak$$choice2~0_Out-367636226) (= ~z~0_In-367636226 ~z$mem_tmp~0_Out-367636226) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-367636226)) (= ~z$r_buff0_thd0~0_In-367636226 ~z$r_buff1_thd0~0_Out-367636226) (= ~weak$$choice2~0_Out-367636226 ~z$flush_delayed~0_Out-367636226) (= ~z$r_buff1_thd1~0_Out-367636226 ~z$r_buff0_thd1~0_In-367636226) (= |P3Thread1of1ForFork2_#t~nondet26_In-367636226| ~weak$$choice0~0_Out-367636226) (= ~z$r_buff1_thd3~0_Out-367636226 ~z$r_buff0_thd3~0_In-367636226)) InVars {P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_In-367636226|, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_In-367636226|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-367636226, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-367636226, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-367636226, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-367636226, ~z~0=~z~0_In-367636226, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-367636226, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-367636226} OutVars{P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_Out-367636226|, ~z$mem_tmp~0=~z$mem_tmp~0_Out-367636226, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_Out-367636226|, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-367636226, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-367636226, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-367636226, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-367636226, ~z$flush_delayed~0=~z$flush_delayed~0_Out-367636226, ~weak$$choice0~0=~weak$$choice0~0_Out-367636226, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-367636226, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-367636226, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-367636226, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-367636226, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-367636226, ~z~0=~z~0_In-367636226, ~weak$$choice2~0=~weak$$choice2~0_Out-367636226, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-367636226, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-367636226} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~nondet26, ~z$mem_tmp~0, P3Thread1of1ForFork2_#t~nondet27, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0] because there is no mapped edge [2019-12-07 18:23:15,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L813-2-->L813-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out1001372669| |P3Thread1of1ForFork2_#t~ite29_Out1001372669|)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1001372669 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1001372669 256)))) (or (and .cse0 (not .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out1001372669| ~z$w_buff0~0_In1001372669) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= |P3Thread1of1ForFork2_#t~ite28_Out1001372669| ~z$w_buff1~0_In1001372669)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1001372669, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1001372669, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1001372669, ~z$w_buff1~0=~z$w_buff1~0_In1001372669} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1001372669|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out1001372669|, ~z$w_buff0~0=~z$w_buff0~0_In1001372669, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1001372669, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1001372669, ~z$w_buff1~0=~z$w_buff1~0_In1001372669} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 18:23:15,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L818-->L819: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~z$r_buff0_thd4~0_131 v_~z$r_buff0_thd4~0_130)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_10|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 18:23:15,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1255391775 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out-1255391775| ~z$mem_tmp~0_In-1255391775)) (and .cse0 (= ~z~0_In-1255391775 |P3Thread1of1ForFork2_#t~ite48_Out-1255391775|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1255391775, ~z$flush_delayed~0=~z$flush_delayed~0_In-1255391775, ~z~0=~z~0_In-1255391775} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1255391775, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-1255391775|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1255391775, ~z~0=~z~0_In-1255391775} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 18:23:15,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_12| v_P0Thread1of1ForFork3_~arg.offset_10) (= v_P0Thread1of1ForFork3_~arg.base_10 |v_P0Thread1of1ForFork3_#in~arg.base_12|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_15 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_23 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_10, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_10, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 18:23:15,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~y~0_32 v_~__unbuffered_p1_EAX~0_9) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~x~0_11 2)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~y~0=v_~y~0_32} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_32, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 18:23:15,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In966073600 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In966073600 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite51_Out966073600| 0) (not .cse1)) (and (= ~z$w_buff0_used~0_In966073600 |P3Thread1of1ForFork2_#t~ite51_Out966073600|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In966073600, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In966073600} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out966073600|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In966073600, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In966073600} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 18:23:15,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In335834940 256)))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out335834940| ~z~0_In335834940)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite25_Out335834940| ~z$mem_tmp~0_In335834940)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In335834940, ~z$flush_delayed~0=~z$flush_delayed~0_In335834940, ~z~0=~z~0_In335834940} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In335834940, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out335834940|, ~z$flush_delayed~0=~z$flush_delayed~0_In335834940, ~z~0=~z~0_In335834940} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 18:23:15,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L830-->L830-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1765120801 256))) (.cse3 (= (mod ~z$r_buff0_thd4~0_In1765120801 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1765120801 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In1765120801 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite52_Out1765120801| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite52_Out1765120801| ~z$w_buff1_used~0_In1765120801) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1765120801, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1765120801, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1765120801, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1765120801} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out1765120801|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1765120801, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1765120801, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1765120801, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1765120801} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 18:23:15,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L831-->L832: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In1846651847 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1846651847 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_Out1846651847 ~z$r_buff0_thd4~0_In1846651847))) (or (and (not .cse0) (= ~z$r_buff0_thd4~0_Out1846651847 0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1846651847, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1846651847} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out1846651847|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1846651847, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1846651847} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 18:23:15,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1726631923 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-1726631923 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In-1726631923 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1726631923 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-1726631923| 0)) (and (= ~z$r_buff1_thd4~0_In-1726631923 |P3Thread1of1ForFork2_#t~ite54_Out-1726631923|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1726631923, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1726631923, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1726631923, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1726631923} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-1726631923|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1726631923, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1726631923, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1726631923, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1726631923} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 18:23:15,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L832-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P3Thread1of1ForFork2_#t~ite54_22| v_~z$r_buff1_thd4~0_191) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_21|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_191, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:23:15,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L783-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_137) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~z~0_175 |v_P2Thread1of1ForFork1_#t~ite25_36|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_137, ~z~0=v_~z~0_175, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 18:23:15,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L861-->L863-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_139 256)) (= 0 (mod v_~z$r_buff0_thd0~0_18 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:23:15,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L863-2-->L863-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In961291966 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In961291966 256)))) (or (and (= |ULTIMATE.start_main_#t~ite59_Out961291966| ~z$w_buff1~0_In961291966) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out961291966| ~z~0_In961291966)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In961291966, ~z$w_buff1_used~0=~z$w_buff1_used~0_In961291966, ~z$w_buff1~0=~z$w_buff1~0_In961291966, ~z~0=~z~0_In961291966} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In961291966, ~z$w_buff1_used~0=~z$w_buff1_used~0_In961291966, ~z$w_buff1~0=~z$w_buff1~0_In961291966, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out961291966|, ~z~0=~z~0_In961291966} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 18:23:15,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L863-4-->L864: Formula: (= v_~z~0_54 |v_ULTIMATE.start_main_#t~ite59_8|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_7|, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 18:23:15,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L864-->L864-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1319271745 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1319271745 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1319271745|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out-1319271745| ~z$w_buff0_used~0_In-1319271745)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1319271745, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1319271745} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1319271745, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1319271745|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1319271745} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 18:23:15,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L865-->L865-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-576908823 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-576908823 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-576908823 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-576908823 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out-576908823|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-576908823 |ULTIMATE.start_main_#t~ite62_Out-576908823|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-576908823, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-576908823, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-576908823, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-576908823} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-576908823|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-576908823, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-576908823, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-576908823, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-576908823} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 18:23:15,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L866-->L866-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-574765893 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-574765893 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite63_Out-574765893|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-574765893 |ULTIMATE.start_main_#t~ite63_Out-574765893|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-574765893, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-574765893} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-574765893|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-574765893, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-574765893} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 18:23:15,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L867-->L867-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1889497564 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1889497564 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1889497564 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1889497564 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite64_Out1889497564| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite64_Out1889497564| ~z$r_buff1_thd0~0_In1889497564) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1889497564, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1889497564, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1889497564, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1889497564} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1889497564, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1889497564, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1889497564, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1889497564, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1889497564|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 18:23:15,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L867-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 0 v_~__unbuffered_p2_EAX~0_33) (= 1 v_~__unbuffered_p3_EAX~0_35) (= 0 v_~__unbuffered_p3_EBX~0_22) (= v_~x~0_35 2))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite64_41|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_35, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_171, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_35, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:23:15,794 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_100184fb-5753-4e3e-b8e4-b26d34b5056c/bin/uautomizer/witness.graphml [2019-12-07 18:23:15,794 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:23:15,795 INFO L168 Benchmark]: Toolchain (without parser) took 98925.28 ms. Allocated memory was 1.0 GB in the beginning and 7.9 GB in the end (delta: 6.8 GB). Free memory was 937.2 MB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2019-12-07 18:23:15,795 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:23:15,795 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -132.0 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:23:15,796 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.90 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-12-07 18:23:15,796 INFO L168 Benchmark]: Boogie Preprocessor took 27.01 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:23:15,796 INFO L168 Benchmark]: RCFGBuilder took 466.51 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: 61.7 MB). Peak memory consumption was 61.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:23:15,796 INFO L168 Benchmark]: TraceAbstraction took 97891.25 ms. Allocated memory was 1.1 GB in the beginning and 7.9 GB in the end (delta: 6.7 GB). Free memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2019-12-07 18:23:15,797 INFO L168 Benchmark]: Witness Printer took 79.87 ms. Allocated memory is still 7.9 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:23:15,798 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 418.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -132.0 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.90 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 27.01 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 466.51 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: 61.7 MB). Peak memory consumption was 61.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 97891.25 ms. Allocated memory was 1.1 GB in the beginning and 7.9 GB in the end (delta: 6.7 GB). Free memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. * Witness Printer took 79.87 ms. Allocated memory is still 7.9 GB. Free memory was 4.1 GB in the beginning and 4.1 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 211 ProgramPointsBefore, 112 ProgramPointsAfterwards, 254 TransitionsBefore, 131 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 29 ChoiceCompositions, 11185 VarBasedMoverChecksPositive, 340 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 380 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 142340 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L851] FCALL, FORK 0 pthread_create(&t493, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L853] FCALL, FORK 0 pthread_create(&t494, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L855] FCALL, FORK 0 pthread_create(&t495, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L857] FCALL, FORK 0 pthread_create(&t496, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 1 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L813] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=9, x=0, y=0, z=0, z$flush_delayed=9, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L813] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L814] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=9, x=0, y=0, z=1, z$flush_delayed=9, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L814] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L815] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=9, x=0, y=0, z=1, z$flush_delayed=9, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L815] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L816] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=9, x=0, y=0, z=1, z$flush_delayed=9, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L816] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L817] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=9, x=0, y=0, z=1, z$flush_delayed=9, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L817] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L819] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=9, x=0, y=0, z=1, z$flush_delayed=9, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L819] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L820] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=9, x=0, y=0, z=1, z$flush_delayed=9, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L821] 4 z = z$flush_delayed ? z$mem_tmp : z [L822] 4 z$flush_delayed = (_Bool)0 [L825] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=9, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=9, 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_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L768] 3 y = 1 [L771] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 3 z$flush_delayed = weak$$choice2 [L774] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L775] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L775] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L776] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L777] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L778] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L778] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L779] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L780] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L781] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L781] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L828] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L829] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L830] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L864] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L865] 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 [L866] 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 5 procedures, 199 locations, 2 error locations. Result: UNSAFE, OverallTime: 97.7s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3432 SDtfs, 6055 SDslu, 5754 SDs, 0 SdLazy, 1068 SolverSat, 188 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264871occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 60.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 160618 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 777 NumberOfCodeBlocks, 777 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 692 ConstructedInterpolants, 0 QuantifiedInterpolants, 259860 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...