./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix040_rmo.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_0bae17a6-273c-40fb-a933-0d327e8a3540/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0bae17a6-273c-40fb-a933-0d327e8a3540/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0bae17a6-273c-40fb-a933-0d327e8a3540/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0bae17a6-273c-40fb-a933-0d327e8a3540/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix040_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0bae17a6-273c-40fb-a933-0d327e8a3540/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0bae17a6-273c-40fb-a933-0d327e8a3540/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 81cd4bc5617f253a3f62b3fe752fd9af08ab147d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:29:46,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:29:46,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:29:46,879 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:29:46,880 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:29:46,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:29:46,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:29:46,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:29:46,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:29:46,885 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:29:46,885 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:29:46,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:29:46,886 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:29:46,887 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:29:46,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:29:46,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:29:46,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:29:46,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:29:46,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:29:46,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:29:46,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:29:46,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:29:46,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:29:46,896 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:29:46,898 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:29:46,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:29:46,899 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:29:46,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:29:46,899 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:29:46,900 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:29:46,900 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:29:46,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:29:46,901 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:29:46,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:29:46,902 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:29:46,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:29:46,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:29:46,903 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:29:46,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:29:46,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:29:46,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:29:46,904 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0bae17a6-273c-40fb-a933-0d327e8a3540/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:29:46,913 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:29:46,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:29:46,914 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:29:46,915 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:29:46,915 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:29:46,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:29:46,915 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:29:46,915 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:29:46,915 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:29:46,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:29:46,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:29:46,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:29:46,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:29:46,916 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:29:46,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:29:46,916 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:29:46,916 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:29:46,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:29:46,917 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:29:46,917 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:29:46,917 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:29:46,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:29:46,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:29:46,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:29:46,918 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:29:46,918 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:29:46,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:29:46,918 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:29:46,918 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:29:46,918 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_0bae17a6-273c-40fb-a933-0d327e8a3540/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 -> 81cd4bc5617f253a3f62b3fe752fd9af08ab147d [2019-12-07 13:29:47,024 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:29:47,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:29:47,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:29:47,038 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:29:47,039 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:29:47,039 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0bae17a6-273c-40fb-a933-0d327e8a3540/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix040_rmo.opt.i [2019-12-07 13:29:47,079 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0bae17a6-273c-40fb-a933-0d327e8a3540/bin/uautomizer/data/edabbbdb8/45722179e2494eaab9174b04a7c364d5/FLAG012543995 [2019-12-07 13:29:47,446 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:29:47,447 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0bae17a6-273c-40fb-a933-0d327e8a3540/sv-benchmarks/c/pthread-wmm/mix040_rmo.opt.i [2019-12-07 13:29:47,456 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0bae17a6-273c-40fb-a933-0d327e8a3540/bin/uautomizer/data/edabbbdb8/45722179e2494eaab9174b04a7c364d5/FLAG012543995 [2019-12-07 13:29:47,468 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0bae17a6-273c-40fb-a933-0d327e8a3540/bin/uautomizer/data/edabbbdb8/45722179e2494eaab9174b04a7c364d5 [2019-12-07 13:29:47,470 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:29:47,471 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:29:47,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:29:47,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:29:47,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:29:47,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:29:47" (1/1) ... [2019-12-07 13:29:47,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42296d0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:29:47, skipping insertion in model container [2019-12-07 13:29:47,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:29:47" (1/1) ... [2019-12-07 13:29:47,484 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:29:47,513 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:29:47,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:29:47,813 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:29:47,862 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:29:47,908 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:29:47,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:29:47 WrapperNode [2019-12-07 13:29:47,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:29:47,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:29:47,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:29:47,909 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:29:47,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:29:47" (1/1) ... [2019-12-07 13:29:47,927 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:29:47" (1/1) ... [2019-12-07 13:29:47,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:29:47,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:29:47,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:29:47,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:29:47,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:29:47" (1/1) ... [2019-12-07 13:29:47,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:29:47" (1/1) ... [2019-12-07 13:29:47,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:29:47" (1/1) ... [2019-12-07 13:29:47,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:29:47" (1/1) ... [2019-12-07 13:29:47,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:29:47" (1/1) ... [2019-12-07 13:29:47,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:29:47" (1/1) ... [2019-12-07 13:29:47,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:29:47" (1/1) ... [2019-12-07 13:29:47,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:29:47,972 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:29:47,972 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:29:47,972 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:29:47,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:29:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0bae17a6-273c-40fb-a933-0d327e8a3540/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 13:29:48,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:29:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:29:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:29:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:29:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:29:48,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:29:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:29:48,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:29:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 13:29:48,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 13:29:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 13:29:48,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 13:29:48,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:29:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:29:48,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:29:48,014 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 13:29:48,339 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:29:48,339 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:29:48,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:29:48 BoogieIcfgContainer [2019-12-07 13:29:48,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:29:48,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:29:48,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:29:48,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:29:48,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:29:47" (1/3) ... [2019-12-07 13:29:48,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d30c600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:29:48, skipping insertion in model container [2019-12-07 13:29:48,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:29:47" (2/3) ... [2019-12-07 13:29:48,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d30c600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:29:48, skipping insertion in model container [2019-12-07 13:29:48,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:29:48" (3/3) ... [2019-12-07 13:29:48,345 INFO L109 eAbstractionObserver]: Analyzing ICFG mix040_rmo.opt.i [2019-12-07 13:29:48,351 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:29:48,351 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:29:48,356 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:29:48,356 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:29:48,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,382 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,382 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,383 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,383 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,385 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,385 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,402 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,402 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,402 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,403 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,403 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,403 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,403 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,403 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,404 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,405 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:29:48,423 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 13:29:48,440 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:29:48,440 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:29:48,440 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:29:48,440 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:29:48,441 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:29:48,441 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:29:48,441 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:29:48,441 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:29:48,456 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 191 transitions [2019-12-07 13:29:48,458 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-12-07 13:29:48,525 INFO L134 PetriNetUnfolder]: 35/187 cut-off events. [2019-12-07 13:29:48,525 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:29:48,536 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 13:29:48,546 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-12-07 13:29:48,581 INFO L134 PetriNetUnfolder]: 35/187 cut-off events. [2019-12-07 13:29:48,581 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:29:48,585 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 13:29:48,595 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-07 13:29:48,596 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:29:51,356 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 13:29:51,573 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 13:29:51,678 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-07 13:29:51,691 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46301 [2019-12-07 13:29:51,691 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2019-12-07 13:29:51,694 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 83 transitions [2019-12-07 13:29:53,085 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27254 states. [2019-12-07 13:29:53,086 INFO L276 IsEmpty]: Start isEmpty. Operand 27254 states. [2019-12-07 13:29:53,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 13:29:53,091 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:29:53,091 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:29:53,091 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 13:29:53,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:29:53,095 INFO L82 PathProgramCache]: Analyzing trace with hash -2114616633, now seen corresponding path program 1 times [2019-12-07 13:29:53,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:29:53,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981529555] [2019-12-07 13:29:53,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:29:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:29:53,260 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 13:29:53,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981529555] [2019-12-07 13:29:53,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:29:53,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:29:53,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869536662] [2019-12-07 13:29:53,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:29:53,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:29:53,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:29:53,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:29:53,275 INFO L87 Difference]: Start difference. First operand 27254 states. Second operand 3 states. [2019-12-07 13:29:53,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:29:53,598 INFO L93 Difference]: Finished difference Result 26518 states and 112736 transitions. [2019-12-07 13:29:53,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:29:53,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 13:29:53,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:29:53,783 INFO L225 Difference]: With dead ends: 26518 [2019-12-07 13:29:53,783 INFO L226 Difference]: Without dead ends: 24958 [2019-12-07 13:29:53,784 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 13:29:54,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24958 states. [2019-12-07 13:29:54,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24958 to 24958. [2019-12-07 13:29:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24958 states. [2019-12-07 13:29:54,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24958 states to 24958 states and 105960 transitions. [2019-12-07 13:29:54,635 INFO L78 Accepts]: Start accepts. Automaton has 24958 states and 105960 transitions. Word has length 9 [2019-12-07 13:29:54,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:29:54,636 INFO L462 AbstractCegarLoop]: Abstraction has 24958 states and 105960 transitions. [2019-12-07 13:29:54,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:29:54,636 INFO L276 IsEmpty]: Start isEmpty. Operand 24958 states and 105960 transitions. [2019-12-07 13:29:54,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 13:29:54,644 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:29:54,644 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:29:54,644 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 13:29:54,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:29:54,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1982620494, now seen corresponding path program 1 times [2019-12-07 13:29:54,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:29:54,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937692337] [2019-12-07 13:29:54,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:29:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:29:54,702 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 13:29:54,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937692337] [2019-12-07 13:29:54,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:29:54,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:29:54,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936960601] [2019-12-07 13:29:54,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:29:54,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:29:54,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:29:54,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:29:54,705 INFO L87 Difference]: Start difference. First operand 24958 states and 105960 transitions. Second operand 3 states. [2019-12-07 13:29:54,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:29:54,824 INFO L93 Difference]: Finished difference Result 19953 states and 78654 transitions. [2019-12-07 13:29:54,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:29:54,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 13:29:54,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:29:54,917 INFO L225 Difference]: With dead ends: 19953 [2019-12-07 13:29:54,918 INFO L226 Difference]: Without dead ends: 19953 [2019-12-07 13:29:54,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:29:55,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19953 states. [2019-12-07 13:29:55,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19953 to 19953. [2019-12-07 13:29:55,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19953 states. [2019-12-07 13:29:55,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19953 states to 19953 states and 78654 transitions. [2019-12-07 13:29:55,449 INFO L78 Accepts]: Start accepts. Automaton has 19953 states and 78654 transitions. Word has length 15 [2019-12-07 13:29:55,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:29:55,449 INFO L462 AbstractCegarLoop]: Abstraction has 19953 states and 78654 transitions. [2019-12-07 13:29:55,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:29:55,450 INFO L276 IsEmpty]: Start isEmpty. Operand 19953 states and 78654 transitions. [2019-12-07 13:29:55,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:29:55,451 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:29:55,451 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:29:55,452 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 13:29:55,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:29:55,452 INFO L82 PathProgramCache]: Analyzing trace with hash 832904726, now seen corresponding path program 1 times [2019-12-07 13:29:55,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:29:55,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639749920] [2019-12-07 13:29:55,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:29:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:29:55,493 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 13:29:55,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639749920] [2019-12-07 13:29:55,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:29:55,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:29:55,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290018440] [2019-12-07 13:29:55,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:29:55,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:29:55,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:29:55,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:29:55,494 INFO L87 Difference]: Start difference. First operand 19953 states and 78654 transitions. Second operand 4 states. [2019-12-07 13:29:55,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:29:55,539 INFO L93 Difference]: Finished difference Result 9211 states and 30743 transitions. [2019-12-07 13:29:55,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:29:55,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 13:29:55,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:29:55,552 INFO L225 Difference]: With dead ends: 9211 [2019-12-07 13:29:55,552 INFO L226 Difference]: Without dead ends: 9211 [2019-12-07 13:29:55,552 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 13:29:55,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9211 states. [2019-12-07 13:29:55,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9211 to 9211. [2019-12-07 13:29:55,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9211 states. [2019-12-07 13:29:55,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9211 states to 9211 states and 30743 transitions. [2019-12-07 13:29:55,706 INFO L78 Accepts]: Start accepts. Automaton has 9211 states and 30743 transitions. Word has length 16 [2019-12-07 13:29:55,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:29:55,707 INFO L462 AbstractCegarLoop]: Abstraction has 9211 states and 30743 transitions. [2019-12-07 13:29:55,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:29:55,707 INFO L276 IsEmpty]: Start isEmpty. Operand 9211 states and 30743 transitions. [2019-12-07 13:29:55,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 13:29:55,709 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:29:55,709 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:29:55,709 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 13:29:55,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:29:55,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1159456736, now seen corresponding path program 1 times [2019-12-07 13:29:55,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:29:55,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842652332] [2019-12-07 13:29:55,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:29:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:29:55,760 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 13:29:55,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842652332] [2019-12-07 13:29:55,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:29:55,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:29:55,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749465363] [2019-12-07 13:29:55,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:29:55,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:29:55,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:29:55,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:29:55,762 INFO L87 Difference]: Start difference. First operand 9211 states and 30743 transitions. Second operand 5 states. [2019-12-07 13:29:55,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:29:55,796 INFO L93 Difference]: Finished difference Result 2716 states and 8200 transitions. [2019-12-07 13:29:55,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:29:55,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-07 13:29:55,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:29:55,799 INFO L225 Difference]: With dead ends: 2716 [2019-12-07 13:29:55,799 INFO L226 Difference]: Without dead ends: 2716 [2019-12-07 13:29:55,799 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 13:29:55,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2019-12-07 13:29:55,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2716. [2019-12-07 13:29:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2019-12-07 13:29:55,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 8200 transitions. [2019-12-07 13:29:55,834 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 8200 transitions. Word has length 17 [2019-12-07 13:29:55,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:29:55,834 INFO L462 AbstractCegarLoop]: Abstraction has 2716 states and 8200 transitions. [2019-12-07 13:29:55,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:29:55,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 8200 transitions. [2019-12-07 13:29:55,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:29:55,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:29:55,836 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 13:29:55,836 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 13:29:55,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:29:55,836 INFO L82 PathProgramCache]: Analyzing trace with hash 965433528, now seen corresponding path program 1 times [2019-12-07 13:29:55,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:29:55,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083265979] [2019-12-07 13:29:55,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:29:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:29:55,894 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 13:29:55,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083265979] [2019-12-07 13:29:55,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:29:55,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:29:55,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536851967] [2019-12-07 13:29:55,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:29:55,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:29:55,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:29:55,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:29:55,895 INFO L87 Difference]: Start difference. First operand 2716 states and 8200 transitions. Second operand 4 states. [2019-12-07 13:29:55,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:29:56,000 INFO L93 Difference]: Finished difference Result 3607 states and 10783 transitions. [2019-12-07 13:29:56,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:29:56,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 13:29:56,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:29:56,004 INFO L225 Difference]: With dead ends: 3607 [2019-12-07 13:29:56,004 INFO L226 Difference]: Without dead ends: 3607 [2019-12-07 13:29:56,004 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 13:29:56,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2019-12-07 13:29:56,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 3415. [2019-12-07 13:29:56,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3415 states. [2019-12-07 13:29:56,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 10347 transitions. [2019-12-07 13:29:56,064 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 10347 transitions. Word has length 18 [2019-12-07 13:29:56,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:29:56,065 INFO L462 AbstractCegarLoop]: Abstraction has 3415 states and 10347 transitions. [2019-12-07 13:29:56,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:29:56,065 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 10347 transitions. [2019-12-07 13:29:56,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 13:29:56,070 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:29:56,070 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 13:29:56,070 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 13:29:56,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:29:56,070 INFO L82 PathProgramCache]: Analyzing trace with hash -792380239, now seen corresponding path program 1 times [2019-12-07 13:29:56,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:29:56,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907936731] [2019-12-07 13:29:56,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:29:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:29:56,127 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 13:29:56,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907936731] [2019-12-07 13:29:56,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:29:56,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:29:56,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111094937] [2019-12-07 13:29:56,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:29:56,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:29:56,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:29:56,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:29:56,129 INFO L87 Difference]: Start difference. First operand 3415 states and 10347 transitions. Second operand 5 states. [2019-12-07 13:29:56,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:29:56,423 INFO L93 Difference]: Finished difference Result 4994 states and 14891 transitions. [2019-12-07 13:29:56,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:29:56,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-07 13:29:56,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:29:56,429 INFO L225 Difference]: With dead ends: 4994 [2019-12-07 13:29:56,429 INFO L226 Difference]: Without dead ends: 4994 [2019-12-07 13:29:56,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:29:56,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4994 states. [2019-12-07 13:29:56,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4994 to 4302. [2019-12-07 13:29:56,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4302 states. [2019-12-07 13:29:56,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4302 states to 4302 states and 12982 transitions. [2019-12-07 13:29:56,490 INFO L78 Accepts]: Start accepts. Automaton has 4302 states and 12982 transitions. Word has length 32 [2019-12-07 13:29:56,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:29:56,490 INFO L462 AbstractCegarLoop]: Abstraction has 4302 states and 12982 transitions. [2019-12-07 13:29:56,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:29:56,490 INFO L276 IsEmpty]: Start isEmpty. Operand 4302 states and 12982 transitions. [2019-12-07 13:29:56,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 13:29:56,495 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:29:56,495 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 13:29:56,496 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 13:29:56,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:29:56,496 INFO L82 PathProgramCache]: Analyzing trace with hash -617388800, now seen corresponding path program 1 times [2019-12-07 13:29:56,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:29:56,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542880253] [2019-12-07 13:29:56,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:29:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:29:56,522 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 13:29:56,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542880253] [2019-12-07 13:29:56,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:29:56,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:29:56,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69485658] [2019-12-07 13:29:56,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:29:56,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:29:56,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:29:56,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:29:56,524 INFO L87 Difference]: Start difference. First operand 4302 states and 12982 transitions. Second operand 3 states. [2019-12-07 13:29:56,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:29:56,567 INFO L93 Difference]: Finished difference Result 6260 states and 18717 transitions. [2019-12-07 13:29:56,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:29:56,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 13:29:56,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:29:56,574 INFO L225 Difference]: With dead ends: 6260 [2019-12-07 13:29:56,574 INFO L226 Difference]: Without dead ends: 6260 [2019-12-07 13:29:56,574 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 13:29:56,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6260 states. [2019-12-07 13:29:56,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6260 to 5218. [2019-12-07 13:29:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5218 states. [2019-12-07 13:29:56,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 15792 transitions. [2019-12-07 13:29:56,637 INFO L78 Accepts]: Start accepts. Automaton has 5218 states and 15792 transitions. Word has length 32 [2019-12-07 13:29:56,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:29:56,638 INFO L462 AbstractCegarLoop]: Abstraction has 5218 states and 15792 transitions. [2019-12-07 13:29:56,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:29:56,638 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 15792 transitions. [2019-12-07 13:29:56,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 13:29:56,644 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:29:56,644 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 13:29:56,644 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 13:29:56,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:29:56,644 INFO L82 PathProgramCache]: Analyzing trace with hash 937445460, now seen corresponding path program 1 times [2019-12-07 13:29:56,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:29:56,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657174928] [2019-12-07 13:29:56,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:29:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:29:56,670 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 13:29:56,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657174928] [2019-12-07 13:29:56,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:29:56,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:29:56,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100544600] [2019-12-07 13:29:56,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:29:56,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:29:56,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:29:56,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:29:56,671 INFO L87 Difference]: Start difference. First operand 5218 states and 15792 transitions. Second operand 3 states. [2019-12-07 13:29:56,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:29:56,703 INFO L93 Difference]: Finished difference Result 6260 states and 18336 transitions. [2019-12-07 13:29:56,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:29:56,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 13:29:56,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:29:56,711 INFO L225 Difference]: With dead ends: 6260 [2019-12-07 13:29:56,711 INFO L226 Difference]: Without dead ends: 6260 [2019-12-07 13:29:56,711 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 13:29:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6260 states. [2019-12-07 13:29:56,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6260 to 5194. [2019-12-07 13:29:56,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5194 states. [2019-12-07 13:29:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5194 states to 5194 states and 15365 transitions. [2019-12-07 13:29:56,776 INFO L78 Accepts]: Start accepts. Automaton has 5194 states and 15365 transitions. Word has length 32 [2019-12-07 13:29:56,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:29:56,776 INFO L462 AbstractCegarLoop]: Abstraction has 5194 states and 15365 transitions. [2019-12-07 13:29:56,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:29:56,776 INFO L276 IsEmpty]: Start isEmpty. Operand 5194 states and 15365 transitions. [2019-12-07 13:29:56,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 13:29:56,782 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:29:56,782 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 13:29:56,782 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 13:29:56,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:29:56,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1469218903, now seen corresponding path program 1 times [2019-12-07 13:29:56,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:29:56,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717659866] [2019-12-07 13:29:56,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:29:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:29:56,827 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 13:29:56,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717659866] [2019-12-07 13:29:56,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:29:56,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:29:56,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751802323] [2019-12-07 13:29:56,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:29:56,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:29:56,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:29:56,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:29:56,829 INFO L87 Difference]: Start difference. First operand 5194 states and 15365 transitions. Second operand 6 states. [2019-12-07 13:29:56,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:29:56,869 INFO L93 Difference]: Finished difference Result 4110 states and 12674 transitions. [2019-12-07 13:29:56,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:29:56,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-07 13:29:56,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:29:56,874 INFO L225 Difference]: With dead ends: 4110 [2019-12-07 13:29:56,874 INFO L226 Difference]: Without dead ends: 4110 [2019-12-07 13:29:56,874 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 13:29:56,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4110 states. [2019-12-07 13:29:56,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4110 to 3726. [2019-12-07 13:29:56,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3726 states. [2019-12-07 13:29:56,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3726 states to 3726 states and 11542 transitions. [2019-12-07 13:29:56,919 INFO L78 Accepts]: Start accepts. Automaton has 3726 states and 11542 transitions. Word has length 32 [2019-12-07 13:29:56,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:29:56,919 INFO L462 AbstractCegarLoop]: Abstraction has 3726 states and 11542 transitions. [2019-12-07 13:29:56,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:29:56,919 INFO L276 IsEmpty]: Start isEmpty. Operand 3726 states and 11542 transitions. [2019-12-07 13:29:56,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 13:29:56,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:29:56,924 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] [2019-12-07 13:29:56,924 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 13:29:56,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:29:56,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1467210822, now seen corresponding path program 1 times [2019-12-07 13:29:56,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:29:56,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085702831] [2019-12-07 13:29:56,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:29:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:29:57,017 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 13:29:57,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085702831] [2019-12-07 13:29:57,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:29:57,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:29:57,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193407304] [2019-12-07 13:29:57,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:29:57,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:29:57,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:29:57,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:29:57,019 INFO L87 Difference]: Start difference. First operand 3726 states and 11542 transitions. Second operand 7 states. [2019-12-07 13:29:57,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:29:57,539 INFO L93 Difference]: Finished difference Result 6094 states and 18556 transitions. [2019-12-07 13:29:57,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 13:29:57,539 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-07 13:29:57,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:29:57,546 INFO L225 Difference]: With dead ends: 6094 [2019-12-07 13:29:57,546 INFO L226 Difference]: Without dead ends: 6094 [2019-12-07 13:29:57,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2019-12-07 13:29:57,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6094 states. [2019-12-07 13:29:57,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6094 to 3870. [2019-12-07 13:29:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3870 states. [2019-12-07 13:29:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3870 states to 3870 states and 11990 transitions. [2019-12-07 13:29:57,600 INFO L78 Accepts]: Start accepts. Automaton has 3870 states and 11990 transitions. Word has length 47 [2019-12-07 13:29:57,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:29:57,601 INFO L462 AbstractCegarLoop]: Abstraction has 3870 states and 11990 transitions. [2019-12-07 13:29:57,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:29:57,601 INFO L276 IsEmpty]: Start isEmpty. Operand 3870 states and 11990 transitions. [2019-12-07 13:29:57,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 13:29:57,606 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:29:57,606 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] [2019-12-07 13:29:57,606 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 13:29:57,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:29:57,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1156074910, now seen corresponding path program 2 times [2019-12-07 13:29:57,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:29:57,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238017332] [2019-12-07 13:29:57,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:29:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:29:57,656 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 13:29:57,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238017332] [2019-12-07 13:29:57,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:29:57,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:29:57,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638813574] [2019-12-07 13:29:57,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:29:57,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:29:57,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:29:57,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:29:57,658 INFO L87 Difference]: Start difference. First operand 3870 states and 11990 transitions. Second operand 3 states. [2019-12-07 13:29:57,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:29:57,673 INFO L93 Difference]: Finished difference Result 3868 states and 11985 transitions. [2019-12-07 13:29:57,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:29:57,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-07 13:29:57,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:29:57,677 INFO L225 Difference]: With dead ends: 3868 [2019-12-07 13:29:57,678 INFO L226 Difference]: Without dead ends: 3868 [2019-12-07 13:29:57,678 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 13:29:57,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3868 states. [2019-12-07 13:29:57,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3868 to 3254. [2019-12-07 13:29:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3254 states. [2019-12-07 13:29:57,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3254 states to 3254 states and 10180 transitions. [2019-12-07 13:29:57,759 INFO L78 Accepts]: Start accepts. Automaton has 3254 states and 10180 transitions. Word has length 47 [2019-12-07 13:29:57,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:29:57,759 INFO L462 AbstractCegarLoop]: Abstraction has 3254 states and 10180 transitions. [2019-12-07 13:29:57,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:29:57,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3254 states and 10180 transitions. [2019-12-07 13:29:57,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:29:57,763 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:29:57,763 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 13:29:57,763 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 13:29:57,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:29:57,764 INFO L82 PathProgramCache]: Analyzing trace with hash 203457861, now seen corresponding path program 1 times [2019-12-07 13:29:57,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:29:57,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761206655] [2019-12-07 13:29:57,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:29:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:29:57,836 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 13:29:57,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761206655] [2019-12-07 13:29:57,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:29:57,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:29:57,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537241525] [2019-12-07 13:29:57,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:29:57,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:29:57,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:29:57,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:29:57,838 INFO L87 Difference]: Start difference. First operand 3254 states and 10180 transitions. Second operand 7 states. [2019-12-07 13:29:58,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:29:58,173 INFO L93 Difference]: Finished difference Result 12544 states and 37086 transitions. [2019-12-07 13:29:58,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 13:29:58,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-07 13:29:58,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:29:58,184 INFO L225 Difference]: With dead ends: 12544 [2019-12-07 13:29:58,184 INFO L226 Difference]: Without dead ends: 7825 [2019-12-07 13:29:58,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 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 13:29:58,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7825 states. [2019-12-07 13:29:58,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7825 to 3314. [2019-12-07 13:29:58,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3314 states. [2019-12-07 13:29:58,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3314 states to 3314 states and 10206 transitions. [2019-12-07 13:29:58,245 INFO L78 Accepts]: Start accepts. Automaton has 3314 states and 10206 transitions. Word has length 48 [2019-12-07 13:29:58,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:29:58,246 INFO L462 AbstractCegarLoop]: Abstraction has 3314 states and 10206 transitions. [2019-12-07 13:29:58,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:29:58,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3314 states and 10206 transitions. [2019-12-07 13:29:58,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:29:58,250 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:29:58,250 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 13:29:58,250 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 13:29:58,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:29:58,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1089408023, now seen corresponding path program 2 times [2019-12-07 13:29:58,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:29:58,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998457283] [2019-12-07 13:29:58,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:29:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:29:58,329 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 13:29:58,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998457283] [2019-12-07 13:29:58,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:29:58,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:29:58,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666696850] [2019-12-07 13:29:58,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:29:58,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:29:58,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:29:58,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:29:58,331 INFO L87 Difference]: Start difference. First operand 3314 states and 10206 transitions. Second operand 4 states. [2019-12-07 13:29:58,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:29:58,365 INFO L93 Difference]: Finished difference Result 5800 states and 16292 transitions. [2019-12-07 13:29:58,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:29:58,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 13:29:58,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:29:58,370 INFO L225 Difference]: With dead ends: 5800 [2019-12-07 13:29:58,370 INFO L226 Difference]: Without dead ends: 3308 [2019-12-07 13:29:58,371 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 13:29:58,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3308 states. [2019-12-07 13:29:58,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3308 to 2506. [2019-12-07 13:29:58,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2019-12-07 13:29:58,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 6893 transitions. [2019-12-07 13:29:58,402 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 6893 transitions. Word has length 48 [2019-12-07 13:29:58,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:29:58,403 INFO L462 AbstractCegarLoop]: Abstraction has 2506 states and 6893 transitions. [2019-12-07 13:29:58,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:29:58,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 6893 transitions. [2019-12-07 13:29:58,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:29:58,405 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:29:58,405 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 13:29:58,406 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 13:29:58,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:29:58,406 INFO L82 PathProgramCache]: Analyzing trace with hash -633742729, now seen corresponding path program 3 times [2019-12-07 13:29:58,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:29:58,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006785859] [2019-12-07 13:29:58,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:29:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:29:58,486 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 13:29:58,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006785859] [2019-12-07 13:29:58,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:29:58,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:29:58,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408223575] [2019-12-07 13:29:58,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:29:58,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:29:58,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:29:58,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:29:58,487 INFO L87 Difference]: Start difference. First operand 2506 states and 6893 transitions. Second operand 5 states. [2019-12-07 13:29:58,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:29:58,529 INFO L93 Difference]: Finished difference Result 5358 states and 14303 transitions. [2019-12-07 13:29:58,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:29:58,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-07 13:29:58,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:29:58,532 INFO L225 Difference]: With dead ends: 5358 [2019-12-07 13:29:58,532 INFO L226 Difference]: Without dead ends: 3364 [2019-12-07 13:29:58,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:29:58,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3364 states. [2019-12-07 13:29:58,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3364 to 2190. [2019-12-07 13:29:58,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2190 states. [2019-12-07 13:29:58,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2190 states to 2190 states and 5941 transitions. [2019-12-07 13:29:58,560 INFO L78 Accepts]: Start accepts. Automaton has 2190 states and 5941 transitions. Word has length 48 [2019-12-07 13:29:58,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:29:58,560 INFO L462 AbstractCegarLoop]: Abstraction has 2190 states and 5941 transitions. [2019-12-07 13:29:58,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:29:58,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 5941 transitions. [2019-12-07 13:29:58,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:29:58,563 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:29:58,563 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 13:29:58,563 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 13:29:58,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:29:58,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1502542547, now seen corresponding path program 4 times [2019-12-07 13:29:58,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:29:58,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001939247] [2019-12-07 13:29:58,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:29:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:29:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:29:58,632 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:29:58,633 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:29:58,635 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) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1077~0.base_46|) (= 0 v_~z$r_buff1_thd2~0_69) (= v_~z$w_buff0~0_326 0) (= |v_#valid_95| (store .cse0 |v_ULTIMATE.start_main_~#t1077~0.base_46| 1)) (= 0 v_~z$r_buff1_thd4~0_128) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1077~0.base_46| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1077~0.base_46|) |v_ULTIMATE.start_main_~#t1077~0.offset_30| 0)) |v_#memory_int_25|) (= |v_ULTIMATE.start_main_~#t1077~0.offset_30| 0) (= 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) (= 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_~z$read_delayed_var~0.base_6 0) (= v_~z~0_172 0) (= 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) (= (select .cse0 |v_ULTIMATE.start_main_~#t1077~0.base_46|) 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) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1077~0.base_46| 4)) (= v_~__unbuffered_p3_EAX~0_105 0) (= 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_~#t1078~0.base=|v_ULTIMATE.start_main_~#t1078~0.base_45|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_83, ULTIMATE.start_main_~#t1079~0.offset=|v_ULTIMATE.start_main_~#t1079~0.offset_29|, ~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, ULTIMATE.start_main_~#t1080~0.base=|v_ULTIMATE.start_main_~#t1080~0.base_26|, ~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, ULTIMATE.start_main_~#t1077~0.offset=|v_ULTIMATE.start_main_~#t1077~0.offset_30|, ~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_~#t1079~0.base=|v_ULTIMATE.start_main_~#t1079~0.base_45|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, ~y~0=v_~y~0_82, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25, ULTIMATE.start_main_~#t1078~0.offset=|v_ULTIMATE.start_main_~#t1078~0.offset_29|, ~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_#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, #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_~#t1080~0.offset=|v_ULTIMATE.start_main_~#t1080~0.offset_19|, ULTIMATE.start_main_~#t1077~0.base=|v_ULTIMATE.start_main_~#t1077~0.base_46|, ~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_~#t1078~0.base, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1079~0.offset, ~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, ULTIMATE.start_main_~#t1080~0.base, ~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, ULTIMATE.start_main_~#t1077~0.offset, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1079~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1078~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1080~0.offset, ULTIMATE.start_main_~#t1077~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:29:58,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L841-1-->L843: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1078~0.base_13| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1078~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1078~0.offset_11| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1078~0.base_13| 4) |v_#length_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1078~0.base_13|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1078~0.base_13|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1078~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1078~0.base_13|) |v_ULTIMATE.start_main_~#t1078~0.offset_11| 1)) |v_#memory_int_15|)) 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_~#t1078~0.offset=|v_ULTIMATE.start_main_~#t1078~0.offset_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1078~0.base=|v_ULTIMATE.start_main_~#t1078~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1078~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1078~0.base] because there is no mapped edge [2019-12-07 13:29:58,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1079~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1079~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1079~0.offset_11| 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1079~0.base_13| 4) |v_#length_21|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1079~0.base_13|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1079~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1079~0.base_13|) |v_ULTIMATE.start_main_~#t1079~0.offset_11| 2)) |v_#memory_int_19|) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1079~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1079~0.base=|v_ULTIMATE.start_main_~#t1079~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t1079~0.offset=|v_ULTIMATE.start_main_~#t1079~0.offset_11|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1079~0.base, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1079~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:29:58,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L845-1-->L847: Formula: (and (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1080~0.base_11| 4) |v_#length_19|) (= 0 |v_ULTIMATE.start_main_~#t1080~0.offset_10|) (= (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1080~0.base_11| 1) |v_#valid_42|) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1080~0.base_11|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1080~0.base_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1080~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1080~0.base_11|) |v_ULTIMATE.start_main_~#t1080~0.offset_10| 3)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t1080~0.base_11|))) 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_~#t1080~0.offset=|v_ULTIMATE.start_main_~#t1080~0.offset_10|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1080~0.base=|v_ULTIMATE.start_main_~#t1080~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1080~0.offset, #length, ULTIMATE.start_main_~#t1080~0.base] because there is no mapped edge [2019-12-07 13:29:58,637 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 13:29:58,637 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 13:29:58,637 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 13:29:58,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L776-->L776-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In921319635 256) 0))) (or (and (= ~z$w_buff0~0_In921319635 |P2Thread1of1ForFork0_#t~ite9_Out921319635|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite8_In921319635| |P2Thread1of1ForFork0_#t~ite8_Out921319635|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In921319635 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In921319635 256)) .cse1) (= (mod ~z$w_buff0_used~0_In921319635 256) 0) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In921319635 256) 0)))) .cse0 (= |P2Thread1of1ForFork0_#t~ite9_Out921319635| |P2Thread1of1ForFork0_#t~ite8_Out921319635|) (= ~z$w_buff0~0_In921319635 |P2Thread1of1ForFork0_#t~ite8_Out921319635|)))) InVars {P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_In921319635|, ~z$w_buff0~0=~z$w_buff0~0_In921319635, ~z$w_buff0_used~0=~z$w_buff0_used~0_In921319635, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In921319635, ~z$w_buff1_used~0=~z$w_buff1_used~0_In921319635, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In921319635, ~weak$$choice2~0=~weak$$choice2~0_In921319635} OutVars{P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_Out921319635|, ~z$w_buff0~0=~z$w_buff0~0_In921319635, ~z$w_buff0_used~0=~z$w_buff0_used~0_In921319635, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In921319635, ~z$w_buff1_used~0=~z$w_buff1_used~0_In921319635, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In921319635, ~weak$$choice2~0=~weak$$choice2~0_In921319635, P2Thread1of1ForFork0_#t~ite9=|P2Thread1of1ForFork0_#t~ite9_Out921319635|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite8, P2Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 13:29:58,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L777-->L777-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In455056838 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In455056838 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In455056838 256)) .cse1) (= (mod ~z$w_buff0_used~0_In455056838 256) 0) (and (= (mod ~z$w_buff1_used~0_In455056838 256) 0) .cse1))) (= |P2Thread1of1ForFork0_#t~ite12_Out455056838| |P2Thread1of1ForFork0_#t~ite11_Out455056838|) (= |P2Thread1of1ForFork0_#t~ite11_Out455056838| ~z$w_buff1~0_In455056838)) (and (= |P2Thread1of1ForFork0_#t~ite11_In455056838| |P2Thread1of1ForFork0_#t~ite11_Out455056838|) (= |P2Thread1of1ForFork0_#t~ite12_Out455056838| ~z$w_buff1~0_In455056838) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In455056838, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In455056838|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In455056838, ~z$w_buff1_used~0=~z$w_buff1_used~0_In455056838, ~z$w_buff1~0=~z$w_buff1~0_In455056838, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In455056838, ~weak$$choice2~0=~weak$$choice2~0_In455056838} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out455056838|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In455056838, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out455056838|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In455056838, ~z$w_buff1_used~0=~z$w_buff1_used~0_In455056838, ~z$w_buff1~0=~z$w_buff1~0_In455056838, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In455056838, ~weak$$choice2~0=~weak$$choice2~0_In455056838} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 13:29:58,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L778-->L778-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In155923062 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite14_In155923062| |P2Thread1of1ForFork0_#t~ite14_Out155923062|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite15_Out155923062| ~z$w_buff0_used~0_In155923062)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In155923062 256)))) (or (= (mod ~z$w_buff0_used~0_In155923062 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In155923062 256)) .cse1) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In155923062 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite14_Out155923062| ~z$w_buff0_used~0_In155923062) (= |P2Thread1of1ForFork0_#t~ite15_Out155923062| |P2Thread1of1ForFork0_#t~ite14_Out155923062|) .cse0))) InVars {P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_In155923062|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In155923062, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In155923062, ~z$w_buff1_used~0=~z$w_buff1_used~0_In155923062, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In155923062, ~weak$$choice2~0=~weak$$choice2~0_In155923062} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out155923062|, P2Thread1of1ForFork0_#t~ite15=|P2Thread1of1ForFork0_#t~ite15_Out155923062|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In155923062, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In155923062, ~z$w_buff1_used~0=~z$w_buff1_used~0_In155923062, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In155923062, ~weak$$choice2~0=~weak$$choice2~0_In155923062} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, P2Thread1of1ForFork0_#t~ite15] because there is no mapped edge [2019-12-07 13:29:58,641 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 13:29:58,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1989798189 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1989798189 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork1_#t~ite28_Out-1989798189|)) (and (= ~z$w_buff0_used~0_In-1989798189 |P3Thread1of1ForFork1_#t~ite28_Out-1989798189|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1989798189, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1989798189} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1989798189, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out-1989798189|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1989798189} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 13:29:58,642 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 13:29:58,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L820-->L820-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd4~0_In1885113751 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1885113751 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1885113751 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1885113751 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork1_#t~ite29_Out1885113751| ~z$w_buff1_used~0_In1885113751)) (and (= |P3Thread1of1ForFork1_#t~ite29_Out1885113751| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1885113751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1885113751, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1885113751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1885113751} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1885113751, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out1885113751|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1885113751, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1885113751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1885113751} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 13:29:58,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L821-->L822: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_Out418061222 ~z$r_buff0_thd4~0_In418061222)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In418061222 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In418061222 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~z$r_buff0_thd4~0_Out418061222 0) (not .cse2) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In418061222, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In418061222} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In418061222, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out418061222, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out418061222|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 13:29:58,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L822-->L822-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1090455714 256))) (.cse3 (= (mod ~z$r_buff1_thd4~0_In1090455714 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1090455714 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1090455714 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork1_#t~ite31_Out1090455714| 0)) (and (or .cse2 .cse3) (= |P3Thread1of1ForFork1_#t~ite31_Out1090455714| ~z$r_buff1_thd4~0_In1090455714) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1090455714, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1090455714, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1090455714, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1090455714} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1090455714, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1090455714, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1090455714, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1090455714, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out1090455714|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 13:29:58,643 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 13:29:58,643 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 13:29:58,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L853-2-->L853-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-783833756 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-783833756 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In-783833756 |ULTIMATE.start_main_#t~ite36_Out-783833756|)) (and (not .cse1) (= ~z$w_buff1~0_In-783833756 |ULTIMATE.start_main_#t~ite36_Out-783833756|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-783833756, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-783833756, ~z$w_buff1~0=~z$w_buff1~0_In-783833756, ~z~0=~z~0_In-783833756} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-783833756, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-783833756, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-783833756|, ~z$w_buff1~0=~z$w_buff1~0_In-783833756, ~z~0=~z~0_In-783833756} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 13:29:58,643 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 13:29:58,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L854-->L854-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-832555389 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-832555389 256) 0))) (or (and (= ~z$w_buff0_used~0_In-832555389 |ULTIMATE.start_main_#t~ite38_Out-832555389|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out-832555389|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-832555389, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-832555389} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-832555389, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-832555389, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-832555389|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 13:29:58,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L855-->L855-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In699958860 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In699958860 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In699958860 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In699958860 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out699958860| 0)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In699958860 |ULTIMATE.start_main_#t~ite39_Out699958860|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In699958860, ~z$w_buff0_used~0=~z$w_buff0_used~0_In699958860, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In699958860, ~z$w_buff1_used~0=~z$w_buff1_used~0_In699958860} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In699958860, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out699958860|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In699958860, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In699958860, ~z$w_buff1_used~0=~z$w_buff1_used~0_In699958860} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 13:29:58,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In952313063 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In952313063 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out952313063| ~z$r_buff0_thd0~0_In952313063)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out952313063| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In952313063, ~z$w_buff0_used~0=~z$w_buff0_used~0_In952313063} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In952313063, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out952313063|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In952313063} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:29:58,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L857-->L857-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1189117811 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1189117811 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1189117811 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1189117811 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite41_Out-1189117811|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-1189117811 |ULTIMATE.start_main_#t~ite41_Out-1189117811|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1189117811, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1189117811, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1189117811, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1189117811} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1189117811|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1189117811, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1189117811, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1189117811, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1189117811} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 13:29:58,645 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 13:29:58,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:29:58 BasicIcfg [2019-12-07 13:29:58,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:29:58,688 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:29:58,688 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:29:58,688 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:29:58,688 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:29:48" (3/4) ... [2019-12-07 13:29:58,690 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:29:58,690 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) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1077~0.base_46|) (= 0 v_~z$r_buff1_thd2~0_69) (= v_~z$w_buff0~0_326 0) (= |v_#valid_95| (store .cse0 |v_ULTIMATE.start_main_~#t1077~0.base_46| 1)) (= 0 v_~z$r_buff1_thd4~0_128) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1077~0.base_46| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1077~0.base_46|) |v_ULTIMATE.start_main_~#t1077~0.offset_30| 0)) |v_#memory_int_25|) (= |v_ULTIMATE.start_main_~#t1077~0.offset_30| 0) (= 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) (= 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_~z$read_delayed_var~0.base_6 0) (= v_~z~0_172 0) (= 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) (= (select .cse0 |v_ULTIMATE.start_main_~#t1077~0.base_46|) 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) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1077~0.base_46| 4)) (= v_~__unbuffered_p3_EAX~0_105 0) (= 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_~#t1078~0.base=|v_ULTIMATE.start_main_~#t1078~0.base_45|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_83, ULTIMATE.start_main_~#t1079~0.offset=|v_ULTIMATE.start_main_~#t1079~0.offset_29|, ~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, ULTIMATE.start_main_~#t1080~0.base=|v_ULTIMATE.start_main_~#t1080~0.base_26|, ~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, ULTIMATE.start_main_~#t1077~0.offset=|v_ULTIMATE.start_main_~#t1077~0.offset_30|, ~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_~#t1079~0.base=|v_ULTIMATE.start_main_~#t1079~0.base_45|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, ~y~0=v_~y~0_82, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25, ULTIMATE.start_main_~#t1078~0.offset=|v_ULTIMATE.start_main_~#t1078~0.offset_29|, ~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_#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, #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_~#t1080~0.offset=|v_ULTIMATE.start_main_~#t1080~0.offset_19|, ULTIMATE.start_main_~#t1077~0.base=|v_ULTIMATE.start_main_~#t1077~0.base_46|, ~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_~#t1078~0.base, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t1079~0.offset, ~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, ULTIMATE.start_main_~#t1080~0.base, ~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, ULTIMATE.start_main_~#t1077~0.offset, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1079~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1078~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1080~0.offset, ULTIMATE.start_main_~#t1077~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:29:58,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L841-1-->L843: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1078~0.base_13| 0)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1078~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1078~0.offset_11| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1078~0.base_13| 4) |v_#length_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1078~0.base_13|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1078~0.base_13|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1078~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1078~0.base_13|) |v_ULTIMATE.start_main_~#t1078~0.offset_11| 1)) |v_#memory_int_15|)) 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_~#t1078~0.offset=|v_ULTIMATE.start_main_~#t1078~0.offset_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1078~0.base=|v_ULTIMATE.start_main_~#t1078~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1078~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1078~0.base] because there is no mapped edge [2019-12-07 13:29:58,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1079~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1079~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1079~0.offset_11| 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1079~0.base_13| 4) |v_#length_21|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1079~0.base_13|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1079~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1079~0.base_13|) |v_ULTIMATE.start_main_~#t1079~0.offset_11| 2)) |v_#memory_int_19|) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1079~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1079~0.base=|v_ULTIMATE.start_main_~#t1079~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t1079~0.offset=|v_ULTIMATE.start_main_~#t1079~0.offset_11|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1079~0.base, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1079~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:29:58,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L845-1-->L847: Formula: (and (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1080~0.base_11| 4) |v_#length_19|) (= 0 |v_ULTIMATE.start_main_~#t1080~0.offset_10|) (= (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1080~0.base_11| 1) |v_#valid_42|) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1080~0.base_11|) 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1080~0.base_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1080~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1080~0.base_11|) |v_ULTIMATE.start_main_~#t1080~0.offset_10| 3)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t1080~0.base_11|))) 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_~#t1080~0.offset=|v_ULTIMATE.start_main_~#t1080~0.offset_10|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1080~0.base=|v_ULTIMATE.start_main_~#t1080~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1080~0.offset, #length, ULTIMATE.start_main_~#t1080~0.base] because there is no mapped edge [2019-12-07 13:29:58,692 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 13:29:58,692 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 13:29:58,692 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 13:29:58,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L776-->L776-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In921319635 256) 0))) (or (and (= ~z$w_buff0~0_In921319635 |P2Thread1of1ForFork0_#t~ite9_Out921319635|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite8_In921319635| |P2Thread1of1ForFork0_#t~ite8_Out921319635|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In921319635 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In921319635 256)) .cse1) (= (mod ~z$w_buff0_used~0_In921319635 256) 0) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In921319635 256) 0)))) .cse0 (= |P2Thread1of1ForFork0_#t~ite9_Out921319635| |P2Thread1of1ForFork0_#t~ite8_Out921319635|) (= ~z$w_buff0~0_In921319635 |P2Thread1of1ForFork0_#t~ite8_Out921319635|)))) InVars {P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_In921319635|, ~z$w_buff0~0=~z$w_buff0~0_In921319635, ~z$w_buff0_used~0=~z$w_buff0_used~0_In921319635, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In921319635, ~z$w_buff1_used~0=~z$w_buff1_used~0_In921319635, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In921319635, ~weak$$choice2~0=~weak$$choice2~0_In921319635} OutVars{P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_Out921319635|, ~z$w_buff0~0=~z$w_buff0~0_In921319635, ~z$w_buff0_used~0=~z$w_buff0_used~0_In921319635, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In921319635, ~z$w_buff1_used~0=~z$w_buff1_used~0_In921319635, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In921319635, ~weak$$choice2~0=~weak$$choice2~0_In921319635, P2Thread1of1ForFork0_#t~ite9=|P2Thread1of1ForFork0_#t~ite9_Out921319635|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite8, P2Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 13:29:58,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L777-->L777-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In455056838 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In455056838 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In455056838 256)) .cse1) (= (mod ~z$w_buff0_used~0_In455056838 256) 0) (and (= (mod ~z$w_buff1_used~0_In455056838 256) 0) .cse1))) (= |P2Thread1of1ForFork0_#t~ite12_Out455056838| |P2Thread1of1ForFork0_#t~ite11_Out455056838|) (= |P2Thread1of1ForFork0_#t~ite11_Out455056838| ~z$w_buff1~0_In455056838)) (and (= |P2Thread1of1ForFork0_#t~ite11_In455056838| |P2Thread1of1ForFork0_#t~ite11_Out455056838|) (= |P2Thread1of1ForFork0_#t~ite12_Out455056838| ~z$w_buff1~0_In455056838) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In455056838, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In455056838|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In455056838, ~z$w_buff1_used~0=~z$w_buff1_used~0_In455056838, ~z$w_buff1~0=~z$w_buff1~0_In455056838, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In455056838, ~weak$$choice2~0=~weak$$choice2~0_In455056838} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out455056838|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In455056838, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out455056838|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In455056838, ~z$w_buff1_used~0=~z$w_buff1_used~0_In455056838, ~z$w_buff1~0=~z$w_buff1~0_In455056838, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In455056838, ~weak$$choice2~0=~weak$$choice2~0_In455056838} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 13:29:58,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L778-->L778-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In155923062 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite14_In155923062| |P2Thread1of1ForFork0_#t~ite14_Out155923062|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite15_Out155923062| ~z$w_buff0_used~0_In155923062)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In155923062 256)))) (or (= (mod ~z$w_buff0_used~0_In155923062 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In155923062 256)) .cse1) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In155923062 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite14_Out155923062| ~z$w_buff0_used~0_In155923062) (= |P2Thread1of1ForFork0_#t~ite15_Out155923062| |P2Thread1of1ForFork0_#t~ite14_Out155923062|) .cse0))) InVars {P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_In155923062|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In155923062, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In155923062, ~z$w_buff1_used~0=~z$w_buff1_used~0_In155923062, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In155923062, ~weak$$choice2~0=~weak$$choice2~0_In155923062} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out155923062|, P2Thread1of1ForFork0_#t~ite15=|P2Thread1of1ForFork0_#t~ite15_Out155923062|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In155923062, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In155923062, ~z$w_buff1_used~0=~z$w_buff1_used~0_In155923062, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In155923062, ~weak$$choice2~0=~weak$$choice2~0_In155923062} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, P2Thread1of1ForFork0_#t~ite15] because there is no mapped edge [2019-12-07 13:29:58,695 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 13:29:58,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1989798189 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1989798189 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork1_#t~ite28_Out-1989798189|)) (and (= ~z$w_buff0_used~0_In-1989798189 |P3Thread1of1ForFork1_#t~ite28_Out-1989798189|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1989798189, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1989798189} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1989798189, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out-1989798189|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1989798189} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 13:29:58,696 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 13:29:58,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L820-->L820-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd4~0_In1885113751 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1885113751 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1885113751 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1885113751 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork1_#t~ite29_Out1885113751| ~z$w_buff1_used~0_In1885113751)) (and (= |P3Thread1of1ForFork1_#t~ite29_Out1885113751| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1885113751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1885113751, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1885113751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1885113751} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1885113751, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out1885113751|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1885113751, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1885113751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1885113751} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 13:29:58,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L821-->L822: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_Out418061222 ~z$r_buff0_thd4~0_In418061222)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In418061222 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In418061222 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~z$r_buff0_thd4~0_Out418061222 0) (not .cse2) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In418061222, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In418061222} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In418061222, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out418061222, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out418061222|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 13:29:58,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L822-->L822-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1090455714 256))) (.cse3 (= (mod ~z$r_buff1_thd4~0_In1090455714 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1090455714 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1090455714 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork1_#t~ite31_Out1090455714| 0)) (and (or .cse2 .cse3) (= |P3Thread1of1ForFork1_#t~ite31_Out1090455714| ~z$r_buff1_thd4~0_In1090455714) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1090455714, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1090455714, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1090455714, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1090455714} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1090455714, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1090455714, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1090455714, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1090455714, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out1090455714|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 13:29:58,697 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 13:29:58,697 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 13:29:58,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L853-2-->L853-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-783833756 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-783833756 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In-783833756 |ULTIMATE.start_main_#t~ite36_Out-783833756|)) (and (not .cse1) (= ~z$w_buff1~0_In-783833756 |ULTIMATE.start_main_#t~ite36_Out-783833756|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-783833756, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-783833756, ~z$w_buff1~0=~z$w_buff1~0_In-783833756, ~z~0=~z~0_In-783833756} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-783833756, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-783833756, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-783833756|, ~z$w_buff1~0=~z$w_buff1~0_In-783833756, ~z~0=~z~0_In-783833756} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 13:29:58,698 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 13:29:58,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L854-->L854-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-832555389 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-832555389 256) 0))) (or (and (= ~z$w_buff0_used~0_In-832555389 |ULTIMATE.start_main_#t~ite38_Out-832555389|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out-832555389|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-832555389, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-832555389} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-832555389, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-832555389, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-832555389|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 13:29:58,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L855-->L855-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In699958860 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In699958860 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In699958860 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In699958860 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out699958860| 0)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In699958860 |ULTIMATE.start_main_#t~ite39_Out699958860|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In699958860, ~z$w_buff0_used~0=~z$w_buff0_used~0_In699958860, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In699958860, ~z$w_buff1_used~0=~z$w_buff1_used~0_In699958860} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In699958860, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out699958860|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In699958860, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In699958860, ~z$w_buff1_used~0=~z$w_buff1_used~0_In699958860} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 13:29:58,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In952313063 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In952313063 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out952313063| ~z$r_buff0_thd0~0_In952313063)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out952313063| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In952313063, ~z$w_buff0_used~0=~z$w_buff0_used~0_In952313063} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In952313063, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out952313063|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In952313063} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:29:58,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L857-->L857-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1189117811 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1189117811 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1189117811 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1189117811 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite41_Out-1189117811|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-1189117811 |ULTIMATE.start_main_#t~ite41_Out-1189117811|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1189117811, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1189117811, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1189117811, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1189117811} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1189117811|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1189117811, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1189117811, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1189117811, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1189117811} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 13:29:58,699 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 13:29:58,749 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0bae17a6-273c-40fb-a933-0d327e8a3540/bin/uautomizer/witness.graphml [2019-12-07 13:29:58,749 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:29:58,750 INFO L168 Benchmark]: Toolchain (without parser) took 11278.76 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 568.9 MB). Free memory was 940.6 MB in the beginning and 920.1 MB in the end (delta: 20.5 MB). Peak memory consumption was 589.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:29:58,750 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:29:58,750 INFO L168 Benchmark]: CACSL2BoogieTranslator took 436.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -165.5 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:29:58,750 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:29:58,751 INFO L168 Benchmark]: Boogie Preprocessor took 25.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:29:58,751 INFO L168 Benchmark]: RCFGBuilder took 368.12 ms. Allocated memory is still 1.2 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 13:29:58,751 INFO L168 Benchmark]: TraceAbstraction took 10346.76 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 430.4 MB). Free memory was 1.0 GB in the beginning and 953.2 MB in the end (delta: 91.3 MB). Peak memory consumption was 521.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:29:58,752 INFO L168 Benchmark]: Witness Printer took 60.98 ms. Allocated memory is still 1.6 GB. Free memory was 953.2 MB in the beginning and 920.1 MB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:29:58,753 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 436.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -165.5 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 368.12 ms. Allocated memory is still 1.2 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 10346.76 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 430.4 MB). Free memory was 1.0 GB in the beginning and 953.2 MB in the end (delta: 91.3 MB). Peak memory consumption was 521.7 MB. Max. memory is 11.5 GB. * Witness Printer took 60.98 ms. Allocated memory is still 1.6 GB. Free memory was 953.2 MB in the beginning and 920.1 MB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 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(&t1077, ((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(&t1078, ((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(&t1079, ((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(&t1080, ((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: 10.1s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1915 SDtfs, 1994 SDslu, 3588 SDs, 0 SdLazy, 1338 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27254occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 12701 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 489 NumberOfCodeBlocks, 489 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 427 ConstructedInterpolants, 0 QuantifiedInterpolants, 88264 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...