./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix038_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_362ac244-5eee-4954-989f-f18519314773/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_362ac244-5eee-4954-989f-f18519314773/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_362ac244-5eee-4954-989f-f18519314773/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_362ac244-5eee-4954-989f-f18519314773/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_362ac244-5eee-4954-989f-f18519314773/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_362ac244-5eee-4954-989f-f18519314773/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 4c2bddf0da31d44ec528f5975216c3b70f4cb204 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:37:01,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:37:01,119 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:37:01,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:37:01,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:37:01,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:37:01,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:37:01,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:37:01,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:37:01,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:37:01,132 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:37:01,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:37:01,133 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:37:01,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:37:01,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:37:01,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:37:01,135 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:37:01,136 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:37:01,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:37:01,139 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:37:01,140 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:37:01,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:37:01,141 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:37:01,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:37:01,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:37:01,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:37:01,143 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:37:01,144 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:37:01,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:37:01,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:37:01,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:37:01,145 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:37:01,145 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:37:01,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:37:01,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:37:01,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:37:01,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:37:01,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:37:01,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:37:01,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:37:01,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:37:01,149 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_362ac244-5eee-4954-989f-f18519314773/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:37:01,158 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:37:01,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:37:01,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:37:01,159 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:37:01,159 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:37:01,159 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:37:01,159 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:37:01,159 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:37:01,160 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:37:01,160 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:37:01,160 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:37:01,160 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:37:01,160 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:37:01,160 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:37:01,160 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:37:01,160 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:37:01,161 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:37:01,161 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:37:01,161 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:37:01,161 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:37:01,161 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:37:01,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:37:01,161 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:37:01,161 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:37:01,162 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:37:01,162 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:37:01,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:37:01,162 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:37:01,162 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:37:01,162 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_362ac244-5eee-4954-989f-f18519314773/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 -> 4c2bddf0da31d44ec528f5975216c3b70f4cb204 [2019-12-07 13:37:01,261 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:37:01,269 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:37:01,271 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:37:01,272 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:37:01,272 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:37:01,273 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_362ac244-5eee-4954-989f-f18519314773/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix038_rmo.opt.i [2019-12-07 13:37:01,309 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_362ac244-5eee-4954-989f-f18519314773/bin/uautomizer/data/3dc440f09/0b284f04c5fd445babb33dc6cffe8e29/FLAG758465f58 [2019-12-07 13:37:01,818 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:37:01,819 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_362ac244-5eee-4954-989f-f18519314773/sv-benchmarks/c/pthread-wmm/mix038_rmo.opt.i [2019-12-07 13:37:01,828 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_362ac244-5eee-4954-989f-f18519314773/bin/uautomizer/data/3dc440f09/0b284f04c5fd445babb33dc6cffe8e29/FLAG758465f58 [2019-12-07 13:37:02,342 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_362ac244-5eee-4954-989f-f18519314773/bin/uautomizer/data/3dc440f09/0b284f04c5fd445babb33dc6cffe8e29 [2019-12-07 13:37:02,345 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:37:02,346 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:37:02,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:37:02,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:37:02,349 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:37:02,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:37:02" (1/1) ... [2019-12-07 13:37:02,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a374d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:02, skipping insertion in model container [2019-12-07 13:37:02,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:37:02" (1/1) ... [2019-12-07 13:37:02,357 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:37:02,385 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:37:02,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:37:02,659 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:37:02,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:37:02,753 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:37:02,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:02 WrapperNode [2019-12-07 13:37:02,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:37:02,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:37:02,754 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:37:02,754 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:37:02,759 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:37:02" (1/1) ... [2019-12-07 13:37:02,772 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:37:02" (1/1) ... [2019-12-07 13:37:02,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:37:02,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:37:02,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:37:02,791 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:37:02,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:02" (1/1) ... [2019-12-07 13:37:02,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:02" (1/1) ... [2019-12-07 13:37:02,801 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:02" (1/1) ... [2019-12-07 13:37:02,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:02" (1/1) ... [2019-12-07 13:37:02,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:02" (1/1) ... [2019-12-07 13:37:02,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:02" (1/1) ... [2019-12-07 13:37:02,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:02" (1/1) ... [2019-12-07 13:37:02,815 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:37:02,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:37:02,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:37:02,815 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:37:02,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_362ac244-5eee-4954-989f-f18519314773/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:37:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:37:02,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:37:02,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:37:02,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:37:02,858 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:37:02,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:37:02,858 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:37:02,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:37:02,858 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 13:37:02,858 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 13:37:02,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:37:02,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:37:02,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:37:02,860 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:37:03,191 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:37:03,192 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:37:03,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:37:03 BoogieIcfgContainer [2019-12-07 13:37:03,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:37:03,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:37:03,193 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:37:03,196 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:37:03,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:37:02" (1/3) ... [2019-12-07 13:37:03,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c40898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:37:03, skipping insertion in model container [2019-12-07 13:37:03,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:37:02" (2/3) ... [2019-12-07 13:37:03,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c40898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:37:03, skipping insertion in model container [2019-12-07 13:37:03,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:37:03" (3/3) ... [2019-12-07 13:37:03,199 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_rmo.opt.i [2019-12-07 13:37:03,205 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:37:03,206 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:37:03,210 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:37:03,211 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:37:03,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,235 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,236 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,237 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,237 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,252 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,253 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,253 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,253 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,253 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:37:03,272 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 13:37:03,286 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:37:03,287 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:37:03,287 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:37:03,287 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:37:03,287 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:37:03,287 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:37:03,287 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:37:03,287 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:37:03,297 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 178 transitions [2019-12-07 13:37:03,298 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 178 transitions [2019-12-07 13:37:03,344 INFO L134 PetriNetUnfolder]: 35/175 cut-off events. [2019-12-07 13:37:03,344 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:37:03,352 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 35/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 562 event pairs. 9/147 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 13:37:03,365 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 153 places, 178 transitions [2019-12-07 13:37:03,388 INFO L134 PetriNetUnfolder]: 35/175 cut-off events. [2019-12-07 13:37:03,388 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:37:03,392 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 175 events. 35/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 562 event pairs. 9/147 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 13:37:03,402 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-07 13:37:03,403 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:37:05,824 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-07 13:37:05,923 INFO L206 etLargeBlockEncoding]: Checked pairs total: 41572 [2019-12-07 13:37:05,923 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-07 13:37:05,925 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 80 transitions [2019-12-07 13:37:06,507 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13626 states. [2019-12-07 13:37:06,508 INFO L276 IsEmpty]: Start isEmpty. Operand 13626 states. [2019-12-07 13:37:06,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 13:37:06,513 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:06,513 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:37:06,513 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:06,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:06,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1504632550, now seen corresponding path program 1 times [2019-12-07 13:37:06,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:37:06,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905647497] [2019-12-07 13:37:06,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:06,669 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:37:06,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905647497] [2019-12-07 13:37:06,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:06,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:37:06,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509110296] [2019-12-07 13:37:06,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:37:06,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:37:06,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:37:06,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:37:06,684 INFO L87 Difference]: Start difference. First operand 13626 states. Second operand 3 states. [2019-12-07 13:37:06,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:06,871 INFO L93 Difference]: Finished difference Result 13322 states and 50870 transitions. [2019-12-07 13:37:06,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:37:06,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 13:37:06,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:06,974 INFO L225 Difference]: With dead ends: 13322 [2019-12-07 13:37:06,974 INFO L226 Difference]: Without dead ends: 12542 [2019-12-07 13:37:06,975 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:37:07,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12542 states. [2019-12-07 13:37:07,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12542 to 12542. [2019-12-07 13:37:07,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12542 states. [2019-12-07 13:37:07,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12542 states to 12542 states and 47820 transitions. [2019-12-07 13:37:07,474 INFO L78 Accepts]: Start accepts. Automaton has 12542 states and 47820 transitions. Word has length 7 [2019-12-07 13:37:07,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:07,475 INFO L462 AbstractCegarLoop]: Abstraction has 12542 states and 47820 transitions. [2019-12-07 13:37:07,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:37:07,475 INFO L276 IsEmpty]: Start isEmpty. Operand 12542 states and 47820 transitions. [2019-12-07 13:37:07,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:37:07,479 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:07,479 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:37:07,479 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:07,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:07,480 INFO L82 PathProgramCache]: Analyzing trace with hash 696666680, now seen corresponding path program 1 times [2019-12-07 13:37:07,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:37:07,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299355440] [2019-12-07 13:37:07,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:07,542 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:37:07,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299355440] [2019-12-07 13:37:07,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:07,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:37:07,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901841168] [2019-12-07 13:37:07,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:37:07,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:37:07,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:37:07,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:37:07,544 INFO L87 Difference]: Start difference. First operand 12542 states and 47820 transitions. Second operand 4 states. [2019-12-07 13:37:07,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:07,773 INFO L93 Difference]: Finished difference Result 19054 states and 69906 transitions. [2019-12-07 13:37:07,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:37:07,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 13:37:07,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:07,858 INFO L225 Difference]: With dead ends: 19054 [2019-12-07 13:37:07,858 INFO L226 Difference]: Without dead ends: 19022 [2019-12-07 13:37:07,859 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:37:07,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19022 states. [2019-12-07 13:37:08,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19022 to 17202. [2019-12-07 13:37:08,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17202 states. [2019-12-07 13:37:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17202 states to 17202 states and 63964 transitions. [2019-12-07 13:37:08,374 INFO L78 Accepts]: Start accepts. Automaton has 17202 states and 63964 transitions. Word has length 13 [2019-12-07 13:37:08,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:08,374 INFO L462 AbstractCegarLoop]: Abstraction has 17202 states and 63964 transitions. [2019-12-07 13:37:08,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:37:08,374 INFO L276 IsEmpty]: Start isEmpty. Operand 17202 states and 63964 transitions. [2019-12-07 13:37:08,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:37:08,379 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:08,379 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:37:08,379 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:08,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:08,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1273661692, now seen corresponding path program 1 times [2019-12-07 13:37:08,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:37:08,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169064055] [2019-12-07 13:37:08,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:08,434 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:37:08,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169064055] [2019-12-07 13:37:08,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:08,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:37:08,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10259036] [2019-12-07 13:37:08,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:37:08,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:37:08,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:37:08,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:37:08,436 INFO L87 Difference]: Start difference. First operand 17202 states and 63964 transitions. Second operand 4 states. [2019-12-07 13:37:08,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:08,602 INFO L93 Difference]: Finished difference Result 21830 states and 80562 transitions. [2019-12-07 13:37:08,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:37:08,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 13:37:08,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:08,638 INFO L225 Difference]: With dead ends: 21830 [2019-12-07 13:37:08,638 INFO L226 Difference]: Without dead ends: 21804 [2019-12-07 13:37:08,639 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:37:08,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21804 states. [2019-12-07 13:37:08,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21804 to 18792. [2019-12-07 13:37:08,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18792 states. [2019-12-07 13:37:09,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18792 states to 18792 states and 69925 transitions. [2019-12-07 13:37:09,022 INFO L78 Accepts]: Start accepts. Automaton has 18792 states and 69925 transitions. Word has length 16 [2019-12-07 13:37:09,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:09,022 INFO L462 AbstractCegarLoop]: Abstraction has 18792 states and 69925 transitions. [2019-12-07 13:37:09,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:37:09,023 INFO L276 IsEmpty]: Start isEmpty. Operand 18792 states and 69925 transitions. [2019-12-07 13:37:09,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:37:09,101 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:09,101 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:37:09,101 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:09,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:09,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1486252895, now seen corresponding path program 1 times [2019-12-07 13:37:09,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:37:09,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991129711] [2019-12-07 13:37:09,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:09,155 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:37:09,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991129711] [2019-12-07 13:37:09,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:09,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:37:09,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047824253] [2019-12-07 13:37:09,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:37:09,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:37:09,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:37:09,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:37:09,156 INFO L87 Difference]: Start difference. First operand 18792 states and 69925 transitions. Second operand 3 states. [2019-12-07 13:37:09,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:09,222 INFO L93 Difference]: Finished difference Result 17806 states and 65342 transitions. [2019-12-07 13:37:09,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:37:09,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 13:37:09,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:09,252 INFO L225 Difference]: With dead ends: 17806 [2019-12-07 13:37:09,252 INFO L226 Difference]: Without dead ends: 17806 [2019-12-07 13:37:09,252 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:37:09,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17806 states. [2019-12-07 13:37:09,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17806 to 17542. [2019-12-07 13:37:09,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17542 states. [2019-12-07 13:37:09,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17542 states to 17542 states and 64442 transitions. [2019-12-07 13:37:09,607 INFO L78 Accepts]: Start accepts. Automaton has 17542 states and 64442 transitions. Word has length 18 [2019-12-07 13:37:09,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:09,607 INFO L462 AbstractCegarLoop]: Abstraction has 17542 states and 64442 transitions. [2019-12-07 13:37:09,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:37:09,607 INFO L276 IsEmpty]: Start isEmpty. Operand 17542 states and 64442 transitions. [2019-12-07 13:37:09,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:37:09,611 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:09,611 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:37:09,611 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:09,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:09,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1446671698, now seen corresponding path program 1 times [2019-12-07 13:37:09,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:37:09,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590465957] [2019-12-07 13:37:09,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:09,667 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:37:09,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590465957] [2019-12-07 13:37:09,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:09,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:37:09,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306688586] [2019-12-07 13:37:09,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:37:09,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:37:09,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:37:09,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:37:09,668 INFO L87 Difference]: Start difference. First operand 17542 states and 64442 transitions. Second operand 3 states. [2019-12-07 13:37:09,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:09,766 INFO L93 Difference]: Finished difference Result 26307 states and 91521 transitions. [2019-12-07 13:37:09,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:37:09,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 13:37:09,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:09,809 INFO L225 Difference]: With dead ends: 26307 [2019-12-07 13:37:09,809 INFO L226 Difference]: Without dead ends: 25675 [2019-12-07 13:37:09,809 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:37:09,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25675 states. [2019-12-07 13:37:10,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25675 to 24859. [2019-12-07 13:37:10,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24859 states. [2019-12-07 13:37:10,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24859 states to 24859 states and 87229 transitions. [2019-12-07 13:37:10,355 INFO L78 Accepts]: Start accepts. Automaton has 24859 states and 87229 transitions. Word has length 18 [2019-12-07 13:37:10,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:10,356 INFO L462 AbstractCegarLoop]: Abstraction has 24859 states and 87229 transitions. [2019-12-07 13:37:10,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:37:10,356 INFO L276 IsEmpty]: Start isEmpty. Operand 24859 states and 87229 transitions. [2019-12-07 13:37:10,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 13:37:10,362 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:10,362 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:37:10,362 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:10,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:10,362 INFO L82 PathProgramCache]: Analyzing trace with hash -481288137, now seen corresponding path program 1 times [2019-12-07 13:37:10,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:37:10,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255449353] [2019-12-07 13:37:10,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:10,388 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:37:10,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255449353] [2019-12-07 13:37:10,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:10,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:37:10,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631267339] [2019-12-07 13:37:10,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:37:10,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:37:10,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:37:10,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:37:10,390 INFO L87 Difference]: Start difference. First operand 24859 states and 87229 transitions. Second operand 3 states. [2019-12-07 13:37:10,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:10,440 INFO L93 Difference]: Finished difference Result 15981 states and 51224 transitions. [2019-12-07 13:37:10,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:37:10,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 13:37:10,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:10,462 INFO L225 Difference]: With dead ends: 15981 [2019-12-07 13:37:10,462 INFO L226 Difference]: Without dead ends: 15981 [2019-12-07 13:37:10,463 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:37:10,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15981 states. [2019-12-07 13:37:10,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15981 to 15981. [2019-12-07 13:37:10,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15981 states. [2019-12-07 13:37:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15981 states to 15981 states and 51224 transitions. [2019-12-07 13:37:10,692 INFO L78 Accepts]: Start accepts. Automaton has 15981 states and 51224 transitions. Word has length 19 [2019-12-07 13:37:10,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:10,692 INFO L462 AbstractCegarLoop]: Abstraction has 15981 states and 51224 transitions. [2019-12-07 13:37:10,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:37:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 15981 states and 51224 transitions. [2019-12-07 13:37:10,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 13:37:10,696 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:10,696 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:37:10,696 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:10,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:10,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1008355334, now seen corresponding path program 1 times [2019-12-07 13:37:10,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:37:10,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123640695] [2019-12-07 13:37:10,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:10,723 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:37:10,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123640695] [2019-12-07 13:37:10,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:10,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:37:10,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983325644] [2019-12-07 13:37:10,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:37:10,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:37:10,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:37:10,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:37:10,724 INFO L87 Difference]: Start difference. First operand 15981 states and 51224 transitions. Second operand 4 states. [2019-12-07 13:37:10,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:10,744 INFO L93 Difference]: Finished difference Result 2865 states and 7271 transitions. [2019-12-07 13:37:10,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:37:10,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 13:37:10,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:10,748 INFO L225 Difference]: With dead ends: 2865 [2019-12-07 13:37:10,748 INFO L226 Difference]: Without dead ends: 2865 [2019-12-07 13:37:10,748 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:37:10,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2865 states. [2019-12-07 13:37:10,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2865 to 2783. [2019-12-07 13:37:10,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2783 states. [2019-12-07 13:37:10,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2783 states and 7085 transitions. [2019-12-07 13:37:10,775 INFO L78 Accepts]: Start accepts. Automaton has 2783 states and 7085 transitions. Word has length 20 [2019-12-07 13:37:10,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:10,775 INFO L462 AbstractCegarLoop]: Abstraction has 2783 states and 7085 transitions. [2019-12-07 13:37:10,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:37:10,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2783 states and 7085 transitions. [2019-12-07 13:37:10,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 13:37:10,778 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:10,778 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] [2019-12-07 13:37:10,778 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:10,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:10,778 INFO L82 PathProgramCache]: Analyzing trace with hash -164246467, now seen corresponding path program 1 times [2019-12-07 13:37:10,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:37:10,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368339993] [2019-12-07 13:37:10,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:10,837 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:37:10,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368339993] [2019-12-07 13:37:10,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:10,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:37:10,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589453579] [2019-12-07 13:37:10,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:37:10,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:37:10,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:37:10,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:37:10,838 INFO L87 Difference]: Start difference. First operand 2783 states and 7085 transitions. Second operand 6 states. [2019-12-07 13:37:11,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:11,119 INFO L93 Difference]: Finished difference Result 7181 states and 18285 transitions. [2019-12-07 13:37:11,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:37:11,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-07 13:37:11,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:11,125 INFO L225 Difference]: With dead ends: 7181 [2019-12-07 13:37:11,125 INFO L226 Difference]: Without dead ends: 7177 [2019-12-07 13:37:11,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:37:11,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7177 states. [2019-12-07 13:37:11,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7177 to 3708. [2019-12-07 13:37:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3708 states. [2019-12-07 13:37:11,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3708 states to 3708 states and 9626 transitions. [2019-12-07 13:37:11,181 INFO L78 Accepts]: Start accepts. Automaton has 3708 states and 9626 transitions. Word has length 29 [2019-12-07 13:37:11,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:11,181 INFO L462 AbstractCegarLoop]: Abstraction has 3708 states and 9626 transitions. [2019-12-07 13:37:11,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:37:11,181 INFO L276 IsEmpty]: Start isEmpty. Operand 3708 states and 9626 transitions. [2019-12-07 13:37:11,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 13:37:11,185 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:11,185 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] [2019-12-07 13:37:11,185 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:11,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:11,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1490700114, now seen corresponding path program 1 times [2019-12-07 13:37:11,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:37:11,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458050429] [2019-12-07 13:37:11,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:11,234 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:37:11,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458050429] [2019-12-07 13:37:11,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:11,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:37:11,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52722807] [2019-12-07 13:37:11,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:37:11,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:37:11,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:37:11,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:37:11,235 INFO L87 Difference]: Start difference. First operand 3708 states and 9626 transitions. Second operand 6 states. [2019-12-07 13:37:11,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:11,536 INFO L93 Difference]: Finished difference Result 6910 states and 17490 transitions. [2019-12-07 13:37:11,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:37:11,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-12-07 13:37:11,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:11,542 INFO L225 Difference]: With dead ends: 6910 [2019-12-07 13:37:11,542 INFO L226 Difference]: Without dead ends: 6908 [2019-12-07 13:37:11,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:37:11,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6908 states. [2019-12-07 13:37:11,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6908 to 3313. [2019-12-07 13:37:11,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3313 states. [2019-12-07 13:37:11,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3313 states to 3313 states and 8603 transitions. [2019-12-07 13:37:11,586 INFO L78 Accepts]: Start accepts. Automaton has 3313 states and 8603 transitions. Word has length 30 [2019-12-07 13:37:11,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:11,586 INFO L462 AbstractCegarLoop]: Abstraction has 3313 states and 8603 transitions. [2019-12-07 13:37:11,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:37:11,586 INFO L276 IsEmpty]: Start isEmpty. Operand 3313 states and 8603 transitions. [2019-12-07 13:37:11,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 13:37:11,589 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:11,589 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] [2019-12-07 13:37:11,589 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:11,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:11,589 INFO L82 PathProgramCache]: Analyzing trace with hash 60099491, now seen corresponding path program 1 times [2019-12-07 13:37:11,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:37:11,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218123648] [2019-12-07 13:37:11,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:11,629 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:37:11,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218123648] [2019-12-07 13:37:11,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:11,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:37:11,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125608734] [2019-12-07 13:37:11,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:37:11,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:37:11,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:37:11,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:37:11,630 INFO L87 Difference]: Start difference. First operand 3313 states and 8603 transitions. Second operand 5 states. [2019-12-07 13:37:11,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:11,651 INFO L93 Difference]: Finished difference Result 1952 states and 5242 transitions. [2019-12-07 13:37:11,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:37:11,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 13:37:11,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:11,653 INFO L225 Difference]: With dead ends: 1952 [2019-12-07 13:37:11,653 INFO L226 Difference]: Without dead ends: 1900 [2019-12-07 13:37:11,653 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:37:11,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1900 states. [2019-12-07 13:37:11,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1900 to 1142. [2019-12-07 13:37:11,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1142 states. [2019-12-07 13:37:11,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 3162 transitions. [2019-12-07 13:37:11,666 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 3162 transitions. Word has length 30 [2019-12-07 13:37:11,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:11,667 INFO L462 AbstractCegarLoop]: Abstraction has 1142 states and 3162 transitions. [2019-12-07 13:37:11,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:37:11,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 3162 transitions. [2019-12-07 13:37:11,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 13:37:11,668 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:11,668 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] [2019-12-07 13:37:11,669 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:11,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:11,669 INFO L82 PathProgramCache]: Analyzing trace with hash 748255129, now seen corresponding path program 1 times [2019-12-07 13:37:11,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:37:11,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112227554] [2019-12-07 13:37:11,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:11,744 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:37:11,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112227554] [2019-12-07 13:37:11,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:11,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:37:11,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964959029] [2019-12-07 13:37:11,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:37:11,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:37:11,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:37:11,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:37:11,745 INFO L87 Difference]: Start difference. First operand 1142 states and 3162 transitions. Second operand 6 states. [2019-12-07 13:37:11,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:11,960 INFO L93 Difference]: Finished difference Result 4290 states and 11140 transitions. [2019-12-07 13:37:11,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:37:11,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-07 13:37:11,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:11,963 INFO L225 Difference]: With dead ends: 4290 [2019-12-07 13:37:11,963 INFO L226 Difference]: Without dead ends: 2940 [2019-12-07 13:37:11,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:37:11,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2019-12-07 13:37:11,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 1286. [2019-12-07 13:37:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1286 states. [2019-12-07 13:37:11,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 3580 transitions. [2019-12-07 13:37:11,980 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 3580 transitions. Word has length 45 [2019-12-07 13:37:11,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:11,981 INFO L462 AbstractCegarLoop]: Abstraction has 1286 states and 3580 transitions. [2019-12-07 13:37:11,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:37:11,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 3580 transitions. [2019-12-07 13:37:11,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 13:37:11,982 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:11,982 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] [2019-12-07 13:37:11,982 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:11,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:11,983 INFO L82 PathProgramCache]: Analyzing trace with hash 5171119, now seen corresponding path program 2 times [2019-12-07 13:37:11,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:37:11,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303497988] [2019-12-07 13:37:11,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:12,020 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:37:12,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303497988] [2019-12-07 13:37:12,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:12,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:37:12,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477805192] [2019-12-07 13:37:12,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:37:12,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:37:12,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:37:12,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:37:12,021 INFO L87 Difference]: Start difference. First operand 1286 states and 3580 transitions. Second operand 3 states. [2019-12-07 13:37:12,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:12,029 INFO L93 Difference]: Finished difference Result 1946 states and 5126 transitions. [2019-12-07 13:37:12,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:37:12,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-12-07 13:37:12,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:12,031 INFO L225 Difference]: With dead ends: 1946 [2019-12-07 13:37:12,031 INFO L226 Difference]: Without dead ends: 700 [2019-12-07 13:37:12,031 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:37:12,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2019-12-07 13:37:12,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2019-12-07 13:37:12,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2019-12-07 13:37:12,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1621 transitions. [2019-12-07 13:37:12,039 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1621 transitions. Word has length 45 [2019-12-07 13:37:12,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:12,039 INFO L462 AbstractCegarLoop]: Abstraction has 700 states and 1621 transitions. [2019-12-07 13:37:12,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:37:12,040 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1621 transitions. [2019-12-07 13:37:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 13:37:12,041 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:12,041 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] [2019-12-07 13:37:12,041 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:12,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:12,041 INFO L82 PathProgramCache]: Analyzing trace with hash 359561549, now seen corresponding path program 3 times [2019-12-07 13:37:12,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:37:12,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491191658] [2019-12-07 13:37:12,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:37:12,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:37:12,112 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:37:12,112 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:37:12,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_70| 0 0))) (and (= v_~x~0_55 0) (= 0 v_~weak$$choice0~0_10) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1016~0.base_32|) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~a~0_52 0) (= 0 v_~y$r_buff1_thd3~0_90) (= |v_#NULL.offset_7| 0) (= |v_#valid_68| (store .cse0 |v_ULTIMATE.start_main_~#t1016~0.base_32| 1)) (= 0 v_~__unbuffered_p2_EAX~0_69) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd0~0_102 0) (= 0 v_~y$w_buff0~0_155) (< 0 |v_#StackHeapBarrier_16|) (= v_~__unbuffered_cnt~0_107 0) (= 0 v_~y$r_buff1_thd2~0_171) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1016~0.base_32|)) (= v_~y$r_buff0_thd1~0_39 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1016~0.base_32| 4)) (= |v_ULTIMATE.start_main_~#t1016~0.offset_22| 0) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~y$r_buff0_thd2~0_208) (= 0 v_~y$flush_delayed~0_44) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$mem_tmp~0_17 0) (= 0 v_~y$r_buff1_thd1~0_40) (= 0 |v_#NULL.base_7|) (= v_~__unbuffered_p2_EBX~0_69 0) (= v_~y$w_buff1~0_114 0) (= v_~y$w_buff1_used~0_265 0) (= v_~y$r_buff0_thd0~0_92 0) (= v_~y~0_129 0) (= v_~y$w_buff0_used~0_415 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1016~0.base_32| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1016~0.base_32|) |v_ULTIMATE.start_main_~#t1016~0.offset_22| 0)) |v_#memory_int_17|) (= 0 v_~y$r_buff0_thd3~0_133) (= 0 v_~__unbuffered_p1_EAX~0_73) (= 0 v_~weak$$choice2~0_85) (= v_~z~0_39 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_17|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1018~0.offset=|v_ULTIMATE.start_main_~#t1018~0.offset_15|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_52, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_90, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_39, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_69, ULTIMATE.start_main_~#t1017~0.base=|v_ULTIMATE.start_main_~#t1017~0.base_33|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_69, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ULTIMATE.start_main_~#t1016~0.base=|v_ULTIMATE.start_main_~#t1016~0.base_32|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_~#t1016~0.offset=|v_ULTIMATE.start_main_~#t1016~0.offset_22|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_55|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_76|, ~y$w_buff1~0=v_~y$w_buff1~0_114, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_208, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_102, ~x~0=v_~x~0_55, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_415, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_155, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_133, ~y~0=v_~y~0_129, ULTIMATE.start_main_~#t1017~0.offset=|v_ULTIMATE.start_main_~#t1017~0.offset_22|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_27|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_121|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_171, ULTIMATE.start_main_~#t1018~0.base=|v_ULTIMATE.start_main_~#t1018~0.base_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_92, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_39, ~weak$$choice2~0=v_~weak$$choice2~0_85, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_265} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, #NULL.offset, ULTIMATE.start_main_~#t1018~0.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1017~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1016~0.base, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1016~0.offset, ULTIMATE.start_main_#t~ite37, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t1017~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1018~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:37:12,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-1-->L822: Formula: (and (= |v_ULTIMATE.start_main_~#t1017~0.offset_9| 0) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1017~0.base_11| 1) |v_#valid_32|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1017~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1017~0.base_11|) |v_ULTIMATE.start_main_~#t1017~0.offset_9| 1))) (not (= |v_ULTIMATE.start_main_~#t1017~0.base_11| 0)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1017~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1017~0.base_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1017~0.base_11| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1017~0.base=|v_ULTIMATE.start_main_~#t1017~0.base_11|, ULTIMATE.start_main_~#t1017~0.offset=|v_ULTIMATE.start_main_~#t1017~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1017~0.base, ULTIMATE.start_main_~#t1017~0.offset] because there is no mapped edge [2019-12-07 13:37:12,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L822-1-->L824: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1018~0.base_10| 0)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1018~0.base_10|) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1018~0.base_10|) 0) (= |v_ULTIMATE.start_main_~#t1018~0.offset_8| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1018~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1018~0.base_10|) |v_ULTIMATE.start_main_~#t1018~0.offset_8| 2)) |v_#memory_int_11|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1018~0.base_10| 1)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1018~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1018~0.offset=|v_ULTIMATE.start_main_~#t1018~0.offset_8|, ULTIMATE.start_main_~#t1018~0.base=|v_ULTIMATE.start_main_~#t1018~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1018~0.offset, ULTIMATE.start_main_~#t1018~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:37:12,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L4-->L797: Formula: (and (= ~y$r_buff0_thd2~0_In2023848383 ~y$r_buff1_thd2~0_Out2023848383) (= ~y$r_buff0_thd3~0_In2023848383 ~y$r_buff1_thd3~0_Out2023848383) (= 1 ~z~0_Out2023848383) (= ~a~0_In2023848383 ~__unbuffered_p2_EBX~0_Out2023848383) (= 1 ~y$r_buff0_thd3~0_Out2023848383) (not (= 0 P2Thread1of1ForFork2___VERIFIER_assert_~expression_In2023848383)) (= ~__unbuffered_p2_EAX~0_Out2023848383 ~z~0_Out2023848383) (= ~y$r_buff1_thd0~0_Out2023848383 ~y$r_buff0_thd0~0_In2023848383) (= ~y$r_buff0_thd1~0_In2023848383 ~y$r_buff1_thd1~0_Out2023848383)) InVars {~a~0=~a~0_In2023848383, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2023848383, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2023848383, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2023848383, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2023848383, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In2023848383} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out2023848383, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In2023848383, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out2023848383, ~a~0=~a~0_In2023848383, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out2023848383, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out2023848383, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out2023848383, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2023848383, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2023848383, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2023848383, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out2023848383, ~z~0=~z~0_Out2023848383, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out2023848383} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 13:37:12,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_24 1) (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_~x~0_27 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~a~0=v_~a~0_24, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, ~x~0=v_~x~0_27, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 13:37:12,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L756-->L756-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-455333889 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out-455333889| ~y$w_buff0~0_In-455333889) (= |P1Thread1of1ForFork1_#t~ite8_In-455333889| |P1Thread1of1ForFork1_#t~ite8_Out-455333889|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-455333889 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-455333889 256)) (and (= (mod ~y$w_buff1_used~0_In-455333889 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In-455333889 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite9_Out-455333889| |P1Thread1of1ForFork1_#t~ite8_Out-455333889|) .cse0 (= ~y$w_buff0~0_In-455333889 |P1Thread1of1ForFork1_#t~ite8_Out-455333889|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-455333889, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-455333889, ~y$w_buff0~0=~y$w_buff0~0_In-455333889, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-455333889, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-455333889|, ~weak$$choice2~0=~weak$$choice2~0_In-455333889, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-455333889} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-455333889, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-455333889, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-455333889|, ~y$w_buff0~0=~y$w_buff0~0_In-455333889, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-455333889, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-455333889|, ~weak$$choice2~0=~weak$$choice2~0_In-455333889, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-455333889} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 13:37:12,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L757-->L757-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-660552030 256) 0))) (or (and (= ~y$w_buff1~0_In-660552030 |P1Thread1of1ForFork1_#t~ite11_Out-660552030|) .cse0 (= |P1Thread1of1ForFork1_#t~ite12_Out-660552030| |P1Thread1of1ForFork1_#t~ite11_Out-660552030|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-660552030 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In-660552030 256) 0) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In-660552030 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-660552030 256) 0)))) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-660552030| ~y$w_buff1~0_In-660552030) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_In-660552030| |P1Thread1of1ForFork1_#t~ite11_Out-660552030|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-660552030, ~y$w_buff1~0=~y$w_buff1~0_In-660552030, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-660552030, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-660552030, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In-660552030|, ~weak$$choice2~0=~weak$$choice2~0_In-660552030, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-660552030} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-660552030, ~y$w_buff1~0=~y$w_buff1~0_In-660552030, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-660552030, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-660552030, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-660552030|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-660552030|, ~weak$$choice2~0=~weak$$choice2~0_In-660552030, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-660552030} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 13:37:12,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L758-->L758-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In121388791 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out121388791| |P1Thread1of1ForFork1_#t~ite14_Out121388791|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In121388791 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In121388791 256)) (and (= (mod ~y$w_buff1_used~0_In121388791 256) 0) .cse0) (and (= 0 (mod ~y$r_buff1_thd2~0_In121388791 256)) .cse0))) .cse1 (= ~y$w_buff0_used~0_In121388791 |P1Thread1of1ForFork1_#t~ite14_Out121388791|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In121388791| |P1Thread1of1ForFork1_#t~ite14_Out121388791|) (= |P1Thread1of1ForFork1_#t~ite15_Out121388791| ~y$w_buff0_used~0_In121388791)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In121388791, ~y$w_buff0_used~0=~y$w_buff0_used~0_In121388791, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In121388791, ~weak$$choice2~0=~weak$$choice2~0_In121388791, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In121388791|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In121388791} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In121388791, ~y$w_buff0_used~0=~y$w_buff0_used~0_In121388791, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In121388791, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out121388791|, ~weak$$choice2~0=~weak$$choice2~0_In121388791, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out121388791|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In121388791} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 13:37:12,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_35 256) 0)) (= v_~y$r_buff0_thd2~0_104 v_~y$r_buff0_thd2~0_103)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_35} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_35} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 13:37:12,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L763-->L771: Formula: (and (= 0 v_~y$flush_delayed~0_14) (= v_~y~0_36 v_~y$mem_tmp~0_7) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (not (= 0 (mod v_~y$flush_delayed~0_15 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, ~y~0=v_~y~0_36, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_17|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 13:37:12,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-2064655552 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2064655552 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite28_Out-2064655552| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite28_Out-2064655552| ~y$w_buff0_used~0_In-2064655552) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2064655552, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2064655552} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2064655552, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2064655552, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-2064655552|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 13:37:12,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1842593775 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-1842593775 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1842593775 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1842593775 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1842593775 |P2Thread1of1ForFork2_#t~ite29_Out-1842593775|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite29_Out-1842593775| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1842593775, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1842593775, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1842593775, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1842593775} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1842593775, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1842593775, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1842593775, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1842593775|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1842593775} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 13:37:12,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L800-->L801: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In62360281 256))) (.cse0 (= ~y$r_buff0_thd3~0_Out62360281 ~y$r_buff0_thd3~0_In62360281)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In62360281 256)))) (or (and .cse0 .cse1) (and (not .cse1) (not .cse2) (= ~y$r_buff0_thd3~0_Out62360281 0)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In62360281, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In62360281} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In62360281, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out62360281|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out62360281} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 13:37:12,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-478312831 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-478312831 256))) (.cse2 (= (mod ~y$r_buff1_thd3~0_In-478312831 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-478312831 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite31_Out-478312831| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite31_Out-478312831| ~y$r_buff1_thd3~0_In-478312831)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-478312831, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-478312831, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-478312831, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-478312831} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-478312831, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-478312831, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-478312831|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-478312831, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-478312831} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 13:37:12,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L801-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_30| v_~y$r_buff1_thd3~0_47) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_47, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 13:37:12,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L824-1-->L830: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_36) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 13:37:12,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L830-2-->L830-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In149875097 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In149875097 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out149875097| ~y$w_buff1~0_In149875097) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite35_Out149875097| ~y~0_In149875097) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In149875097, ~y~0=~y~0_In149875097, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In149875097, ~y$w_buff1_used~0=~y$w_buff1_used~0_In149875097} OutVars{~y$w_buff1~0=~y$w_buff1~0_In149875097, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out149875097|, ~y~0=~y~0_In149875097, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In149875097, ~y$w_buff1_used~0=~y$w_buff1_used~0_In149875097} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 13:37:12,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L830-4-->L831: Formula: (= v_~y~0_23 |v_ULTIMATE.start_main_#t~ite35_11|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~y~0=v_~y~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-07 13:37:12,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1678779163 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1678779163 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite37_Out-1678779163| ~y$w_buff0_used~0_In-1678779163)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite37_Out-1678779163| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1678779163, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1678779163} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1678779163, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1678779163, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1678779163|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 13:37:12,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In318061384 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In318061384 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In318061384 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In318061384 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite38_Out318061384| 0)) (and (= |ULTIMATE.start_main_#t~ite38_Out318061384| ~y$w_buff1_used~0_In318061384) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In318061384, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In318061384, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In318061384, ~y$w_buff1_used~0=~y$w_buff1_used~0_In318061384} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In318061384, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In318061384, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out318061384|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In318061384, ~y$w_buff1_used~0=~y$w_buff1_used~0_In318061384} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 13:37:12,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1170980198 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1170980198 256)))) (or (and (= ~y$r_buff0_thd0~0_In1170980198 |ULTIMATE.start_main_#t~ite39_Out1170980198|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out1170980198|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1170980198, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1170980198} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1170980198, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1170980198|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1170980198} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 13:37:12,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L834-->L834-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In2127513869 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In2127513869 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In2127513869 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In2127513869 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out2127513869|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out2127513869| ~y$r_buff1_thd0~0_In2127513869)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2127513869, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2127513869, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2127513869, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2127513869} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2127513869|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2127513869, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2127513869, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2127513869, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2127513869} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:37:12,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= |v_ULTIMATE.start_main_#t~ite40_43| v_~y$r_buff1_thd0~0_72) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p2_EBX~0_41 0) (= 0 v_~__unbuffered_p1_EAX~0_44) (= 1 v_~__unbuffered_p2_EAX~0_41) (= v_~x~0_34 2))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~x~0=v_~x~0_34} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_42|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~x~0=v_~x~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:37:12,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:37:12 BasicIcfg [2019-12-07 13:37:12,165 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:37:12,166 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:37:12,166 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:37:12,166 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:37:12,166 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:37:03" (3/4) ... [2019-12-07 13:37:12,168 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:37:12,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_70| 0 0))) (and (= v_~x~0_55 0) (= 0 v_~weak$$choice0~0_10) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1016~0.base_32|) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~a~0_52 0) (= 0 v_~y$r_buff1_thd3~0_90) (= |v_#NULL.offset_7| 0) (= |v_#valid_68| (store .cse0 |v_ULTIMATE.start_main_~#t1016~0.base_32| 1)) (= 0 v_~__unbuffered_p2_EAX~0_69) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd0~0_102 0) (= 0 v_~y$w_buff0~0_155) (< 0 |v_#StackHeapBarrier_16|) (= v_~__unbuffered_cnt~0_107 0) (= 0 v_~y$r_buff1_thd2~0_171) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1016~0.base_32|)) (= v_~y$r_buff0_thd1~0_39 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1016~0.base_32| 4)) (= |v_ULTIMATE.start_main_~#t1016~0.offset_22| 0) (= v_~main$tmp_guard0~0_20 0) (= 0 v_~y$r_buff0_thd2~0_208) (= 0 v_~y$flush_delayed~0_44) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$mem_tmp~0_17 0) (= 0 v_~y$r_buff1_thd1~0_40) (= 0 |v_#NULL.base_7|) (= v_~__unbuffered_p2_EBX~0_69 0) (= v_~y$w_buff1~0_114 0) (= v_~y$w_buff1_used~0_265 0) (= v_~y$r_buff0_thd0~0_92 0) (= v_~y~0_129 0) (= v_~y$w_buff0_used~0_415 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1016~0.base_32| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1016~0.base_32|) |v_ULTIMATE.start_main_~#t1016~0.offset_22| 0)) |v_#memory_int_17|) (= 0 v_~y$r_buff0_thd3~0_133) (= 0 v_~__unbuffered_p1_EAX~0_73) (= 0 v_~weak$$choice2~0_85) (= v_~z~0_39 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_17|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1018~0.offset=|v_ULTIMATE.start_main_~#t1018~0.offset_15|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_52, ~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_90, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_39, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_69, ULTIMATE.start_main_~#t1017~0.base=|v_ULTIMATE.start_main_~#t1017~0.base_33|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_69, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ULTIMATE.start_main_~#t1016~0.base=|v_ULTIMATE.start_main_~#t1016~0.base_32|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_~#t1016~0.offset=|v_ULTIMATE.start_main_~#t1016~0.offset_22|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_55|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_76|, ~y$w_buff1~0=v_~y$w_buff1~0_114, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_208, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_102, ~x~0=v_~x~0_55, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_415, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_155, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_133, ~y~0=v_~y~0_129, ULTIMATE.start_main_~#t1017~0.offset=|v_ULTIMATE.start_main_~#t1017~0.offset_22|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_27|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_121|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_171, ULTIMATE.start_main_~#t1018~0.base=|v_ULTIMATE.start_main_~#t1018~0.base_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_92, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_39, ~weak$$choice2~0=v_~weak$$choice2~0_85, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_265} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, #NULL.offset, ULTIMATE.start_main_~#t1018~0.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1017~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1016~0.base, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1016~0.offset, ULTIMATE.start_main_#t~ite37, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t1017~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1018~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:37:12,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L820-1-->L822: Formula: (and (= |v_ULTIMATE.start_main_~#t1017~0.offset_9| 0) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1017~0.base_11| 1) |v_#valid_32|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1017~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1017~0.base_11|) |v_ULTIMATE.start_main_~#t1017~0.offset_9| 1))) (not (= |v_ULTIMATE.start_main_~#t1017~0.base_11| 0)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1017~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1017~0.base_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1017~0.base_11| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1017~0.base=|v_ULTIMATE.start_main_~#t1017~0.base_11|, ULTIMATE.start_main_~#t1017~0.offset=|v_ULTIMATE.start_main_~#t1017~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1017~0.base, ULTIMATE.start_main_~#t1017~0.offset] because there is no mapped edge [2019-12-07 13:37:12,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L822-1-->L824: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1018~0.base_10| 0)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1018~0.base_10|) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1018~0.base_10|) 0) (= |v_ULTIMATE.start_main_~#t1018~0.offset_8| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1018~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1018~0.base_10|) |v_ULTIMATE.start_main_~#t1018~0.offset_8| 2)) |v_#memory_int_11|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1018~0.base_10| 1)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1018~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1018~0.offset=|v_ULTIMATE.start_main_~#t1018~0.offset_8|, ULTIMATE.start_main_~#t1018~0.base=|v_ULTIMATE.start_main_~#t1018~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1018~0.offset, ULTIMATE.start_main_~#t1018~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:37:12,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L4-->L797: Formula: (and (= ~y$r_buff0_thd2~0_In2023848383 ~y$r_buff1_thd2~0_Out2023848383) (= ~y$r_buff0_thd3~0_In2023848383 ~y$r_buff1_thd3~0_Out2023848383) (= 1 ~z~0_Out2023848383) (= ~a~0_In2023848383 ~__unbuffered_p2_EBX~0_Out2023848383) (= 1 ~y$r_buff0_thd3~0_Out2023848383) (not (= 0 P2Thread1of1ForFork2___VERIFIER_assert_~expression_In2023848383)) (= ~__unbuffered_p2_EAX~0_Out2023848383 ~z~0_Out2023848383) (= ~y$r_buff1_thd0~0_Out2023848383 ~y$r_buff0_thd0~0_In2023848383) (= ~y$r_buff0_thd1~0_In2023848383 ~y$r_buff1_thd1~0_Out2023848383)) InVars {~a~0=~a~0_In2023848383, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2023848383, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2023848383, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2023848383, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2023848383, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In2023848383} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out2023848383, P2Thread1of1ForFork2___VERIFIER_assert_~expression=P2Thread1of1ForFork2___VERIFIER_assert_~expression_In2023848383, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out2023848383, ~a~0=~a~0_In2023848383, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out2023848383, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out2023848383, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out2023848383, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2023848383, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2023848383, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2023848383, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out2023848383, ~z~0=~z~0_Out2023848383, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out2023848383} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 13:37:12,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_24 1) (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_P0Thread1of1ForFork0_~arg.base_13 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= v_P0Thread1of1ForFork0_~arg.offset_13 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_~x~0_27 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~a~0=v_~a~0_24, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_13, ~x~0=v_~x~0_27, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_13} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 13:37:12,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L756-->L756-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-455333889 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out-455333889| ~y$w_buff0~0_In-455333889) (= |P1Thread1of1ForFork1_#t~ite8_In-455333889| |P1Thread1of1ForFork1_#t~ite8_Out-455333889|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-455333889 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-455333889 256)) (and (= (mod ~y$w_buff1_used~0_In-455333889 256) 0) .cse1) (and (= 0 (mod ~y$r_buff1_thd2~0_In-455333889 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite9_Out-455333889| |P1Thread1of1ForFork1_#t~ite8_Out-455333889|) .cse0 (= ~y$w_buff0~0_In-455333889 |P1Thread1of1ForFork1_#t~ite8_Out-455333889|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-455333889, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-455333889, ~y$w_buff0~0=~y$w_buff0~0_In-455333889, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-455333889, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-455333889|, ~weak$$choice2~0=~weak$$choice2~0_In-455333889, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-455333889} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-455333889, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-455333889, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-455333889|, ~y$w_buff0~0=~y$w_buff0~0_In-455333889, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-455333889, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-455333889|, ~weak$$choice2~0=~weak$$choice2~0_In-455333889, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-455333889} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 13:37:12,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L757-->L757-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-660552030 256) 0))) (or (and (= ~y$w_buff1~0_In-660552030 |P1Thread1of1ForFork1_#t~ite11_Out-660552030|) .cse0 (= |P1Thread1of1ForFork1_#t~ite12_Out-660552030| |P1Thread1of1ForFork1_#t~ite11_Out-660552030|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-660552030 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In-660552030 256) 0) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In-660552030 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-660552030 256) 0)))) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-660552030| ~y$w_buff1~0_In-660552030) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_In-660552030| |P1Thread1of1ForFork1_#t~ite11_Out-660552030|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-660552030, ~y$w_buff1~0=~y$w_buff1~0_In-660552030, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-660552030, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-660552030, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_In-660552030|, ~weak$$choice2~0=~weak$$choice2~0_In-660552030, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-660552030} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-660552030, ~y$w_buff1~0=~y$w_buff1~0_In-660552030, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-660552030, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-660552030, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-660552030|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-660552030|, ~weak$$choice2~0=~weak$$choice2~0_In-660552030, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-660552030} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 13:37:12,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L758-->L758-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In121388791 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out121388791| |P1Thread1of1ForFork1_#t~ite14_Out121388791|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In121388791 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In121388791 256)) (and (= (mod ~y$w_buff1_used~0_In121388791 256) 0) .cse0) (and (= 0 (mod ~y$r_buff1_thd2~0_In121388791 256)) .cse0))) .cse1 (= ~y$w_buff0_used~0_In121388791 |P1Thread1of1ForFork1_#t~ite14_Out121388791|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In121388791| |P1Thread1of1ForFork1_#t~ite14_Out121388791|) (= |P1Thread1of1ForFork1_#t~ite15_Out121388791| ~y$w_buff0_used~0_In121388791)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In121388791, ~y$w_buff0_used~0=~y$w_buff0_used~0_In121388791, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In121388791, ~weak$$choice2~0=~weak$$choice2~0_In121388791, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In121388791|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In121388791} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In121388791, ~y$w_buff0_used~0=~y$w_buff0_used~0_In121388791, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In121388791, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out121388791|, ~weak$$choice2~0=~weak$$choice2~0_In121388791, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out121388791|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In121388791} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 13:37:12,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_35 256) 0)) (= v_~y$r_buff0_thd2~0_104 v_~y$r_buff0_thd2~0_103)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_35} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_13|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_35} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 13:37:12,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L763-->L771: Formula: (and (= 0 v_~y$flush_delayed~0_14) (= v_~y~0_36 v_~y$mem_tmp~0_7) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (not (= 0 (mod v_~y$flush_delayed~0_15 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, ~y~0=v_~y~0_36, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_17|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 13:37:12,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-2064655552 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2064655552 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite28_Out-2064655552| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite28_Out-2064655552| ~y$w_buff0_used~0_In-2064655552) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2064655552, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2064655552} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2064655552, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2064655552, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out-2064655552|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 13:37:12,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1842593775 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-1842593775 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1842593775 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1842593775 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1842593775 |P2Thread1of1ForFork2_#t~ite29_Out-1842593775|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite29_Out-1842593775| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1842593775, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1842593775, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1842593775, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1842593775} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1842593775, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1842593775, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1842593775, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1842593775|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1842593775} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 13:37:12,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L800-->L801: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In62360281 256))) (.cse0 (= ~y$r_buff0_thd3~0_Out62360281 ~y$r_buff0_thd3~0_In62360281)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In62360281 256)))) (or (and .cse0 .cse1) (and (not .cse1) (not .cse2) (= ~y$r_buff0_thd3~0_Out62360281 0)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In62360281, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In62360281} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In62360281, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out62360281|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out62360281} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 13:37:12,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-478312831 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-478312831 256))) (.cse2 (= (mod ~y$r_buff1_thd3~0_In-478312831 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-478312831 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite31_Out-478312831| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite31_Out-478312831| ~y$r_buff1_thd3~0_In-478312831)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-478312831, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-478312831, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-478312831, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-478312831} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-478312831, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-478312831, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-478312831|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-478312831, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-478312831} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 13:37:12,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L801-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_30| v_~y$r_buff1_thd3~0_47) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_47, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 13:37:12,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L824-1-->L830: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_36) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 13:37:12,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L830-2-->L830-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In149875097 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In149875097 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out149875097| ~y$w_buff1~0_In149875097) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite35_Out149875097| ~y~0_In149875097) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In149875097, ~y~0=~y~0_In149875097, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In149875097, ~y$w_buff1_used~0=~y$w_buff1_used~0_In149875097} OutVars{~y$w_buff1~0=~y$w_buff1~0_In149875097, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out149875097|, ~y~0=~y~0_In149875097, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In149875097, ~y$w_buff1_used~0=~y$w_buff1_used~0_In149875097} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 13:37:12,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L830-4-->L831: Formula: (= v_~y~0_23 |v_ULTIMATE.start_main_#t~ite35_11|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~y~0=v_~y~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-07 13:37:12,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L831-->L831-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1678779163 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1678779163 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite37_Out-1678779163| ~y$w_buff0_used~0_In-1678779163)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite37_Out-1678779163| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1678779163, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1678779163} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1678779163, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1678779163, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1678779163|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 13:37:12,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In318061384 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In318061384 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In318061384 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In318061384 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite38_Out318061384| 0)) (and (= |ULTIMATE.start_main_#t~ite38_Out318061384| ~y$w_buff1_used~0_In318061384) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In318061384, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In318061384, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In318061384, ~y$w_buff1_used~0=~y$w_buff1_used~0_In318061384} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In318061384, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In318061384, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out318061384|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In318061384, ~y$w_buff1_used~0=~y$w_buff1_used~0_In318061384} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 13:37:12,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1170980198 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1170980198 256)))) (or (and (= ~y$r_buff0_thd0~0_In1170980198 |ULTIMATE.start_main_#t~ite39_Out1170980198|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out1170980198|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1170980198, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1170980198} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1170980198, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1170980198|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1170980198} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 13:37:12,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L834-->L834-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In2127513869 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In2127513869 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In2127513869 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In2127513869 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite40_Out2127513869|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out2127513869| ~y$r_buff1_thd0~0_In2127513869)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2127513869, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2127513869, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2127513869, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2127513869} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2127513869|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2127513869, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2127513869, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2127513869, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2127513869} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:37:12,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= |v_ULTIMATE.start_main_#t~ite40_43| v_~y$r_buff1_thd0~0_72) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p2_EBX~0_41 0) (= 0 v_~__unbuffered_p1_EAX~0_44) (= 1 v_~__unbuffered_p2_EAX~0_41) (= v_~x~0_34 2))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~x~0=v_~x~0_34} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_41, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_42|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~x~0=v_~x~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:37:12,224 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_362ac244-5eee-4954-989f-f18519314773/bin/uautomizer/witness.graphml [2019-12-07 13:37:12,224 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:37:12,225 INFO L168 Benchmark]: Toolchain (without parser) took 9879.91 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 805.3 MB). Free memory was 942.5 MB in the beginning and 1.3 GB in the end (delta: -313.6 MB). Peak memory consumption was 491.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:37:12,226 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:37:12,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -114.9 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:37:12,226 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:37:12,226 INFO L168 Benchmark]: Boogie Preprocessor took 24.46 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:37:12,227 INFO L168 Benchmark]: RCFGBuilder took 377.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:37:12,227 INFO L168 Benchmark]: TraceAbstraction took 8972.44 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 714.6 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -275.3 MB). Peak memory consumption was 439.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:37:12,227 INFO L168 Benchmark]: Witness Printer took 58.55 ms. Allocated memory is still 1.8 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:37:12,229 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 406.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -114.9 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.46 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 377.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8972.44 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 714.6 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -275.3 MB). Peak memory consumption was 439.3 MB. Max. memory is 11.5 GB. * Witness Printer took 58.55 ms. Allocated memory is still 1.8 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.6s, 153 ProgramPointsBefore, 73 ProgramPointsAfterwards, 178 TransitionsBefore, 80 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 22 ChoiceCompositions, 4873 VarBasedMoverChecksPositive, 141 VarBasedMoverChecksNegative, 15 SemBasedMoverChecksPositive, 158 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.5s, 0 MoverChecksTotal, 41572 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t1016, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t1017, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L824] FCALL, FORK 0 pthread_create(&t1018, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 1 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 x = 2 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L798] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L799] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L830] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L832] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L833] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.8s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1580 SDtfs, 1651 SDslu, 2420 SDs, 0 SdLazy, 1070 SolverSat, 117 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24859occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 15470 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 335 NumberOfCodeBlocks, 335 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 34668 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...