./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix040_pso.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_0a441572-bad0-4464-acb5-e5d36ec2e47d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0a441572-bad0-4464-acb5-e5d36ec2e47d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0a441572-bad0-4464-acb5-e5d36ec2e47d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0a441572-bad0-4464-acb5-e5d36ec2e47d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix040_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0a441572-bad0-4464-acb5-e5d36ec2e47d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0a441572-bad0-4464-acb5-e5d36ec2e47d/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 7f3ff5692b4857f658742378dd54561dcde78e34 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 16:16:50,258 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:16:50,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:16:50,267 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:16:50,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:16:50,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:16:50,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:16:50,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:16:50,272 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:16:50,273 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:16:50,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:16:50,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:16:50,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:16:50,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:16:50,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:16:50,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:16:50,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:16:50,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:16:50,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:16:50,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:16:50,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:16:50,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:16:50,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:16:50,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:16:50,285 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:16:50,286 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:16:50,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:16:50,286 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:16:50,286 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:16:50,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:16:50,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:16:50,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:16:50,288 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:16:50,289 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:16:50,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:16:50,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:16:50,290 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:16:50,291 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:16:50,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:16:50,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:16:50,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:16:50,293 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0a441572-bad0-4464-acb5-e5d36ec2e47d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 16:16:50,305 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:16:50,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:16:50,306 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:16:50,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:16:50,306 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:16:50,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:16:50,307 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:16:50,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:16:50,307 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:16:50,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:16:50,308 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:16:50,308 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:16:50,308 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:16:50,308 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:16:50,308 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:16:50,308 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:16:50,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:16:50,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:16:50,309 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:16:50,309 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:16:50,309 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:16:50,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:16:50,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:16:50,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:16:50,309 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:16:50,309 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:16:50,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:16:50,310 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:16:50,310 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:16:50,310 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_0a441572-bad0-4464-acb5-e5d36ec2e47d/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 -> 7f3ff5692b4857f658742378dd54561dcde78e34 [2019-12-07 16:16:50,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:16:50,420 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:16:50,422 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:16:50,424 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:16:50,424 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:16:50,424 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0a441572-bad0-4464-acb5-e5d36ec2e47d/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix040_pso.opt.i [2019-12-07 16:16:50,462 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0a441572-bad0-4464-acb5-e5d36ec2e47d/bin/uautomizer/data/ff2b7369b/c9886eef0cae4b2585bfb29907413bca/FLAG89f26b525 [2019-12-07 16:16:50,915 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:16:50,915 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0a441572-bad0-4464-acb5-e5d36ec2e47d/sv-benchmarks/c/pthread-wmm/mix040_pso.opt.i [2019-12-07 16:16:50,927 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0a441572-bad0-4464-acb5-e5d36ec2e47d/bin/uautomizer/data/ff2b7369b/c9886eef0cae4b2585bfb29907413bca/FLAG89f26b525 [2019-12-07 16:16:50,935 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0a441572-bad0-4464-acb5-e5d36ec2e47d/bin/uautomizer/data/ff2b7369b/c9886eef0cae4b2585bfb29907413bca [2019-12-07 16:16:50,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:16:50,938 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:16:50,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:16:50,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:16:50,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:16:50,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:16:50" (1/1) ... [2019-12-07 16:16:50,943 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 04:16:50, skipping insertion in model container [2019-12-07 16:16:50,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:16:50" (1/1) ... [2019-12-07 16:16:50,948 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:16:50,977 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:16:51,242 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:16:51,250 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:16:51,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:16:51,342 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:16:51,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:51 WrapperNode [2019-12-07 16:16:51,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:16:51,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:16:51,343 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:16:51,343 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:16:51,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:51" (1/1) ... [2019-12-07 16:16:51,362 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:51" (1/1) ... [2019-12-07 16:16:51,381 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:16:51,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:16:51,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:16:51,382 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:16:51,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:51" (1/1) ... [2019-12-07 16:16:51,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:51" (1/1) ... [2019-12-07 16:16:51,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:51" (1/1) ... [2019-12-07 16:16:51,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:51" (1/1) ... [2019-12-07 16:16:51,402 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:51" (1/1) ... [2019-12-07 16:16:51,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:51" (1/1) ... [2019-12-07 16:16:51,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:51" (1/1) ... [2019-12-07 16:16:51,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:16:51,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:16:51,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:16:51,412 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:16:51,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0a441572-bad0-4464-acb5-e5d36ec2e47d/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 16:16:51,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 16:16:51,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 16:16:51,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:16:51,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:16:51,457 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 16:16:51,458 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 16:16:51,458 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 16:16:51,458 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 16:16:51,458 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 16:16:51,458 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 16:16:51,458 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 16:16:51,458 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 16:16:51,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 16:16:51,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:16:51,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:16:51,459 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 16:16:51,799 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:16:51,799 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 16:16:51,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:16:51 BoogieIcfgContainer [2019-12-07 16:16:51,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:16:51,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:16:51,801 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:16:51,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:16:51,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:16:50" (1/3) ... [2019-12-07 16:16:51,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5668e27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:16:51, skipping insertion in model container [2019-12-07 16:16:51,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:51" (2/3) ... [2019-12-07 16:16:51,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5668e27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:16:51, skipping insertion in model container [2019-12-07 16:16:51,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:16:51" (3/3) ... [2019-12-07 16:16:51,804 INFO L109 eAbstractionObserver]: Analyzing ICFG mix040_pso.opt.i [2019-12-07 16:16:51,810 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 16:16:51,810 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:16:51,815 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 16:16:51,815 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 16:16:51,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,840 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,840 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,841 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,841 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,842 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,842 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,853 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,853 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,853 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,853 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,853 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:51,868 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 16:16:51,880 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:16:51,881 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:16:51,881 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:16:51,881 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:16:51,881 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:16:51,881 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:16:51,881 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:16:51,881 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:16:51,892 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 191 transitions [2019-12-07 16:16:51,893 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-12-07 16:16:51,944 INFO L134 PetriNetUnfolder]: 35/187 cut-off events. [2019-12-07 16:16:51,944 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:16:51,953 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 576 event pairs. 12/162 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 16:16:51,966 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-12-07 16:16:51,992 INFO L134 PetriNetUnfolder]: 35/187 cut-off events. [2019-12-07 16:16:51,993 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:16:51,996 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 576 event pairs. 12/162 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 16:16:52,008 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-07 16:16:52,009 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 16:16:54,856 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 16:16:55,056 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 16:16:55,157 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46301 [2019-12-07 16:16:55,157 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2019-12-07 16:16:55,160 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 83 transitions [2019-12-07 16:16:56,535 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27254 states. [2019-12-07 16:16:56,537 INFO L276 IsEmpty]: Start isEmpty. Operand 27254 states. [2019-12-07 16:16:56,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 16:16:56,542 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:16:56,543 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:16:56,543 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 16:16:56,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:16:56,547 INFO L82 PathProgramCache]: Analyzing trace with hash -2114616633, now seen corresponding path program 1 times [2019-12-07 16:16:56,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:16:56,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45040032] [2019-12-07 16:16:56,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:16:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:16:56,718 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 16:16:56,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45040032] [2019-12-07 16:16:56,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:16:56,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:16:56,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035496080] [2019-12-07 16:16:56,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:16:56,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:16:56,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:16:56,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:16:56,734 INFO L87 Difference]: Start difference. First operand 27254 states. Second operand 3 states. [2019-12-07 16:16:57,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:16:57,067 INFO L93 Difference]: Finished difference Result 26518 states and 112736 transitions. [2019-12-07 16:16:57,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:16:57,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 16:16:57,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:16:57,243 INFO L225 Difference]: With dead ends: 26518 [2019-12-07 16:16:57,243 INFO L226 Difference]: Without dead ends: 24958 [2019-12-07 16:16:57,244 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 16:16:57,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24958 states. [2019-12-07 16:16:57,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24958 to 24958. [2019-12-07 16:16:57,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24958 states. [2019-12-07 16:16:58,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24958 states to 24958 states and 105960 transitions. [2019-12-07 16:16:58,089 INFO L78 Accepts]: Start accepts. Automaton has 24958 states and 105960 transitions. Word has length 9 [2019-12-07 16:16:58,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:16:58,090 INFO L462 AbstractCegarLoop]: Abstraction has 24958 states and 105960 transitions. [2019-12-07 16:16:58,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:16:58,090 INFO L276 IsEmpty]: Start isEmpty. Operand 24958 states and 105960 transitions. [2019-12-07 16:16:58,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 16:16:58,095 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:16:58,095 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:16:58,096 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 16:16:58,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:16:58,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1982620494, now seen corresponding path program 1 times [2019-12-07 16:16:58,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:16:58,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066396373] [2019-12-07 16:16:58,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:16:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:16:58,153 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 16:16:58,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066396373] [2019-12-07 16:16:58,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:16:58,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:16:58,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694407799] [2019-12-07 16:16:58,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:16:58,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:16:58,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:16:58,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:16:58,155 INFO L87 Difference]: Start difference. First operand 24958 states and 105960 transitions. Second operand 4 states. [2019-12-07 16:16:58,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:16:58,458 INFO L93 Difference]: Finished difference Result 37710 states and 155548 transitions. [2019-12-07 16:16:58,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:16:58,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 16:16:58,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:16:58,724 INFO L225 Difference]: With dead ends: 37710 [2019-12-07 16:16:58,725 INFO L226 Difference]: Without dead ends: 37654 [2019-12-07 16:16:58,725 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 16:16:58,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37654 states. [2019-12-07 16:16:59,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37654 to 32850. [2019-12-07 16:16:59,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32850 states. [2019-12-07 16:16:59,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32850 states to 32850 states and 137140 transitions. [2019-12-07 16:16:59,631 INFO L78 Accepts]: Start accepts. Automaton has 32850 states and 137140 transitions. Word has length 15 [2019-12-07 16:16:59,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:16:59,631 INFO L462 AbstractCegarLoop]: Abstraction has 32850 states and 137140 transitions. [2019-12-07 16:16:59,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:16:59,631 INFO L276 IsEmpty]: Start isEmpty. Operand 32850 states and 137140 transitions. [2019-12-07 16:16:59,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:16:59,637 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:16:59,637 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 16:16:59,637 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 16:16:59,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:16:59,637 INFO L82 PathProgramCache]: Analyzing trace with hash 965433528, now seen corresponding path program 1 times [2019-12-07 16:16:59,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:16:59,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355314317] [2019-12-07 16:16:59,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:16:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:16:59,689 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 16:16:59,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355314317] [2019-12-07 16:16:59,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:16:59,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:16:59,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943825529] [2019-12-07 16:16:59,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:16:59,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:16:59,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:16:59,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:16:59,690 INFO L87 Difference]: Start difference. First operand 32850 states and 137140 transitions. Second operand 4 states. [2019-12-07 16:17:00,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:00,078 INFO L93 Difference]: Finished difference Result 42390 states and 176044 transitions. [2019-12-07 16:17:00,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:17:00,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 16:17:00,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:00,166 INFO L225 Difference]: With dead ends: 42390 [2019-12-07 16:17:00,166 INFO L226 Difference]: Without dead ends: 42338 [2019-12-07 16:17:00,167 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 16:17:00,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42338 states. [2019-12-07 16:17:00,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42338 to 35874. [2019-12-07 16:17:00,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35874 states. [2019-12-07 16:17:00,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35874 states to 35874 states and 149792 transitions. [2019-12-07 16:17:00,963 INFO L78 Accepts]: Start accepts. Automaton has 35874 states and 149792 transitions. Word has length 18 [2019-12-07 16:17:00,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:00,963 INFO L462 AbstractCegarLoop]: Abstraction has 35874 states and 149792 transitions. [2019-12-07 16:17:00,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:17:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 35874 states and 149792 transitions. [2019-12-07 16:17:00,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 16:17:00,977 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:00,977 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 16:17:00,977 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 16:17:00,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:00,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1915727965, now seen corresponding path program 1 times [2019-12-07 16:17:00,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:00,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242246322] [2019-12-07 16:17:00,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:01,032 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 16:17:01,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242246322] [2019-12-07 16:17:01,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:01,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:17:01,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234435964] [2019-12-07 16:17:01,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:17:01,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:01,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:17:01,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:17:01,034 INFO L87 Difference]: Start difference. First operand 35874 states and 149792 transitions. Second operand 3 states. [2019-12-07 16:17:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:01,272 INFO L93 Difference]: Finished difference Result 33990 states and 140132 transitions. [2019-12-07 16:17:01,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:17:01,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 16:17:01,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:01,346 INFO L225 Difference]: With dead ends: 33990 [2019-12-07 16:17:01,346 INFO L226 Difference]: Without dead ends: 33990 [2019-12-07 16:17:01,347 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 16:17:01,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33990 states. [2019-12-07 16:17:01,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33990 to 33286. [2019-12-07 16:17:01,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33286 states. [2019-12-07 16:17:02,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33286 states to 33286 states and 137292 transitions. [2019-12-07 16:17:02,213 INFO L78 Accepts]: Start accepts. Automaton has 33286 states and 137292 transitions. Word has length 20 [2019-12-07 16:17:02,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:02,213 INFO L462 AbstractCegarLoop]: Abstraction has 33286 states and 137292 transitions. [2019-12-07 16:17:02,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:17:02,213 INFO L276 IsEmpty]: Start isEmpty. Operand 33286 states and 137292 transitions. [2019-12-07 16:17:02,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 16:17:02,221 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:02,221 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 16:17:02,221 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 16:17:02,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:02,221 INFO L82 PathProgramCache]: Analyzing trace with hash -480610237, now seen corresponding path program 1 times [2019-12-07 16:17:02,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:02,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005738190] [2019-12-07 16:17:02,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:02,290 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 16:17:02,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005738190] [2019-12-07 16:17:02,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:02,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:17:02,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920104347] [2019-12-07 16:17:02,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:17:02,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:02,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:17:02,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:17:02,292 INFO L87 Difference]: Start difference. First operand 33286 states and 137292 transitions. Second operand 3 states. [2019-12-07 16:17:02,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:02,528 INFO L93 Difference]: Finished difference Result 58153 states and 229521 transitions. [2019-12-07 16:17:02,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:17:02,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 16:17:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:02,649 INFO L225 Difference]: With dead ends: 58153 [2019-12-07 16:17:02,649 INFO L226 Difference]: Without dead ends: 56257 [2019-12-07 16:17:02,650 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 16:17:02,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56257 states. [2019-12-07 16:17:03,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56257 to 54016. [2019-12-07 16:17:03,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54016 states. [2019-12-07 16:17:03,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54016 states to 54016 states and 213839 transitions. [2019-12-07 16:17:03,880 INFO L78 Accepts]: Start accepts. Automaton has 54016 states and 213839 transitions. Word has length 20 [2019-12-07 16:17:03,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:03,881 INFO L462 AbstractCegarLoop]: Abstraction has 54016 states and 213839 transitions. [2019-12-07 16:17:03,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:17:03,881 INFO L276 IsEmpty]: Start isEmpty. Operand 54016 states and 213839 transitions. [2019-12-07 16:17:03,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 16:17:03,894 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:03,894 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 16:17:03,895 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 16:17:03,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:03,895 INFO L82 PathProgramCache]: Analyzing trace with hash 732387999, now seen corresponding path program 1 times [2019-12-07 16:17:03,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:03,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494871313] [2019-12-07 16:17:03,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:03,952 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 16:17:03,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494871313] [2019-12-07 16:17:03,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:03,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:17:03,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116916286] [2019-12-07 16:17:03,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:17:03,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:03,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:17:03,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:17:03,953 INFO L87 Difference]: Start difference. First operand 54016 states and 213839 transitions. Second operand 4 states. [2019-12-07 16:17:04,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:04,187 INFO L93 Difference]: Finished difference Result 55350 states and 217039 transitions. [2019-12-07 16:17:04,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:17:04,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 16:17:04,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:04,305 INFO L225 Difference]: With dead ends: 55350 [2019-12-07 16:17:04,305 INFO L226 Difference]: Without dead ends: 55350 [2019-12-07 16:17:04,305 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 16:17:04,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55350 states. [2019-12-07 16:17:05,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55350 to 50220. [2019-12-07 16:17:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50220 states. [2019-12-07 16:17:05,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50220 states to 50220 states and 199318 transitions. [2019-12-07 16:17:05,486 INFO L78 Accepts]: Start accepts. Automaton has 50220 states and 199318 transitions. Word has length 21 [2019-12-07 16:17:05,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:05,487 INFO L462 AbstractCegarLoop]: Abstraction has 50220 states and 199318 transitions. [2019-12-07 16:17:05,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:17:05,487 INFO L276 IsEmpty]: Start isEmpty. Operand 50220 states and 199318 transitions. [2019-12-07 16:17:05,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 16:17:05,502 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:05,502 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] [2019-12-07 16:17:05,502 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 16:17:05,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:05,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2001005515, now seen corresponding path program 1 times [2019-12-07 16:17:05,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:05,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755615011] [2019-12-07 16:17:05,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:05,556 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 16:17:05,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755615011] [2019-12-07 16:17:05,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:05,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:17:05,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618894735] [2019-12-07 16:17:05,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:17:05,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:05,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:17:05,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:17:05,557 INFO L87 Difference]: Start difference. First operand 50220 states and 199318 transitions. Second operand 4 states. [2019-12-07 16:17:05,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:05,777 INFO L93 Difference]: Finished difference Result 55398 states and 217059 transitions. [2019-12-07 16:17:05,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:17:05,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 16:17:05,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:05,896 INFO L225 Difference]: With dead ends: 55398 [2019-12-07 16:17:05,896 INFO L226 Difference]: Without dead ends: 55398 [2019-12-07 16:17:05,896 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 16:17:06,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55398 states. [2019-12-07 16:17:07,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55398 to 49944. [2019-12-07 16:17:07,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49944 states. [2019-12-07 16:17:08,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49944 states to 49944 states and 198222 transitions. [2019-12-07 16:17:08,002 INFO L78 Accepts]: Start accepts. Automaton has 49944 states and 198222 transitions. Word has length 22 [2019-12-07 16:17:08,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:08,002 INFO L462 AbstractCegarLoop]: Abstraction has 49944 states and 198222 transitions. [2019-12-07 16:17:08,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:17:08,002 INFO L276 IsEmpty]: Start isEmpty. Operand 49944 states and 198222 transitions. [2019-12-07 16:17:08,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 16:17:08,019 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:08,019 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] [2019-12-07 16:17:08,020 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 16:17:08,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:08,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1352926639, now seen corresponding path program 1 times [2019-12-07 16:17:08,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:08,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418858948] [2019-12-07 16:17:08,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:08,046 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 16:17:08,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418858948] [2019-12-07 16:17:08,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:08,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:17:08,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388969969] [2019-12-07 16:17:08,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:17:08,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:08,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:17:08,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:17:08,048 INFO L87 Difference]: Start difference. First operand 49944 states and 198222 transitions. Second operand 4 states. [2019-12-07 16:17:08,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:08,112 INFO L93 Difference]: Finished difference Result 17296 states and 55120 transitions. [2019-12-07 16:17:08,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:17:08,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-07 16:17:08,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:08,133 INFO L225 Difference]: With dead ends: 17296 [2019-12-07 16:17:08,133 INFO L226 Difference]: Without dead ends: 17296 [2019-12-07 16:17:08,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:17:08,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17296 states. [2019-12-07 16:17:08,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17296 to 17296. [2019-12-07 16:17:08,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17296 states. [2019-12-07 16:17:08,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17296 states to 17296 states and 55120 transitions. [2019-12-07 16:17:08,376 INFO L78 Accepts]: Start accepts. Automaton has 17296 states and 55120 transitions. Word has length 23 [2019-12-07 16:17:08,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:08,377 INFO L462 AbstractCegarLoop]: Abstraction has 17296 states and 55120 transitions. [2019-12-07 16:17:08,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:17:08,377 INFO L276 IsEmpty]: Start isEmpty. Operand 17296 states and 55120 transitions. [2019-12-07 16:17:08,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:17:08,382 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:08,383 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 16:17:08,383 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 16:17:08,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:08,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1358005945, now seen corresponding path program 1 times [2019-12-07 16:17:08,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:08,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800981993] [2019-12-07 16:17:08,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:08,429 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 16:17:08,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800981993] [2019-12-07 16:17:08,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:08,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:17:08,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220984527] [2019-12-07 16:17:08,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:17:08,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:08,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:17:08,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:17:08,431 INFO L87 Difference]: Start difference. First operand 17296 states and 55120 transitions. Second operand 4 states. [2019-12-07 16:17:08,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:08,533 INFO L93 Difference]: Finished difference Result 25342 states and 80089 transitions. [2019-12-07 16:17:08,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:17:08,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-07 16:17:08,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:08,565 INFO L225 Difference]: With dead ends: 25342 [2019-12-07 16:17:08,565 INFO L226 Difference]: Without dead ends: 24078 [2019-12-07 16:17:08,565 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 16:17:08,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24078 states. [2019-12-07 16:17:08,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24078 to 17493. [2019-12-07 16:17:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17493 states. [2019-12-07 16:17:08,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17493 states to 17493 states and 55233 transitions. [2019-12-07 16:17:08,853 INFO L78 Accepts]: Start accepts. Automaton has 17493 states and 55233 transitions. Word has length 24 [2019-12-07 16:17:08,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:08,853 INFO L462 AbstractCegarLoop]: Abstraction has 17493 states and 55233 transitions. [2019-12-07 16:17:08,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:17:08,853 INFO L276 IsEmpty]: Start isEmpty. Operand 17493 states and 55233 transitions. [2019-12-07 16:17:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 16:17:08,860 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:08,860 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 16:17:08,860 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 16:17:08,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:08,861 INFO L82 PathProgramCache]: Analyzing trace with hash -697075173, now seen corresponding path program 1 times [2019-12-07 16:17:08,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:08,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772479008] [2019-12-07 16:17:08,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:08,977 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 16:17:08,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772479008] [2019-12-07 16:17:08,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:08,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:17:08,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092168144] [2019-12-07 16:17:08,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 16:17:08,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:08,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 16:17:08,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:17:08,978 INFO L87 Difference]: Start difference. First operand 17493 states and 55233 transitions. Second operand 9 states. [2019-12-07 16:17:09,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:09,392 INFO L93 Difference]: Finished difference Result 33116 states and 105295 transitions. [2019-12-07 16:17:09,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:17:09,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-07 16:17:09,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:09,433 INFO L225 Difference]: With dead ends: 33116 [2019-12-07 16:17:09,433 INFO L226 Difference]: Without dead ends: 31808 [2019-12-07 16:17:09,433 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:17:09,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31808 states. [2019-12-07 16:17:09,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31808 to 20518. [2019-12-07 16:17:09,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20518 states. [2019-12-07 16:17:09,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20518 states to 20518 states and 65339 transitions. [2019-12-07 16:17:09,797 INFO L78 Accepts]: Start accepts. Automaton has 20518 states and 65339 transitions. Word has length 25 [2019-12-07 16:17:09,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:09,798 INFO L462 AbstractCegarLoop]: Abstraction has 20518 states and 65339 transitions. [2019-12-07 16:17:09,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 16:17:09,798 INFO L276 IsEmpty]: Start isEmpty. Operand 20518 states and 65339 transitions. [2019-12-07 16:17:09,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 16:17:09,806 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:09,806 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 16:17:09,806 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 16:17:09,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:09,806 INFO L82 PathProgramCache]: Analyzing trace with hash 851482561, now seen corresponding path program 2 times [2019-12-07 16:17:09,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:09,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202319389] [2019-12-07 16:17:09,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:09,849 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 16:17:09,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202319389] [2019-12-07 16:17:09,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:09,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:17:09,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875564665] [2019-12-07 16:17:09,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:17:09,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:09,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:17:09,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:17:09,850 INFO L87 Difference]: Start difference. First operand 20518 states and 65339 transitions. Second operand 5 states. [2019-12-07 16:17:10,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:10,019 INFO L93 Difference]: Finished difference Result 23384 states and 73520 transitions. [2019-12-07 16:17:10,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:17:10,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 16:17:10,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:10,037 INFO L225 Difference]: With dead ends: 23384 [2019-12-07 16:17:10,037 INFO L226 Difference]: Without dead ends: 14627 [2019-12-07 16:17:10,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 16:17:10,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14627 states. [2019-12-07 16:17:10,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14627 to 13899. [2019-12-07 16:17:10,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13899 states. [2019-12-07 16:17:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13899 states to 13899 states and 44270 transitions. [2019-12-07 16:17:10,241 INFO L78 Accepts]: Start accepts. Automaton has 13899 states and 44270 transitions. Word has length 25 [2019-12-07 16:17:10,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:10,242 INFO L462 AbstractCegarLoop]: Abstraction has 13899 states and 44270 transitions. [2019-12-07 16:17:10,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:17:10,242 INFO L276 IsEmpty]: Start isEmpty. Operand 13899 states and 44270 transitions. [2019-12-07 16:17:10,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 16:17:10,247 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:10,247 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 16:17:10,247 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 16:17:10,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:10,248 INFO L82 PathProgramCache]: Analyzing trace with hash 157402467, now seen corresponding path program 3 times [2019-12-07 16:17:10,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:10,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202852099] [2019-12-07 16:17:10,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:10,276 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 16:17:10,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202852099] [2019-12-07 16:17:10,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:10,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:17:10,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116862722] [2019-12-07 16:17:10,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:17:10,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:10,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:17:10,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:17:10,278 INFO L87 Difference]: Start difference. First operand 13899 states and 44270 transitions. Second operand 5 states. [2019-12-07 16:17:10,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:10,309 INFO L93 Difference]: Finished difference Result 4089 states and 11784 transitions. [2019-12-07 16:17:10,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:17:10,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 16:17:10,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:10,313 INFO L225 Difference]: With dead ends: 4089 [2019-12-07 16:17:10,313 INFO L226 Difference]: Without dead ends: 4037 [2019-12-07 16:17:10,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:17:10,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4037 states. [2019-12-07 16:17:10,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4037 to 3361. [2019-12-07 16:17:10,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3361 states. [2019-12-07 16:17:10,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3361 states to 3361 states and 9405 transitions. [2019-12-07 16:17:10,348 INFO L78 Accepts]: Start accepts. Automaton has 3361 states and 9405 transitions. Word has length 25 [2019-12-07 16:17:10,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:10,348 INFO L462 AbstractCegarLoop]: Abstraction has 3361 states and 9405 transitions. [2019-12-07 16:17:10,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:17:10,349 INFO L276 IsEmpty]: Start isEmpty. Operand 3361 states and 9405 transitions. [2019-12-07 16:17:10,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 16:17:10,351 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:10,351 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] [2019-12-07 16:17:10,352 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 16:17:10,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:10,352 INFO L82 PathProgramCache]: Analyzing trace with hash -617388800, now seen corresponding path program 1 times [2019-12-07 16:17:10,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:10,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088968512] [2019-12-07 16:17:10,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:10,376 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 16:17:10,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088968512] [2019-12-07 16:17:10,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:10,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:17:10,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711639472] [2019-12-07 16:17:10,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:17:10,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:10,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:17:10,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:17:10,377 INFO L87 Difference]: Start difference. First operand 3361 states and 9405 transitions. Second operand 3 states. [2019-12-07 16:17:10,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:10,410 INFO L93 Difference]: Finished difference Result 4760 states and 13096 transitions. [2019-12-07 16:17:10,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:17:10,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 16:17:10,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:10,415 INFO L225 Difference]: With dead ends: 4760 [2019-12-07 16:17:10,415 INFO L226 Difference]: Without dead ends: 4760 [2019-12-07 16:17:10,415 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 16:17:10,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4760 states. [2019-12-07 16:17:10,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4760 to 4132. [2019-12-07 16:17:10,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4132 states. [2019-12-07 16:17:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4132 states to 4132 states and 11664 transitions. [2019-12-07 16:17:10,458 INFO L78 Accepts]: Start accepts. Automaton has 4132 states and 11664 transitions. Word has length 32 [2019-12-07 16:17:10,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:10,458 INFO L462 AbstractCegarLoop]: Abstraction has 4132 states and 11664 transitions. [2019-12-07 16:17:10,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:17:10,458 INFO L276 IsEmpty]: Start isEmpty. Operand 4132 states and 11664 transitions. [2019-12-07 16:17:10,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 16:17:10,461 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:10,461 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] [2019-12-07 16:17:10,462 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 16:17:10,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:10,462 INFO L82 PathProgramCache]: Analyzing trace with hash 937445460, now seen corresponding path program 1 times [2019-12-07 16:17:10,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:10,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416619816] [2019-12-07 16:17:10,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:10,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:10,480 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 16:17:10,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416619816] [2019-12-07 16:17:10,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:10,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:17:10,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065626375] [2019-12-07 16:17:10,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:17:10,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:10,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:17:10,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:17:10,481 INFO L87 Difference]: Start difference. First operand 4132 states and 11664 transitions. Second operand 3 states. [2019-12-07 16:17:10,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:10,508 INFO L93 Difference]: Finished difference Result 4760 states and 12750 transitions. [2019-12-07 16:17:10,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:17:10,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 16:17:10,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:10,512 INFO L225 Difference]: With dead ends: 4760 [2019-12-07 16:17:10,512 INFO L226 Difference]: Without dead ends: 4760 [2019-12-07 16:17:10,512 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 16:17:10,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4760 states. [2019-12-07 16:17:10,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4760 to 4022. [2019-12-07 16:17:10,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4022 states. [2019-12-07 16:17:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4022 states to 4022 states and 11018 transitions. [2019-12-07 16:17:10,554 INFO L78 Accepts]: Start accepts. Automaton has 4022 states and 11018 transitions. Word has length 32 [2019-12-07 16:17:10,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:10,555 INFO L462 AbstractCegarLoop]: Abstraction has 4022 states and 11018 transitions. [2019-12-07 16:17:10,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:17:10,555 INFO L276 IsEmpty]: Start isEmpty. Operand 4022 states and 11018 transitions. [2019-12-07 16:17:10,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 16:17:10,558 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:10,558 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:10,558 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 16:17:10,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:10,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1469218903, now seen corresponding path program 1 times [2019-12-07 16:17:10,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:10,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449569692] [2019-12-07 16:17:10,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:10,607 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 16:17:10,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449569692] [2019-12-07 16:17:10,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:10,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:17:10,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969463327] [2019-12-07 16:17:10,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:17:10,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:10,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:17:10,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:17:10,609 INFO L87 Difference]: Start difference. First operand 4022 states and 11018 transitions. Second operand 6 states. [2019-12-07 16:17:10,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:10,803 INFO L93 Difference]: Finished difference Result 6925 states and 18062 transitions. [2019-12-07 16:17:10,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:17:10,804 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-07 16:17:10,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:10,810 INFO L225 Difference]: With dead ends: 6925 [2019-12-07 16:17:10,810 INFO L226 Difference]: Without dead ends: 6853 [2019-12-07 16:17:10,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:17:10,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6853 states. [2019-12-07 16:17:10,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6853 to 4050. [2019-12-07 16:17:10,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4050 states. [2019-12-07 16:17:10,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 11064 transitions. [2019-12-07 16:17:10,859 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 11064 transitions. Word has length 32 [2019-12-07 16:17:10,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:10,859 INFO L462 AbstractCegarLoop]: Abstraction has 4050 states and 11064 transitions. [2019-12-07 16:17:10,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:17:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 11064 transitions. [2019-12-07 16:17:10,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 16:17:10,863 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:10,863 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] [2019-12-07 16:17:10,863 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 16:17:10,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:10,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1277869158, now seen corresponding path program 1 times [2019-12-07 16:17:10,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:10,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100197545] [2019-12-07 16:17:10,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:10,910 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 16:17:10,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100197545] [2019-12-07 16:17:10,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:10,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:17:10,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699293400] [2019-12-07 16:17:10,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:17:10,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:10,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:17:10,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:17:10,911 INFO L87 Difference]: Start difference. First operand 4050 states and 11064 transitions. Second operand 6 states. [2019-12-07 16:17:11,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:11,101 INFO L93 Difference]: Finished difference Result 5890 states and 15340 transitions. [2019-12-07 16:17:11,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:17:11,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 16:17:11,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:11,107 INFO L225 Difference]: With dead ends: 5890 [2019-12-07 16:17:11,107 INFO L226 Difference]: Without dead ends: 5746 [2019-12-07 16:17:11,107 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:17:11,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5746 states. [2019-12-07 16:17:11,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5746 to 3856. [2019-12-07 16:17:11,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3856 states. [2019-12-07 16:17:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3856 states to 3856 states and 10529 transitions. [2019-12-07 16:17:11,154 INFO L78 Accepts]: Start accepts. Automaton has 3856 states and 10529 transitions. Word has length 33 [2019-12-07 16:17:11,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:11,154 INFO L462 AbstractCegarLoop]: Abstraction has 3856 states and 10529 transitions. [2019-12-07 16:17:11,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:17:11,154 INFO L276 IsEmpty]: Start isEmpty. Operand 3856 states and 10529 transitions. [2019-12-07 16:17:11,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 16:17:11,158 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:11,158 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 16:17:11,158 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 16:17:11,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:11,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1953002804, now seen corresponding path program 1 times [2019-12-07 16:17:11,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:11,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934962728] [2019-12-07 16:17:11,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:11,216 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 16:17:11,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934962728] [2019-12-07 16:17:11,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:11,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:17:11,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411732362] [2019-12-07 16:17:11,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:17:11,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:11,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:17:11,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:17:11,217 INFO L87 Difference]: Start difference. First operand 3856 states and 10529 transitions. Second operand 4 states. [2019-12-07 16:17:11,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:11,252 INFO L93 Difference]: Finished difference Result 6439 states and 16813 transitions. [2019-12-07 16:17:11,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:17:11,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-07 16:17:11,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:11,256 INFO L225 Difference]: With dead ends: 6439 [2019-12-07 16:17:11,256 INFO L226 Difference]: Without dead ends: 4363 [2019-12-07 16:17:11,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:17:11,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4363 states. [2019-12-07 16:17:11,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4363 to 3780. [2019-12-07 16:17:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3780 states. [2019-12-07 16:17:11,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 3780 states and 9898 transitions. [2019-12-07 16:17:11,294 INFO L78 Accepts]: Start accepts. Automaton has 3780 states and 9898 transitions. Word has length 34 [2019-12-07 16:17:11,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:11,294 INFO L462 AbstractCegarLoop]: Abstraction has 3780 states and 9898 transitions. [2019-12-07 16:17:11,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:17:11,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 9898 transitions. [2019-12-07 16:17:11,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 16:17:11,296 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:11,296 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 16:17:11,297 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 16:17:11,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:11,297 INFO L82 PathProgramCache]: Analyzing trace with hash -926430000, now seen corresponding path program 2 times [2019-12-07 16:17:11,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:11,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618133559] [2019-12-07 16:17:11,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:11,334 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 16:17:11,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618133559] [2019-12-07 16:17:11,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:11,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:17:11,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341840283] [2019-12-07 16:17:11,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:17:11,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:11,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:17:11,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:17:11,335 INFO L87 Difference]: Start difference. First operand 3780 states and 9898 transitions. Second operand 6 states. [2019-12-07 16:17:11,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:11,369 INFO L93 Difference]: Finished difference Result 2628 states and 7229 transitions. [2019-12-07 16:17:11,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:17:11,369 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 16:17:11,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:11,372 INFO L225 Difference]: With dead ends: 2628 [2019-12-07 16:17:11,372 INFO L226 Difference]: Without dead ends: 1969 [2019-12-07 16:17:11,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:17:11,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-12-07 16:17:11,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1573. [2019-12-07 16:17:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2019-12-07 16:17:11,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 4319 transitions. [2019-12-07 16:17:11,394 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 4319 transitions. Word has length 34 [2019-12-07 16:17:11,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:11,394 INFO L462 AbstractCegarLoop]: Abstraction has 1573 states and 4319 transitions. [2019-12-07 16:17:11,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:17:11,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 4319 transitions. [2019-12-07 16:17:11,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 16:17:11,396 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:11,396 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] [2019-12-07 16:17:11,396 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 16:17:11,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:11,396 INFO L82 PathProgramCache]: Analyzing trace with hash 616592385, now seen corresponding path program 1 times [2019-12-07 16:17:11,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:11,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153694943] [2019-12-07 16:17:11,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:11,467 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 16:17:11,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153694943] [2019-12-07 16:17:11,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:11,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:17:11,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660388121] [2019-12-07 16:17:11,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:17:11,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:11,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:17:11,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:17:11,468 INFO L87 Difference]: Start difference. First operand 1573 states and 4319 transitions. Second operand 7 states. [2019-12-07 16:17:11,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:11,732 INFO L93 Difference]: Finished difference Result 5633 states and 15131 transitions. [2019-12-07 16:17:11,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 16:17:11,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-07 16:17:11,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:11,735 INFO L225 Difference]: With dead ends: 5633 [2019-12-07 16:17:11,735 INFO L226 Difference]: Without dead ends: 3677 [2019-12-07 16:17:11,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-12-07 16:17:11,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3677 states. [2019-12-07 16:17:11,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3677 to 1788. [2019-12-07 16:17:11,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1788 states. [2019-12-07 16:17:11,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 4869 transitions. [2019-12-07 16:17:11,761 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 4869 transitions. Word has length 48 [2019-12-07 16:17:11,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:11,761 INFO L462 AbstractCegarLoop]: Abstraction has 1788 states and 4869 transitions. [2019-12-07 16:17:11,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:17:11,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 4869 transitions. [2019-12-07 16:17:11,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 16:17:11,762 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:11,762 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] [2019-12-07 16:17:11,762 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 16:17:11,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:11,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1502542547, now seen corresponding path program 2 times [2019-12-07 16:17:11,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:11,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443766083] [2019-12-07 16:17:11,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:17:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:17:11,820 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:17:11,820 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:17:11,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_97| 0 0))) (and (= 0 v_~z$r_buff1_thd1~0_69) (= 0 v_~z$r_buff1_thd2~0_69) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1069~0.base_46|) (= v_~z$w_buff0~0_326 0) (= 0 v_~z$r_buff1_thd4~0_128) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= 0 v_~__unbuffered_p3_EBX~0_104) (= v_~b~0_46 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1069~0.base_46| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1069~0.base_46|) |v_ULTIMATE.start_main_~#t1069~0.offset_30| 0)) |v_#memory_int_25|) (= v_~weak$$choice2~0_157 0) (= 0 v_~__unbuffered_p2_EAX~0_59) (= 0 v_~z$r_buff0_thd3~0_271) (= v_~z$r_buff0_thd0~0_83 0) (= 0 v_~z$flush_delayed~0_78) (= v_~main$tmp_guard1~0_45 0) (= v_~a~0_68 0) (= v_~z$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~weak$$choice0~0_39) (= |v_ULTIMATE.start_main_~#t1069~0.offset_30| 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z~0_172 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1069~0.base_46|)) (= 0 v_~z$r_buff0_thd4~0_139) (= v_~y~0_82 0) (= v_~z$read_delayed~0_7 0) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~z$r_buff1_thd3~0_242) (= 0 |v_#NULL.base_7|) (= v_~z$mem_tmp~0_49 0) (= v_~z$w_buff1_used~0_372 0) (= v_~z$r_buff1_thd0~0_144 0) (= v_~z$w_buff0_used~0_607 0) (= v_~x~0_74 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1069~0.base_46| 1) |v_#valid_95|) (= v_~__unbuffered_p3_EAX~0_105 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1069~0.base_46| 4)) (= v_~z$w_buff1~0_201 0) (= v_~__unbuffered_cnt~0_157 0) (= v_~z$r_buff0_thd2~0_25 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_69, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1069~0.base=|v_ULTIMATE.start_main_~#t1069~0.base_46|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_83, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_139, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_105, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_59, ~z$mem_tmp~0=v_~z$mem_tmp~0_49, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_372, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_42|, ~z$flush_delayed~0=v_~z$flush_delayed~0_78, ~weak$$choice0~0=v_~weak$$choice0~0_39, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_69, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_271, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157, ~x~0=v_~x~0_74, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_128, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_22|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1070~0.base=|v_ULTIMATE.start_main_~#t1070~0.base_45|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, ULTIMATE.start_main_~#t1072~0.offset=|v_ULTIMATE.start_main_~#t1072~0.offset_19|, ~y~0=v_~y~0_82, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_607, ~z$w_buff0~0=v_~z$w_buff0~0_326, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_242, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_66|, ULTIMATE.start_main_~#t1071~0.offset=|v_ULTIMATE.start_main_~#t1071~0.offset_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_128|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_104, ULTIMATE.start_main_~#t1069~0.offset=|v_ULTIMATE.start_main_~#t1069~0.offset_30|, ULTIMATE.start_main_~#t1071~0.base=|v_ULTIMATE.start_main_~#t1071~0.base_45|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_94|, ~b~0=v_~b~0_46, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~#t1070~0.offset=|v_ULTIMATE.start_main_~#t1070~0.offset_29|, ULTIMATE.start_main_~#t1072~0.base=|v_ULTIMATE.start_main_~#t1072~0.base_26|, ~z~0=v_~z~0_172, ~weak$$choice2~0=v_~weak$$choice2~0_157, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1069~0.base, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1070~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1072~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t1071~0.offset, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t1069~0.offset, ULTIMATE.start_main_~#t1071~0.base, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1070~0.offset, ULTIMATE.start_main_~#t1072~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 16:17:11,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L841-1-->L843: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1070~0.base_13| 4)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1070~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1070~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1070~0.base_13|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1070~0.base_13| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1070~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1070~0.base_13|) |v_ULTIMATE.start_main_~#t1070~0.offset_11| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1070~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1070~0.base=|v_ULTIMATE.start_main_~#t1070~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1070~0.offset=|v_ULTIMATE.start_main_~#t1070~0.offset_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1070~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1070~0.offset, #length] because there is no mapped edge [2019-12-07 16:17:11,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1071~0.base_13|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1071~0.base_13| 4)) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1071~0.base_13|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1071~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1071~0.base_13|) |v_ULTIMATE.start_main_~#t1071~0.offset_11| 2)) |v_#memory_int_19|) (not (= |v_ULTIMATE.start_main_~#t1071~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t1071~0.offset_11|) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1071~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t1071~0.offset=|v_ULTIMATE.start_main_~#t1071~0.offset_11|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1071~0.base=|v_ULTIMATE.start_main_~#t1071~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t1071~0.offset, #length, ULTIMATE.start_main_~#t1071~0.base] because there is no mapped edge [2019-12-07 16:17:11,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L845-1-->L847: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1072~0.base_11|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1072~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1072~0.base_11|) |v_ULTIMATE.start_main_~#t1072~0.offset_10| 3))) (not (= 0 |v_ULTIMATE.start_main_~#t1072~0.base_11|)) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1072~0.base_11| 1)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1072~0.base_11| 4)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1072~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1072~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1072~0.base=|v_ULTIMATE.start_main_~#t1072~0.base_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1072~0.offset=|v_ULTIMATE.start_main_~#t1072~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1072~0.base, #length, ULTIMATE.start_main_~#t1072~0.offset] because there is no mapped edge [2019-12-07 16:17:11,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_112 256))) (not (= (mod v_~z$w_buff1_used~0_69 256) 0)))) 1 0)) (= v_~z$w_buff0~0_26 v_~z$w_buff1~0_20) (= 1 v_~z$w_buff0~0_25) (= v_~z$w_buff0_used~0_113 v_~z$w_buff1_used~0_69) (= v_~z$w_buff0_used~0_112 1) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10)) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10) (= v_P3Thread1of1ForFork1_~arg.offset_8 |v_P3Thread1of1ForFork1_#in~arg.offset_10|) (= |v_P3Thread1of1ForFork1_#in~arg.base_10| v_P3Thread1of1ForFork1_~arg.base_8)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_26, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_25, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8|, ~z$w_buff1~0=v_~z$w_buff1~0_20, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_8, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_8} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 16:17:11,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_18| v_P0Thread1of1ForFork2_~arg.offset_16) (= v_P0Thread1of1ForFork2_~arg.base_16 |v_P0Thread1of1ForFork2_#in~arg.base_18|) (= v_~b~0_24 1) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= v_~x~0_35 1) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~b~0=v_~b~0_24, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_16, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|, ~x~0=v_~x~0_35, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_16} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 16:17:11,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_48 2) (= 0 |v_P1Thread1of1ForFork3_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_131 (+ v_~__unbuffered_cnt~0_132 1)) (= v_~y~0_47 1) (= |v_P1Thread1of1ForFork3_#in~arg.offset_14| v_P1Thread1of1ForFork3_~arg.offset_12) (= |v_P1Thread1of1ForFork3_#in~arg.base_14| v_P1Thread1of1ForFork3_~arg.base_12)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_3|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_12, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_12, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|, ~y~0=v_~y~0_47, ~x~0=v_~x~0_48} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-12-07 16:17:11,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L776-->L776-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In229920077 256) 0))) (or (and (= ~z$w_buff0~0_In229920077 |P2Thread1of1ForFork0_#t~ite9_Out229920077|) (= |P2Thread1of1ForFork0_#t~ite8_In229920077| |P2Thread1of1ForFork0_#t~ite8_Out229920077|) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite8_Out229920077| ~z$w_buff0~0_In229920077) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In229920077 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In229920077 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In229920077 256)) .cse1) (= (mod ~z$w_buff0_used~0_In229920077 256) 0))) (= |P2Thread1of1ForFork0_#t~ite8_Out229920077| |P2Thread1of1ForFork0_#t~ite9_Out229920077|)))) InVars {P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_In229920077|, ~z$w_buff0~0=~z$w_buff0~0_In229920077, ~z$w_buff0_used~0=~z$w_buff0_used~0_In229920077, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In229920077, ~z$w_buff1_used~0=~z$w_buff1_used~0_In229920077, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In229920077, ~weak$$choice2~0=~weak$$choice2~0_In229920077} OutVars{P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_Out229920077|, ~z$w_buff0~0=~z$w_buff0~0_In229920077, ~z$w_buff0_used~0=~z$w_buff0_used~0_In229920077, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In229920077, ~z$w_buff1_used~0=~z$w_buff1_used~0_In229920077, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In229920077, ~weak$$choice2~0=~weak$$choice2~0_In229920077, P2Thread1of1ForFork0_#t~ite9=|P2Thread1of1ForFork0_#t~ite9_Out229920077|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite8, P2Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 16:17:11,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L777-->L777-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1233372226 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite12_Out1233372226| ~z$w_buff1~0_In1233372226) (= |P2Thread1of1ForFork0_#t~ite11_In1233372226| |P2Thread1of1ForFork0_#t~ite11_Out1233372226|)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1233372226 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In1233372226 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In1233372226 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In1233372226 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite12_Out1233372226| |P2Thread1of1ForFork0_#t~ite11_Out1233372226|) .cse0 (= ~z$w_buff1~0_In1233372226 |P2Thread1of1ForFork0_#t~ite11_Out1233372226|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1233372226, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In1233372226|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1233372226, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1233372226, ~z$w_buff1~0=~z$w_buff1~0_In1233372226, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1233372226, ~weak$$choice2~0=~weak$$choice2~0_In1233372226} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out1233372226|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1233372226, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1233372226|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1233372226, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1233372226, ~z$w_buff1~0=~z$w_buff1~0_In1233372226, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1233372226, ~weak$$choice2~0=~weak$$choice2~0_In1233372226} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 16:17:11,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L778-->L778-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2124624543 256)))) (or (and (= ~z$w_buff0_used~0_In-2124624543 |P2Thread1of1ForFork0_#t~ite14_Out-2124624543|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-2124624543 256) 0))) (or (and .cse0 (= (mod ~z$w_buff1_used~0_In-2124624543 256) 0)) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-2124624543 256))) (= 0 (mod ~z$w_buff0_used~0_In-2124624543 256)))) (= |P2Thread1of1ForFork0_#t~ite14_Out-2124624543| |P2Thread1of1ForFork0_#t~ite15_Out-2124624543|) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite14_In-2124624543| |P2Thread1of1ForFork0_#t~ite14_Out-2124624543|) (not .cse1) (= ~z$w_buff0_used~0_In-2124624543 |P2Thread1of1ForFork0_#t~ite15_Out-2124624543|)))) InVars {P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_In-2124624543|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2124624543, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2124624543, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2124624543, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2124624543, ~weak$$choice2~0=~weak$$choice2~0_In-2124624543} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-2124624543|, P2Thread1of1ForFork0_#t~ite15=|P2Thread1of1ForFork0_#t~ite15_Out-2124624543|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2124624543, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2124624543, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2124624543, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2124624543, ~weak$$choice2~0=~weak$$choice2~0_In-2124624543} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, P2Thread1of1ForFork0_#t~ite15] because there is no mapped edge [2019-12-07 16:17:11,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L780-->L781: Formula: (and (not (= (mod v_~weak$$choice2~0_32 256) 0)) (= v_~z$r_buff0_thd3~0_73 v_~z$r_buff0_thd3~0_72)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_73, ~weak$$choice2~0=v_~weak$$choice2~0_32} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_72, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_9|, ~weak$$choice2~0=v_~weak$$choice2~0_32, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 16:17:11,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1523692515 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1523692515 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1523692515 |P3Thread1of1ForFork1_#t~ite28_Out1523692515|)) (and (not .cse0) (= |P3Thread1of1ForFork1_#t~ite28_Out1523692515| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1523692515, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1523692515} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1523692515, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out1523692515|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1523692515} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 16:17:11,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L783-->L791: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_16 v_~z$mem_tmp~0_4) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 16:17:11,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1960142224 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1960142224 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd4~0_In1960142224 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1960142224 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork1_#t~ite29_Out1960142224| ~z$w_buff1_used~0_In1960142224)) (and (= |P3Thread1of1ForFork1_#t~ite29_Out1960142224| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1960142224, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1960142224, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1960142224, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1960142224} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1960142224, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out1960142224|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1960142224, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1960142224, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1960142224} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 16:17:11,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L821-->L822: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-482255172 256))) (.cse2 (= ~z$r_buff0_thd4~0_Out-482255172 ~z$r_buff0_thd4~0_In-482255172)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-482255172 256)))) (or (and (= 0 ~z$r_buff0_thd4~0_Out-482255172) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse2 .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-482255172, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-482255172} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-482255172, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-482255172, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-482255172|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 16:17:11,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1921084419 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In1921084419 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1921084419 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1921084419 256)))) (or (and (= ~z$r_buff1_thd4~0_In1921084419 |P3Thread1of1ForFork1_#t~ite31_Out1921084419|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P3Thread1of1ForFork1_#t~ite31_Out1921084419|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1921084419, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1921084419, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1921084419, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1921084419} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1921084419, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1921084419, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1921084419, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1921084419, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out1921084419|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 16:17:11,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L822-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= v_~z$r_buff1_thd4~0_56 |v_P3Thread1of1ForFork1_#t~ite31_58|) (= |v_P3Thread1of1ForFork1_#res.offset_3| 0) (= |v_P3Thread1of1ForFork1_#res.base_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_58|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_56, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_3|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_57|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 16:17:11,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L847-1-->L853: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_60) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:17:11,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L853-2-->L853-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In241933967 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In241933967 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In241933967 |ULTIMATE.start_main_#t~ite36_Out241933967|)) (and (not .cse1) (= ~z$w_buff1~0_In241933967 |ULTIMATE.start_main_#t~ite36_Out241933967|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In241933967, ~z$w_buff1_used~0=~z$w_buff1_used~0_In241933967, ~z$w_buff1~0=~z$w_buff1~0_In241933967, ~z~0=~z~0_In241933967} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In241933967, ~z$w_buff1_used~0=~z$w_buff1_used~0_In241933967, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out241933967|, ~z$w_buff1~0=~z$w_buff1~0_In241933967, ~z~0=~z~0_In241933967} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 16:17:11,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L853-4-->L854: Formula: (= v_~z~0_38 |v_ULTIMATE.start_main_#t~ite36_16|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_16|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-07 16:17:11,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1735113814 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1735113814 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-1735113814| 0) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1735113814 |ULTIMATE.start_main_#t~ite38_Out-1735113814|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1735113814, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1735113814} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1735113814, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1735113814, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1735113814|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 16:17:11,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L855-->L855-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In1837783620 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1837783620 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1837783620 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1837783620 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out1837783620|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1837783620 |ULTIMATE.start_main_#t~ite39_Out1837783620|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1837783620, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1837783620, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1837783620, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1837783620} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1837783620, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1837783620|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1837783620, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1837783620, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1837783620} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 16:17:11,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1803193840 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1803193840 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1803193840| 0)) (and (= |ULTIMATE.start_main_#t~ite40_Out1803193840| ~z$r_buff0_thd0~0_In1803193840) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1803193840, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1803193840} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1803193840, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1803193840|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1803193840} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 16:17:11,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L857-->L857-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1324798285 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1324798285 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1324798285 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-1324798285 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite41_Out-1324798285|)) (and (= ~z$r_buff1_thd0~0_In-1324798285 |ULTIMATE.start_main_#t~ite41_Out-1324798285|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1324798285, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1324798285, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1324798285, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1324798285} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1324798285|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1324798285, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1324798285, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1324798285, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1324798285} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 16:17:11,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z$r_buff1_thd0~0_110 |v_ULTIMATE.start_main_#t~ite41_51|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~main$tmp_guard1~0_23 (ite (= (ite (not (and (= 1 v_~__unbuffered_p3_EAX~0_73) (= 0 v_~__unbuffered_p3_EBX~0_72) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~x~0_52 2) (= v_~y~0_52 2))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_51|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_50|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_110, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:17:11,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:17:11 BasicIcfg [2019-12-07 16:17:11,885 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:17:11,885 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:17:11,885 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:17:11,885 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:17:11,885 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:16:51" (3/4) ... [2019-12-07 16:17:11,887 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:17:11,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_97| 0 0))) (and (= 0 v_~z$r_buff1_thd1~0_69) (= 0 v_~z$r_buff1_thd2~0_69) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1069~0.base_46|) (= v_~z$w_buff0~0_326 0) (= 0 v_~z$r_buff1_thd4~0_128) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= 0 v_~__unbuffered_p3_EBX~0_104) (= v_~b~0_46 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1069~0.base_46| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1069~0.base_46|) |v_ULTIMATE.start_main_~#t1069~0.offset_30| 0)) |v_#memory_int_25|) (= v_~weak$$choice2~0_157 0) (= 0 v_~__unbuffered_p2_EAX~0_59) (= 0 v_~z$r_buff0_thd3~0_271) (= v_~z$r_buff0_thd0~0_83 0) (= 0 v_~z$flush_delayed~0_78) (= v_~main$tmp_guard1~0_45 0) (= v_~a~0_68 0) (= v_~z$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~weak$$choice0~0_39) (= |v_ULTIMATE.start_main_~#t1069~0.offset_30| 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z~0_172 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1069~0.base_46|)) (= 0 v_~z$r_buff0_thd4~0_139) (= v_~y~0_82 0) (= v_~z$read_delayed~0_7 0) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~z$r_buff1_thd3~0_242) (= 0 |v_#NULL.base_7|) (= v_~z$mem_tmp~0_49 0) (= v_~z$w_buff1_used~0_372 0) (= v_~z$r_buff1_thd0~0_144 0) (= v_~z$w_buff0_used~0_607 0) (= v_~x~0_74 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1069~0.base_46| 1) |v_#valid_95|) (= v_~__unbuffered_p3_EAX~0_105 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1069~0.base_46| 4)) (= v_~z$w_buff1~0_201 0) (= v_~__unbuffered_cnt~0_157 0) (= v_~z$r_buff0_thd2~0_25 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_69, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1069~0.base=|v_ULTIMATE.start_main_~#t1069~0.base_46|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_83, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_139, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_105, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_59, ~z$mem_tmp~0=v_~z$mem_tmp~0_49, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_372, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_42|, ~z$flush_delayed~0=v_~z$flush_delayed~0_78, ~weak$$choice0~0=v_~weak$$choice0~0_39, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_69, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_271, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157, ~x~0=v_~x~0_74, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_128, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_22|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1070~0.base=|v_ULTIMATE.start_main_~#t1070~0.base_45|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, ULTIMATE.start_main_~#t1072~0.offset=|v_ULTIMATE.start_main_~#t1072~0.offset_19|, ~y~0=v_~y~0_82, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_607, ~z$w_buff0~0=v_~z$w_buff0~0_326, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_242, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_66|, ULTIMATE.start_main_~#t1071~0.offset=|v_ULTIMATE.start_main_~#t1071~0.offset_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_128|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_104, ULTIMATE.start_main_~#t1069~0.offset=|v_ULTIMATE.start_main_~#t1069~0.offset_30|, ULTIMATE.start_main_~#t1071~0.base=|v_ULTIMATE.start_main_~#t1071~0.base_45|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_94|, ~b~0=v_~b~0_46, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~#t1070~0.offset=|v_ULTIMATE.start_main_~#t1070~0.offset_29|, ULTIMATE.start_main_~#t1072~0.base=|v_ULTIMATE.start_main_~#t1072~0.base_26|, ~z~0=v_~z~0_172, ~weak$$choice2~0=v_~weak$$choice2~0_157, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1069~0.base, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1070~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1072~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t1071~0.offset, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t1069~0.offset, ULTIMATE.start_main_~#t1071~0.base, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1070~0.offset, ULTIMATE.start_main_~#t1072~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 16:17:11,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L841-1-->L843: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1070~0.base_13| 4)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1070~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1070~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1070~0.base_13|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1070~0.base_13| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1070~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1070~0.base_13|) |v_ULTIMATE.start_main_~#t1070~0.offset_11| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1070~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1070~0.base=|v_ULTIMATE.start_main_~#t1070~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1070~0.offset=|v_ULTIMATE.start_main_~#t1070~0.offset_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1070~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1070~0.offset, #length] because there is no mapped edge [2019-12-07 16:17:11,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1071~0.base_13|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1071~0.base_13| 4)) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1071~0.base_13|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1071~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1071~0.base_13|) |v_ULTIMATE.start_main_~#t1071~0.offset_11| 2)) |v_#memory_int_19|) (not (= |v_ULTIMATE.start_main_~#t1071~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t1071~0.offset_11|) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1071~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t1071~0.offset=|v_ULTIMATE.start_main_~#t1071~0.offset_11|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1071~0.base=|v_ULTIMATE.start_main_~#t1071~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t1071~0.offset, #length, ULTIMATE.start_main_~#t1071~0.base] because there is no mapped edge [2019-12-07 16:17:11,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L845-1-->L847: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1072~0.base_11|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1072~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1072~0.base_11|) |v_ULTIMATE.start_main_~#t1072~0.offset_10| 3))) (not (= 0 |v_ULTIMATE.start_main_~#t1072~0.base_11|)) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1072~0.base_11| 1)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1072~0.base_11| 4)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1072~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1072~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1072~0.base=|v_ULTIMATE.start_main_~#t1072~0.base_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1072~0.offset=|v_ULTIMATE.start_main_~#t1072~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1072~0.base, #length, ULTIMATE.start_main_~#t1072~0.offset] because there is no mapped edge [2019-12-07 16:17:11,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_112 256))) (not (= (mod v_~z$w_buff1_used~0_69 256) 0)))) 1 0)) (= v_~z$w_buff0~0_26 v_~z$w_buff1~0_20) (= 1 v_~z$w_buff0~0_25) (= v_~z$w_buff0_used~0_113 v_~z$w_buff1_used~0_69) (= v_~z$w_buff0_used~0_112 1) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10)) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10) (= v_P3Thread1of1ForFork1_~arg.offset_8 |v_P3Thread1of1ForFork1_#in~arg.offset_10|) (= |v_P3Thread1of1ForFork1_#in~arg.base_10| v_P3Thread1of1ForFork1_~arg.base_8)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_26, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_25, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8|, ~z$w_buff1~0=v_~z$w_buff1~0_20, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_8, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_8} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 16:17:11,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_18| v_P0Thread1of1ForFork2_~arg.offset_16) (= v_P0Thread1of1ForFork2_~arg.base_16 |v_P0Thread1of1ForFork2_#in~arg.base_18|) (= v_~b~0_24 1) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= v_~x~0_35 1) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~b~0=v_~b~0_24, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_16, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|, ~x~0=v_~x~0_35, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_16} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 16:17:11,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_48 2) (= 0 |v_P1Thread1of1ForFork3_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_131 (+ v_~__unbuffered_cnt~0_132 1)) (= v_~y~0_47 1) (= |v_P1Thread1of1ForFork3_#in~arg.offset_14| v_P1Thread1of1ForFork3_~arg.offset_12) (= |v_P1Thread1of1ForFork3_#in~arg.base_14| v_P1Thread1of1ForFork3_~arg.base_12)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_3|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_12, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_12, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|, ~y~0=v_~y~0_47, ~x~0=v_~x~0_48} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-12-07 16:17:11,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L776-->L776-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In229920077 256) 0))) (or (and (= ~z$w_buff0~0_In229920077 |P2Thread1of1ForFork0_#t~ite9_Out229920077|) (= |P2Thread1of1ForFork0_#t~ite8_In229920077| |P2Thread1of1ForFork0_#t~ite8_Out229920077|) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite8_Out229920077| ~z$w_buff0~0_In229920077) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In229920077 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In229920077 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In229920077 256)) .cse1) (= (mod ~z$w_buff0_used~0_In229920077 256) 0))) (= |P2Thread1of1ForFork0_#t~ite8_Out229920077| |P2Thread1of1ForFork0_#t~ite9_Out229920077|)))) InVars {P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_In229920077|, ~z$w_buff0~0=~z$w_buff0~0_In229920077, ~z$w_buff0_used~0=~z$w_buff0_used~0_In229920077, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In229920077, ~z$w_buff1_used~0=~z$w_buff1_used~0_In229920077, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In229920077, ~weak$$choice2~0=~weak$$choice2~0_In229920077} OutVars{P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_Out229920077|, ~z$w_buff0~0=~z$w_buff0~0_In229920077, ~z$w_buff0_used~0=~z$w_buff0_used~0_In229920077, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In229920077, ~z$w_buff1_used~0=~z$w_buff1_used~0_In229920077, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In229920077, ~weak$$choice2~0=~weak$$choice2~0_In229920077, P2Thread1of1ForFork0_#t~ite9=|P2Thread1of1ForFork0_#t~ite9_Out229920077|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite8, P2Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 16:17:11,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L777-->L777-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1233372226 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite12_Out1233372226| ~z$w_buff1~0_In1233372226) (= |P2Thread1of1ForFork0_#t~ite11_In1233372226| |P2Thread1of1ForFork0_#t~ite11_Out1233372226|)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1233372226 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In1233372226 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In1233372226 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In1233372226 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite12_Out1233372226| |P2Thread1of1ForFork0_#t~ite11_Out1233372226|) .cse0 (= ~z$w_buff1~0_In1233372226 |P2Thread1of1ForFork0_#t~ite11_Out1233372226|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1233372226, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In1233372226|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1233372226, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1233372226, ~z$w_buff1~0=~z$w_buff1~0_In1233372226, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1233372226, ~weak$$choice2~0=~weak$$choice2~0_In1233372226} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out1233372226|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1233372226, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1233372226|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1233372226, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1233372226, ~z$w_buff1~0=~z$w_buff1~0_In1233372226, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1233372226, ~weak$$choice2~0=~weak$$choice2~0_In1233372226} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 16:17:11,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L778-->L778-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2124624543 256)))) (or (and (= ~z$w_buff0_used~0_In-2124624543 |P2Thread1of1ForFork0_#t~ite14_Out-2124624543|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-2124624543 256) 0))) (or (and .cse0 (= (mod ~z$w_buff1_used~0_In-2124624543 256) 0)) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-2124624543 256))) (= 0 (mod ~z$w_buff0_used~0_In-2124624543 256)))) (= |P2Thread1of1ForFork0_#t~ite14_Out-2124624543| |P2Thread1of1ForFork0_#t~ite15_Out-2124624543|) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite14_In-2124624543| |P2Thread1of1ForFork0_#t~ite14_Out-2124624543|) (not .cse1) (= ~z$w_buff0_used~0_In-2124624543 |P2Thread1of1ForFork0_#t~ite15_Out-2124624543|)))) InVars {P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_In-2124624543|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2124624543, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2124624543, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2124624543, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2124624543, ~weak$$choice2~0=~weak$$choice2~0_In-2124624543} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-2124624543|, P2Thread1of1ForFork0_#t~ite15=|P2Thread1of1ForFork0_#t~ite15_Out-2124624543|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2124624543, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2124624543, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2124624543, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2124624543, ~weak$$choice2~0=~weak$$choice2~0_In-2124624543} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, P2Thread1of1ForFork0_#t~ite15] because there is no mapped edge [2019-12-07 16:17:11,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L780-->L781: Formula: (and (not (= (mod v_~weak$$choice2~0_32 256) 0)) (= v_~z$r_buff0_thd3~0_73 v_~z$r_buff0_thd3~0_72)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_73, ~weak$$choice2~0=v_~weak$$choice2~0_32} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_72, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_9|, ~weak$$choice2~0=v_~weak$$choice2~0_32, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 16:17:11,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1523692515 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1523692515 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1523692515 |P3Thread1of1ForFork1_#t~ite28_Out1523692515|)) (and (not .cse0) (= |P3Thread1of1ForFork1_#t~ite28_Out1523692515| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1523692515, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1523692515} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1523692515, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out1523692515|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1523692515} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 16:17:11,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L783-->L791: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_16 v_~z$mem_tmp~0_4) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 16:17:11,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1960142224 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1960142224 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd4~0_In1960142224 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1960142224 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork1_#t~ite29_Out1960142224| ~z$w_buff1_used~0_In1960142224)) (and (= |P3Thread1of1ForFork1_#t~ite29_Out1960142224| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1960142224, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1960142224, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1960142224, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1960142224} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1960142224, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out1960142224|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1960142224, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1960142224, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1960142224} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 16:17:11,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L821-->L822: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-482255172 256))) (.cse2 (= ~z$r_buff0_thd4~0_Out-482255172 ~z$r_buff0_thd4~0_In-482255172)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-482255172 256)))) (or (and (= 0 ~z$r_buff0_thd4~0_Out-482255172) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse2 .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-482255172, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-482255172} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-482255172, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-482255172, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-482255172|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 16:17:11,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1921084419 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In1921084419 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1921084419 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1921084419 256)))) (or (and (= ~z$r_buff1_thd4~0_In1921084419 |P3Thread1of1ForFork1_#t~ite31_Out1921084419|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P3Thread1of1ForFork1_#t~ite31_Out1921084419|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1921084419, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1921084419, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1921084419, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1921084419} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1921084419, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1921084419, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1921084419, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1921084419, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out1921084419|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 16:17:11,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L822-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= v_~z$r_buff1_thd4~0_56 |v_P3Thread1of1ForFork1_#t~ite31_58|) (= |v_P3Thread1of1ForFork1_#res.offset_3| 0) (= |v_P3Thread1of1ForFork1_#res.base_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_58|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_56, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_3|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_57|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 16:17:11,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L847-1-->L853: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_60) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:17:11,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L853-2-->L853-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In241933967 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In241933967 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In241933967 |ULTIMATE.start_main_#t~ite36_Out241933967|)) (and (not .cse1) (= ~z$w_buff1~0_In241933967 |ULTIMATE.start_main_#t~ite36_Out241933967|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In241933967, ~z$w_buff1_used~0=~z$w_buff1_used~0_In241933967, ~z$w_buff1~0=~z$w_buff1~0_In241933967, ~z~0=~z~0_In241933967} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In241933967, ~z$w_buff1_used~0=~z$w_buff1_used~0_In241933967, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out241933967|, ~z$w_buff1~0=~z$w_buff1~0_In241933967, ~z~0=~z~0_In241933967} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 16:17:11,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L853-4-->L854: Formula: (= v_~z~0_38 |v_ULTIMATE.start_main_#t~ite36_16|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_16|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-07 16:17:11,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1735113814 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1735113814 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-1735113814| 0) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1735113814 |ULTIMATE.start_main_#t~ite38_Out-1735113814|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1735113814, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1735113814} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1735113814, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1735113814, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1735113814|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 16:17:11,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L855-->L855-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In1837783620 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1837783620 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1837783620 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1837783620 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out1837783620|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1837783620 |ULTIMATE.start_main_#t~ite39_Out1837783620|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1837783620, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1837783620, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1837783620, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1837783620} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1837783620, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1837783620|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1837783620, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1837783620, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1837783620} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 16:17:11,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1803193840 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1803193840 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1803193840| 0)) (and (= |ULTIMATE.start_main_#t~ite40_Out1803193840| ~z$r_buff0_thd0~0_In1803193840) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1803193840, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1803193840} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1803193840, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1803193840|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1803193840} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 16:17:11,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L857-->L857-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1324798285 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1324798285 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1324798285 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-1324798285 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite41_Out-1324798285|)) (and (= ~z$r_buff1_thd0~0_In-1324798285 |ULTIMATE.start_main_#t~ite41_Out-1324798285|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1324798285, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1324798285, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1324798285, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1324798285} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1324798285|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1324798285, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1324798285, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1324798285, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1324798285} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 16:17:11,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z$r_buff1_thd0~0_110 |v_ULTIMATE.start_main_#t~ite41_51|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~main$tmp_guard1~0_23 (ite (= (ite (not (and (= 1 v_~__unbuffered_p3_EAX~0_73) (= 0 v_~__unbuffered_p3_EBX~0_72) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~x~0_52 2) (= v_~y~0_52 2))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_51|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_50|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_110, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:17:11,947 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0a441572-bad0-4464-acb5-e5d36ec2e47d/bin/uautomizer/witness.graphml [2019-12-07 16:17:11,947 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:17:11,948 INFO L168 Benchmark]: Toolchain (without parser) took 21009.86 ms. Allocated memory was 1.0 GB in the beginning and 3.6 GB in the end (delta: 2.6 GB). Free memory was 936.0 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-12-07 16:17:11,948 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:17:11,949 INFO L168 Benchmark]: CACSL2BoogieTranslator took 403.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 936.0 MB in the beginning and 1.1 GB in the end (delta: -133.4 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:17:11,949 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.63 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 16:17:11,949 INFO L168 Benchmark]: Boogie Preprocessor took 29.97 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 16:17:11,949 INFO L168 Benchmark]: RCFGBuilder took 388.04 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: 56.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:17:11,950 INFO L168 Benchmark]: TraceAbstraction took 20084.20 ms. Allocated memory was 1.1 GB in the beginning and 3.6 GB in the end (delta: 2.5 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-12-07 16:17:11,950 INFO L168 Benchmark]: Witness Printer took 62.13 ms. Allocated memory is still 3.6 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:17:11,951 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 403.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 936.0 MB in the beginning and 1.1 GB in the end (delta: -133.4 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.63 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. * Boogie Preprocessor took 29.97 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. * RCFGBuilder took 388.04 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: 56.2 MB). Peak memory consumption was 56.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20084.20 ms. Allocated memory was 1.1 GB in the beginning and 3.6 GB in the end (delta: 2.5 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 62.13 ms. Allocated memory is still 3.6 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 169 ProgramPointsBefore, 79 ProgramPointsAfterwards, 191 TransitionsBefore, 83 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 23 ChoiceCompositions, 5572 VarBasedMoverChecksPositive, 186 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 165 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 46301 CheckedPairsTotal, 118 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L841] FCALL, FORK 0 pthread_create(&t1069, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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] [L843] FCALL, FORK 0 pthread_create(&t1070, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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] [L845] FCALL, FORK 0 pthread_create(&t1071, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L847] FCALL, FORK 0 pthread_create(&t1072, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 [L809] 4 a = 1 [L812] 4 __unbuffered_p3_EAX = a [L815] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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=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] [L818] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [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_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, 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_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, 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] 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] 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] 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_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, 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=2, 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)) [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_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, 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=2, 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_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, 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] [L818] 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) [L819] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L820] 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 [L853] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, 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] [L854] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L855] 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 [L856] 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, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.9s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2720 SDtfs, 3016 SDslu, 4819 SDs, 0 SdLazy, 1447 SolverSat, 172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54016occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 53003 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 540 NumberOfCodeBlocks, 540 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 473 ConstructedInterpolants, 0 QuantifiedInterpolants, 73062 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...