./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix053_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_6350feae-a99f-453a-ab39-04931e5d81c2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6350feae-a99f-453a-ab39-04931e5d81c2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6350feae-a99f-453a-ab39-04931e5d81c2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6350feae-a99f-453a-ab39-04931e5d81c2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix053_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6350feae-a99f-453a-ab39-04931e5d81c2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6350feae-a99f-453a-ab39-04931e5d81c2/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 a28b0582d9f4a87114413f4166394f28b5d6bff4 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:07:41,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:07:41,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:07:41,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:07:41,286 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:07:41,287 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:07:41,288 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:07:41,289 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:07:41,291 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:07:41,291 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:07:41,292 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:07:41,293 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:07:41,293 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:07:41,293 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:07:41,294 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:07:41,295 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:07:41,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:07:41,297 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:07:41,298 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:07:41,299 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:07:41,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:07:41,301 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:07:41,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:07:41,302 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:07:41,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:07:41,304 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:07:41,304 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:07:41,304 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:07:41,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:07:41,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:07:41,305 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:07:41,306 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:07:41,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:07:41,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:07:41,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:07:41,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:07:41,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:07:41,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:07:41,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:07:41,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:07:41,309 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:07:41,309 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6350feae-a99f-453a-ab39-04931e5d81c2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:07:41,320 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:07:41,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:07:41,321 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:07:41,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:07:41,322 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:07:41,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:07:41,322 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:07:41,322 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:07:41,322 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:07:41,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:07:41,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:07:41,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:07:41,323 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:07:41,323 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:07:41,324 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:07:41,324 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:07:41,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:07:41,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:07:41,325 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:07:41,325 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:07:41,325 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:07:41,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:07:41,325 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:07:41,326 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:07:41,326 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:07:41,326 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:07:41,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:07:41,326 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:07:41,326 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:07:41,327 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_6350feae-a99f-453a-ab39-04931e5d81c2/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 -> a28b0582d9f4a87114413f4166394f28b5d6bff4 [2019-12-07 10:07:41,425 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:07:41,434 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:07:41,436 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:07:41,437 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:07:41,437 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:07:41,437 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6350feae-a99f-453a-ab39-04931e5d81c2/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix053_rmo.opt.i [2019-12-07 10:07:41,475 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6350feae-a99f-453a-ab39-04931e5d81c2/bin/uautomizer/data/f391159ae/032c46d94cf349a6a16191799733cc3c/FLAG64f6eb67d [2019-12-07 10:07:41,834 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:07:41,834 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6350feae-a99f-453a-ab39-04931e5d81c2/sv-benchmarks/c/pthread-wmm/mix053_rmo.opt.i [2019-12-07 10:07:41,845 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6350feae-a99f-453a-ab39-04931e5d81c2/bin/uautomizer/data/f391159ae/032c46d94cf349a6a16191799733cc3c/FLAG64f6eb67d [2019-12-07 10:07:41,853 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6350feae-a99f-453a-ab39-04931e5d81c2/bin/uautomizer/data/f391159ae/032c46d94cf349a6a16191799733cc3c [2019-12-07 10:07:41,855 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:07:41,856 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:07:41,857 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:41,857 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:07:41,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:07:41,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:41" (1/1) ... [2019-12-07 10:07:41,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:41, skipping insertion in model container [2019-12-07 10:07:41,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:41" (1/1) ... [2019-12-07 10:07:41,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:07:41,902 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:07:42,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:42,171 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:07:42,214 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:42,261 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:07:42,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:42 WrapperNode [2019-12-07 10:07:42,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:42,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:42,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:07:42,263 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:07:42,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:42" (1/1) ... [2019-12-07 10:07:42,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:42" (1/1) ... [2019-12-07 10:07:42,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:42,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:07:42,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:07:42,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:07:42,311 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:42" (1/1) ... [2019-12-07 10:07:42,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:42" (1/1) ... [2019-12-07 10:07:42,315 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:42" (1/1) ... [2019-12-07 10:07:42,315 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:42" (1/1) ... [2019-12-07 10:07:42,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:42" (1/1) ... [2019-12-07 10:07:42,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:42" (1/1) ... [2019-12-07 10:07:42,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:42" (1/1) ... [2019-12-07 10:07:42,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:07:42,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:07:42,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:07:42,332 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:07:42,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6350feae-a99f-453a-ab39-04931e5d81c2/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 10:07:42,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:07:42,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:07:42,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:07:42,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:07:42,380 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:07:42,380 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:07:42,380 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:07:42,380 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:07:42,380 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 10:07:42,380 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 10:07:42,380 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 10:07:42,380 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 10:07:42,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:07:42,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:07:42,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:07:42,382 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 10:07:42,736 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:07:42,736 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:07:42,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:42 BoogieIcfgContainer [2019-12-07 10:07:42,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:07:42,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:07:42,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:07:42,739 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:07:42,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:07:41" (1/3) ... [2019-12-07 10:07:42,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d08c15f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:42, skipping insertion in model container [2019-12-07 10:07:42,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:42" (2/3) ... [2019-12-07 10:07:42,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d08c15f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:42, skipping insertion in model container [2019-12-07 10:07:42,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:42" (3/3) ... [2019-12-07 10:07:42,741 INFO L109 eAbstractionObserver]: Analyzing ICFG mix053_rmo.opt.i [2019-12-07 10:07:42,747 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:07:42,747 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:07:42,752 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:07:42,753 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:07:42,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,776 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,776 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,777 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,777 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,778 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,778 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,789 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,789 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,789 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,789 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,790 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,790 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,790 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,791 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,791 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,791 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,791 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,791 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,791 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,791 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,791 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,791 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,793 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,793 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:42,804 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 10:07:42,817 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:07:42,817 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:07:42,817 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:07:42,817 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:07:42,817 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:07:42,817 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:07:42,817 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:07:42,817 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:07:42,829 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 189 transitions [2019-12-07 10:07:42,830 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 167 places, 189 transitions [2019-12-07 10:07:42,880 INFO L134 PetriNetUnfolder]: 35/185 cut-off events. [2019-12-07 10:07:42,881 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:07:42,890 INFO L76 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 185 events. 35/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 568 event pairs. 12/160 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 10:07:42,904 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 167 places, 189 transitions [2019-12-07 10:07:42,933 INFO L134 PetriNetUnfolder]: 35/185 cut-off events. [2019-12-07 10:07:42,933 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:07:42,937 INFO L76 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 185 events. 35/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 568 event pairs. 12/160 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 10:07:42,948 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-07 10:07:42,949 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:07:45,758 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-12-07 10:07:46,085 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-07 10:07:46,173 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48182 [2019-12-07 10:07:46,174 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2019-12-07 10:07:46,176 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 86 transitions [2019-12-07 10:07:47,487 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25454 states. [2019-12-07 10:07:47,489 INFO L276 IsEmpty]: Start isEmpty. Operand 25454 states. [2019-12-07 10:07:47,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 10:07:47,495 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:47,495 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:47,495 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:47,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:47,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1973922445, now seen corresponding path program 1 times [2019-12-07 10:07:47,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:47,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503654694] [2019-12-07 10:07:47,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:47,658 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 10:07:47,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503654694] [2019-12-07 10:07:47,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:47,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:07:47,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816171426] [2019-12-07 10:07:47,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:47,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:47,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:47,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:47,674 INFO L87 Difference]: Start difference. First operand 25454 states. Second operand 3 states. [2019-12-07 10:07:48,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:48,006 INFO L93 Difference]: Finished difference Result 24966 states and 109408 transitions. [2019-12-07 10:07:48,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:48,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 10:07:48,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:48,166 INFO L225 Difference]: With dead ends: 24966 [2019-12-07 10:07:48,166 INFO L226 Difference]: Without dead ends: 23406 [2019-12-07 10:07:48,167 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 10:07:48,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23406 states. [2019-12-07 10:07:48,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23406 to 23406. [2019-12-07 10:07:48,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23406 states. [2019-12-07 10:07:48,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23406 states to 23406 states and 102424 transitions. [2019-12-07 10:07:48,998 INFO L78 Accepts]: Start accepts. Automaton has 23406 states and 102424 transitions. Word has length 9 [2019-12-07 10:07:48,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:48,999 INFO L462 AbstractCegarLoop]: Abstraction has 23406 states and 102424 transitions. [2019-12-07 10:07:48,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:48,999 INFO L276 IsEmpty]: Start isEmpty. Operand 23406 states and 102424 transitions. [2019-12-07 10:07:49,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 10:07:49,004 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:49,004 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:49,005 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:49,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:49,005 INFO L82 PathProgramCache]: Analyzing trace with hash 918860120, now seen corresponding path program 1 times [2019-12-07 10:07:49,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:49,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406947779] [2019-12-07 10:07:49,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:49,062 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 10:07:49,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406947779] [2019-12-07 10:07:49,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:49,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:07:49,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485363800] [2019-12-07 10:07:49,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:49,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:49,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:49,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:49,064 INFO L87 Difference]: Start difference. First operand 23406 states and 102424 transitions. Second operand 4 states. [2019-12-07 10:07:49,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:49,372 INFO L93 Difference]: Finished difference Result 36358 states and 153628 transitions. [2019-12-07 10:07:49,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:07:49,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 10:07:49,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:49,534 INFO L225 Difference]: With dead ends: 36358 [2019-12-07 10:07:49,535 INFO L226 Difference]: Without dead ends: 36298 [2019-12-07 10:07:49,535 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 10:07:49,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36298 states. [2019-12-07 10:07:50,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36298 to 32658. [2019-12-07 10:07:50,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32658 states. [2019-12-07 10:07:50,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32658 states to 32658 states and 139904 transitions. [2019-12-07 10:07:50,444 INFO L78 Accepts]: Start accepts. Automaton has 32658 states and 139904 transitions. Word has length 15 [2019-12-07 10:07:50,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:50,444 INFO L462 AbstractCegarLoop]: Abstraction has 32658 states and 139904 transitions. [2019-12-07 10:07:50,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:50,444 INFO L276 IsEmpty]: Start isEmpty. Operand 32658 states and 139904 transitions. [2019-12-07 10:07:50,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:07:50,449 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:50,450 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 10:07:50,450 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:50,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:50,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1944850996, now seen corresponding path program 1 times [2019-12-07 10:07:50,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:50,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075135136] [2019-12-07 10:07:50,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:50,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:07:50,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075135136] [2019-12-07 10:07:50,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:50,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:50,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083529181] [2019-12-07 10:07:50,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:50,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:50,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:50,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:50,487 INFO L87 Difference]: Start difference. First operand 32658 states and 139904 transitions. Second operand 3 states. [2019-12-07 10:07:50,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:50,825 INFO L93 Difference]: Finished difference Result 43534 states and 182660 transitions. [2019-12-07 10:07:50,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:50,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 10:07:50,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:50,923 INFO L225 Difference]: With dead ends: 43534 [2019-12-07 10:07:50,923 INFO L226 Difference]: Without dead ends: 43534 [2019-12-07 10:07:50,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:51,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43534 states. [2019-12-07 10:07:51,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43534 to 36962. [2019-12-07 10:07:51,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36962 states. [2019-12-07 10:07:51,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36962 states to 36962 states and 157208 transitions. [2019-12-07 10:07:51,902 INFO L78 Accepts]: Start accepts. Automaton has 36962 states and 157208 transitions. Word has length 18 [2019-12-07 10:07:51,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:51,902 INFO L462 AbstractCegarLoop]: Abstraction has 36962 states and 157208 transitions. [2019-12-07 10:07:51,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:51,902 INFO L276 IsEmpty]: Start isEmpty. Operand 36962 states and 157208 transitions. [2019-12-07 10:07:51,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:07:51,908 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:51,908 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 10:07:51,908 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:51,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:51,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1944972733, now seen corresponding path program 1 times [2019-12-07 10:07:51,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:51,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760789730] [2019-12-07 10:07:51,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:51,961 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 10:07:51,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760789730] [2019-12-07 10:07:51,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:51,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:07:51,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531006158] [2019-12-07 10:07:51,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:51,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:51,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:51,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:51,962 INFO L87 Difference]: Start difference. First operand 36962 states and 157208 transitions. Second operand 4 states. [2019-12-07 10:07:52,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:52,222 INFO L93 Difference]: Finished difference Result 44442 states and 186032 transitions. [2019-12-07 10:07:52,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:07:52,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 10:07:52,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:52,319 INFO L225 Difference]: With dead ends: 44442 [2019-12-07 10:07:52,320 INFO L226 Difference]: Without dead ends: 44402 [2019-12-07 10:07:52,320 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 10:07:52,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44402 states. [2019-12-07 10:07:53,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44402 to 38806. [2019-12-07 10:07:53,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38806 states. [2019-12-07 10:07:53,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38806 states to 38806 states and 164516 transitions. [2019-12-07 10:07:53,267 INFO L78 Accepts]: Start accepts. Automaton has 38806 states and 164516 transitions. Word has length 18 [2019-12-07 10:07:53,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:53,268 INFO L462 AbstractCegarLoop]: Abstraction has 38806 states and 164516 transitions. [2019-12-07 10:07:53,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:53,268 INFO L276 IsEmpty]: Start isEmpty. Operand 38806 states and 164516 transitions. [2019-12-07 10:07:53,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:07:53,273 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:53,273 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 10:07:53,273 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:53,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:53,273 INFO L82 PathProgramCache]: Analyzing trace with hash -760266034, now seen corresponding path program 1 times [2019-12-07 10:07:53,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:53,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675164620] [2019-12-07 10:07:53,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:53,315 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 10:07:53,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675164620] [2019-12-07 10:07:53,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:53,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:07:53,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102552024] [2019-12-07 10:07:53,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:53,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:53,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:53,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:53,317 INFO L87 Difference]: Start difference. First operand 38806 states and 164516 transitions. Second operand 4 states. [2019-12-07 10:07:53,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:53,639 INFO L93 Difference]: Finished difference Result 49014 states and 205764 transitions. [2019-12-07 10:07:53,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:07:53,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 10:07:53,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:53,750 INFO L225 Difference]: With dead ends: 49014 [2019-12-07 10:07:53,750 INFO L226 Difference]: Without dead ends: 48954 [2019-12-07 10:07:53,750 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 10:07:53,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48954 states. [2019-12-07 10:07:54,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48954 to 40442. [2019-12-07 10:07:54,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40442 states. [2019-12-07 10:07:54,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40442 states to 40442 states and 171796 transitions. [2019-12-07 10:07:54,739 INFO L78 Accepts]: Start accepts. Automaton has 40442 states and 171796 transitions. Word has length 18 [2019-12-07 10:07:54,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:54,740 INFO L462 AbstractCegarLoop]: Abstraction has 40442 states and 171796 transitions. [2019-12-07 10:07:54,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:54,740 INFO L276 IsEmpty]: Start isEmpty. Operand 40442 states and 171796 transitions. [2019-12-07 10:07:54,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 10:07:54,748 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:54,748 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 10:07:54,748 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:54,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:54,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1833759190, now seen corresponding path program 1 times [2019-12-07 10:07:54,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:54,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656278433] [2019-12-07 10:07:54,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:54,785 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 10:07:54,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656278433] [2019-12-07 10:07:54,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:54,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:07:54,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003165893] [2019-12-07 10:07:54,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:54,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:54,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:54,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:54,787 INFO L87 Difference]: Start difference. First operand 40442 states and 171796 transitions. Second operand 3 states. [2019-12-07 10:07:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:54,947 INFO L93 Difference]: Finished difference Result 39618 states and 167455 transitions. [2019-12-07 10:07:54,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:54,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 10:07:54,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:55,038 INFO L225 Difference]: With dead ends: 39618 [2019-12-07 10:07:55,038 INFO L226 Difference]: Without dead ends: 39618 [2019-12-07 10:07:55,038 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 10:07:55,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39618 states. [2019-12-07 10:07:55,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39618 to 39618. [2019-12-07 10:07:55,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39618 states. [2019-12-07 10:07:56,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39618 states to 39618 states and 167455 transitions. [2019-12-07 10:07:56,020 INFO L78 Accepts]: Start accepts. Automaton has 39618 states and 167455 transitions. Word has length 20 [2019-12-07 10:07:56,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:56,021 INFO L462 AbstractCegarLoop]: Abstraction has 39618 states and 167455 transitions. [2019-12-07 10:07:56,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:56,021 INFO L276 IsEmpty]: Start isEmpty. Operand 39618 states and 167455 transitions. [2019-12-07 10:07:56,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 10:07:56,029 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:56,029 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:56,030 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:56,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:56,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1288847523, now seen corresponding path program 1 times [2019-12-07 10:07:56,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:56,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81590590] [2019-12-07 10:07:56,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:56,072 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 10:07:56,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81590590] [2019-12-07 10:07:56,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:56,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:07:56,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416142449] [2019-12-07 10:07:56,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:56,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:56,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:56,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:56,073 INFO L87 Difference]: Start difference. First operand 39618 states and 167455 transitions. Second operand 3 states. [2019-12-07 10:07:56,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:56,250 INFO L93 Difference]: Finished difference Result 48903 states and 195952 transitions. [2019-12-07 10:07:56,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:56,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 10:07:56,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:56,336 INFO L225 Difference]: With dead ends: 48903 [2019-12-07 10:07:56,336 INFO L226 Difference]: Without dead ends: 40200 [2019-12-07 10:07:56,337 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 10:07:56,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40200 states. [2019-12-07 10:07:57,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40200 to 39326. [2019-12-07 10:07:57,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39326 states. [2019-12-07 10:07:57,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39326 states to 39326 states and 156524 transitions. [2019-12-07 10:07:57,105 INFO L78 Accepts]: Start accepts. Automaton has 39326 states and 156524 transitions. Word has length 21 [2019-12-07 10:07:57,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:57,106 INFO L462 AbstractCegarLoop]: Abstraction has 39326 states and 156524 transitions. [2019-12-07 10:07:57,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:57,106 INFO L276 IsEmpty]: Start isEmpty. Operand 39326 states and 156524 transitions. [2019-12-07 10:07:57,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 10:07:57,115 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:57,116 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:57,116 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:57,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:57,116 INFO L82 PathProgramCache]: Analyzing trace with hash 972729520, now seen corresponding path program 1 times [2019-12-07 10:07:57,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:57,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207918098] [2019-12-07 10:07:57,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:57,146 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 10:07:57,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207918098] [2019-12-07 10:07:57,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:57,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:07:57,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221063627] [2019-12-07 10:07:57,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:57,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:57,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:57,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:57,147 INFO L87 Difference]: Start difference. First operand 39326 states and 156524 transitions. Second operand 3 states. [2019-12-07 10:07:57,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:57,354 INFO L93 Difference]: Finished difference Result 57830 states and 216921 transitions. [2019-12-07 10:07:57,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:57,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 10:07:57,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:57,393 INFO L225 Difference]: With dead ends: 57830 [2019-12-07 10:07:57,393 INFO L226 Difference]: Without dead ends: 24006 [2019-12-07 10:07:57,394 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 10:07:57,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24006 states. [2019-12-07 10:07:57,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24006 to 22876. [2019-12-07 10:07:57,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22876 states. [2019-12-07 10:07:57,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22876 states to 22876 states and 76170 transitions. [2019-12-07 10:07:57,896 INFO L78 Accepts]: Start accepts. Automaton has 22876 states and 76170 transitions. Word has length 21 [2019-12-07 10:07:57,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:57,896 INFO L462 AbstractCegarLoop]: Abstraction has 22876 states and 76170 transitions. [2019-12-07 10:07:57,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:57,896 INFO L276 IsEmpty]: Start isEmpty. Operand 22876 states and 76170 transitions. [2019-12-07 10:07:57,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:07:57,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:57,902 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:57,903 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:57,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:57,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1197262150, now seen corresponding path program 1 times [2019-12-07 10:07:57,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:57,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119362153] [2019-12-07 10:07:57,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:57,939 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 10:07:57,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119362153] [2019-12-07 10:07:57,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:57,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:07:57,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924766494] [2019-12-07 10:07:57,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:57,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:57,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:57,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:57,940 INFO L87 Difference]: Start difference. First operand 22876 states and 76170 transitions. Second operand 3 states. [2019-12-07 10:07:58,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:58,005 INFO L93 Difference]: Finished difference Result 22876 states and 75156 transitions. [2019-12-07 10:07:58,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:58,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 10:07:58,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:58,038 INFO L225 Difference]: With dead ends: 22876 [2019-12-07 10:07:58,038 INFO L226 Difference]: Without dead ends: 22876 [2019-12-07 10:07:58,038 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 10:07:58,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22876 states. [2019-12-07 10:07:58,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22876 to 22392. [2019-12-07 10:07:58,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22392 states. [2019-12-07 10:07:58,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22392 states to 22392 states and 73748 transitions. [2019-12-07 10:07:58,390 INFO L78 Accepts]: Start accepts. Automaton has 22392 states and 73748 transitions. Word has length 22 [2019-12-07 10:07:58,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:58,390 INFO L462 AbstractCegarLoop]: Abstraction has 22392 states and 73748 transitions. [2019-12-07 10:07:58,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:58,390 INFO L276 IsEmpty]: Start isEmpty. Operand 22392 states and 73748 transitions. [2019-12-07 10:07:58,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:07:58,396 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:58,396 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:58,396 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:58,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:58,396 INFO L82 PathProgramCache]: Analyzing trace with hash 907111406, now seen corresponding path program 1 times [2019-12-07 10:07:58,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:58,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448240978] [2019-12-07 10:07:58,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:58,428 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 10:07:58,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448240978] [2019-12-07 10:07:58,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:58,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:58,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592437719] [2019-12-07 10:07:58,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:07:58,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:58,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:07:58,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:07:58,429 INFO L87 Difference]: Start difference. First operand 22392 states and 73748 transitions. Second operand 4 states. [2019-12-07 10:07:58,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:58,476 INFO L93 Difference]: Finished difference Result 12259 states and 37781 transitions. [2019-12-07 10:07:58,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:07:58,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 10:07:58,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:58,489 INFO L225 Difference]: With dead ends: 12259 [2019-12-07 10:07:58,489 INFO L226 Difference]: Without dead ends: 12259 [2019-12-07 10:07:58,490 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 10:07:58,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12259 states. [2019-12-07 10:07:58,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12259 to 12259. [2019-12-07 10:07:58,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12259 states. [2019-12-07 10:07:58,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12259 states to 12259 states and 37781 transitions. [2019-12-07 10:07:58,656 INFO L78 Accepts]: Start accepts. Automaton has 12259 states and 37781 transitions. Word has length 22 [2019-12-07 10:07:58,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:58,656 INFO L462 AbstractCegarLoop]: Abstraction has 12259 states and 37781 transitions. [2019-12-07 10:07:58,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:07:58,656 INFO L276 IsEmpty]: Start isEmpty. Operand 12259 states and 37781 transitions. [2019-12-07 10:07:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 10:07:58,660 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:58,660 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:58,660 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:58,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:58,660 INFO L82 PathProgramCache]: Analyzing trace with hash -2030767179, now seen corresponding path program 1 times [2019-12-07 10:07:58,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:58,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146555525] [2019-12-07 10:07:58,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:58,697 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 10:07:58,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146555525] [2019-12-07 10:07:58,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:58,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:07:58,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569936381] [2019-12-07 10:07:58,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:07:58,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:58,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:07:58,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:58,698 INFO L87 Difference]: Start difference. First operand 12259 states and 37781 transitions. Second operand 5 states. [2019-12-07 10:07:58,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:58,731 INFO L93 Difference]: Finished difference Result 2608 states and 6380 transitions. [2019-12-07 10:07:58,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:07:58,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-07 10:07:58,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:58,735 INFO L225 Difference]: With dead ends: 2608 [2019-12-07 10:07:58,735 INFO L226 Difference]: Without dead ends: 2608 [2019-12-07 10:07:58,735 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 10:07:58,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2608 states. [2019-12-07 10:07:58,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2608 to 2608. [2019-12-07 10:07:58,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2608 states. [2019-12-07 10:07:58,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 6380 transitions. [2019-12-07 10:07:58,762 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 6380 transitions. Word has length 23 [2019-12-07 10:07:58,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:58,762 INFO L462 AbstractCegarLoop]: Abstraction has 2608 states and 6380 transitions. [2019-12-07 10:07:58,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:07:58,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 6380 transitions. [2019-12-07 10:07:58,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 10:07:58,764 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:58,764 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:58,765 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:58,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:58,765 INFO L82 PathProgramCache]: Analyzing trace with hash 882681234, now seen corresponding path program 1 times [2019-12-07 10:07:58,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:58,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192188219] [2019-12-07 10:07:58,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:58,804 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 10:07:58,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192188219] [2019-12-07 10:07:58,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:58,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:58,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801498413] [2019-12-07 10:07:58,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:07:58,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:58,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:07:58,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:58,805 INFO L87 Difference]: Start difference. First operand 2608 states and 6380 transitions. Second operand 5 states. [2019-12-07 10:07:58,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:58,913 INFO L93 Difference]: Finished difference Result 3519 states and 8419 transitions. [2019-12-07 10:07:58,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:07:58,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-07 10:07:58,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:58,916 INFO L225 Difference]: With dead ends: 3519 [2019-12-07 10:07:58,916 INFO L226 Difference]: Without dead ends: 3327 [2019-12-07 10:07:58,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:07:58,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3327 states. [2019-12-07 10:07:58,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3327 to 2676. [2019-12-07 10:07:58,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2676 states. [2019-12-07 10:07:58,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2676 states to 2676 states and 6466 transitions. [2019-12-07 10:07:58,943 INFO L78 Accepts]: Start accepts. Automaton has 2676 states and 6466 transitions. Word has length 32 [2019-12-07 10:07:58,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:58,943 INFO L462 AbstractCegarLoop]: Abstraction has 2676 states and 6466 transitions. [2019-12-07 10:07:58,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:07:58,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2676 states and 6466 transitions. [2019-12-07 10:07:58,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 10:07:58,945 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:58,945 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:58,946 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:58,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:58,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1233303667, now seen corresponding path program 1 times [2019-12-07 10:07:58,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:58,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207138675] [2019-12-07 10:07:58,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:58,965 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 10:07:58,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207138675] [2019-12-07 10:07:58,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:58,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:58,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814381910] [2019-12-07 10:07:58,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:07:58,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:58,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:07:58,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:58,967 INFO L87 Difference]: Start difference. First operand 2676 states and 6466 transitions. Second operand 3 states. [2019-12-07 10:07:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:58,992 INFO L93 Difference]: Finished difference Result 3068 states and 7038 transitions. [2019-12-07 10:07:58,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:07:58,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 10:07:58,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:58,995 INFO L225 Difference]: With dead ends: 3068 [2019-12-07 10:07:58,995 INFO L226 Difference]: Without dead ends: 3068 [2019-12-07 10:07:58,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:07:59,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2019-12-07 10:07:59,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 2596. [2019-12-07 10:07:59,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2596 states. [2019-12-07 10:07:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2596 states to 2596 states and 5936 transitions. [2019-12-07 10:07:59,020 INFO L78 Accepts]: Start accepts. Automaton has 2596 states and 5936 transitions. Word has length 32 [2019-12-07 10:07:59,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:59,020 INFO L462 AbstractCegarLoop]: Abstraction has 2596 states and 5936 transitions. [2019-12-07 10:07:59,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:07:59,020 INFO L276 IsEmpty]: Start isEmpty. Operand 2596 states and 5936 transitions. [2019-12-07 10:07:59,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:07:59,022 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:59,022 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:59,022 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:59,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:59,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1540331556, now seen corresponding path program 1 times [2019-12-07 10:07:59,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:59,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303421998] [2019-12-07 10:07:59,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:59,058 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 10:07:59,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303421998] [2019-12-07 10:07:59,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:59,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:07:59,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888632326] [2019-12-07 10:07:59,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:07:59,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:59,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:07:59,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:07:59,059 INFO L87 Difference]: Start difference. First operand 2596 states and 5936 transitions. Second operand 5 states. [2019-12-07 10:07:59,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:59,189 INFO L93 Difference]: Finished difference Result 3109 states and 7068 transitions. [2019-12-07 10:07:59,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:07:59,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 10:07:59,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:59,192 INFO L225 Difference]: With dead ends: 3109 [2019-12-07 10:07:59,192 INFO L226 Difference]: Without dead ends: 2864 [2019-12-07 10:07:59,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:07:59,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2019-12-07 10:07:59,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 2252. [2019-12-07 10:07:59,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2252 states. [2019-12-07 10:07:59,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 5014 transitions. [2019-12-07 10:07:59,212 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 5014 transitions. Word has length 33 [2019-12-07 10:07:59,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:59,212 INFO L462 AbstractCegarLoop]: Abstraction has 2252 states and 5014 transitions. [2019-12-07 10:07:59,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:07:59,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 5014 transitions. [2019-12-07 10:07:59,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:07:59,214 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:59,214 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:59,214 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:59,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:59,214 INFO L82 PathProgramCache]: Analyzing trace with hash -741863528, now seen corresponding path program 1 times [2019-12-07 10:07:59,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:59,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863925962] [2019-12-07 10:07:59,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:59,396 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 10:07:59,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863925962] [2019-12-07 10:07:59,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:59,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:07:59,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418138526] [2019-12-07 10:07:59,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:07:59,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:59,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:07:59,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:07:59,397 INFO L87 Difference]: Start difference. First operand 2252 states and 5014 transitions. Second operand 8 states. [2019-12-07 10:07:59,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:59,963 INFO L93 Difference]: Finished difference Result 4093 states and 9119 transitions. [2019-12-07 10:07:59,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 10:07:59,963 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-07 10:07:59,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:59,965 INFO L225 Difference]: With dead ends: 4093 [2019-12-07 10:07:59,966 INFO L226 Difference]: Without dead ends: 3489 [2019-12-07 10:07:59,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:07:59,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3489 states. [2019-12-07 10:07:59,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3489 to 3189. [2019-12-07 10:07:59,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2019-12-07 10:07:59,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 7046 transitions. [2019-12-07 10:07:59,992 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 7046 transitions. Word has length 34 [2019-12-07 10:07:59,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:59,992 INFO L462 AbstractCegarLoop]: Abstraction has 3189 states and 7046 transitions. [2019-12-07 10:07:59,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:07:59,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 7046 transitions. [2019-12-07 10:07:59,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:07:59,995 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:59,995 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:59,995 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:59,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:59,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1411804038, now seen corresponding path program 2 times [2019-12-07 10:07:59,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:59,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224679367] [2019-12-07 10:07:59,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:00,154 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 10:08:00,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224679367] [2019-12-07 10:08:00,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:00,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:08:00,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860925588] [2019-12-07 10:08:00,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:08:00,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:00,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:08:00,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:08:00,156 INFO L87 Difference]: Start difference. First operand 3189 states and 7046 transitions. Second operand 10 states. [2019-12-07 10:08:00,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:00,617 INFO L93 Difference]: Finished difference Result 7033 states and 15480 transitions. [2019-12-07 10:08:00,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:08:00,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-12-07 10:08:00,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:00,619 INFO L225 Difference]: With dead ends: 7033 [2019-12-07 10:08:00,620 INFO L226 Difference]: Without dead ends: 4185 [2019-12-07 10:08:00,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-12-07 10:08:00,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4185 states. [2019-12-07 10:08:00,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4185 to 3085. [2019-12-07 10:08:00,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3085 states. [2019-12-07 10:08:00,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3085 states to 3085 states and 6743 transitions. [2019-12-07 10:08:00,647 INFO L78 Accepts]: Start accepts. Automaton has 3085 states and 6743 transitions. Word has length 34 [2019-12-07 10:08:00,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:00,648 INFO L462 AbstractCegarLoop]: Abstraction has 3085 states and 6743 transitions. [2019-12-07 10:08:00,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:08:00,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3085 states and 6743 transitions. [2019-12-07 10:08:00,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:08:00,650 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:00,650 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:00,650 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:00,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:00,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1558435352, now seen corresponding path program 3 times [2019-12-07 10:08:00,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:00,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508336142] [2019-12-07 10:08:00,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:00,695 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 10:08:00,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508336142] [2019-12-07 10:08:00,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:00,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:08:00,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972649730] [2019-12-07 10:08:00,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:08:00,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:00,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:08:00,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:08:00,696 INFO L87 Difference]: Start difference. First operand 3085 states and 6743 transitions. Second operand 6 states. [2019-12-07 10:08:00,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:00,725 INFO L93 Difference]: Finished difference Result 1904 states and 4048 transitions. [2019-12-07 10:08:00,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:08:00,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 10:08:00,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:00,726 INFO L225 Difference]: With dead ends: 1904 [2019-12-07 10:08:00,726 INFO L226 Difference]: Without dead ends: 1227 [2019-12-07 10:08:00,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:08:00,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2019-12-07 10:08:00,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1127. [2019-12-07 10:08:00,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1127 states. [2019-12-07 10:08:00,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 2381 transitions. [2019-12-07 10:08:00,735 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 2381 transitions. Word has length 34 [2019-12-07 10:08:00,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:00,735 INFO L462 AbstractCegarLoop]: Abstraction has 1127 states and 2381 transitions. [2019-12-07 10:08:00,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:08:00,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 2381 transitions. [2019-12-07 10:08:00,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 10:08:00,737 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:00,737 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:00,737 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:00,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:00,737 INFO L82 PathProgramCache]: Analyzing trace with hash 951232817, now seen corresponding path program 1 times [2019-12-07 10:08:00,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:00,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529934242] [2019-12-07 10:08:00,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:00,795 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 10:08:00,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529934242] [2019-12-07 10:08:00,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:00,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:08:00,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743604693] [2019-12-07 10:08:00,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:08:00,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:00,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:08:00,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:08:00,796 INFO L87 Difference]: Start difference. First operand 1127 states and 2381 transitions. Second operand 5 states. [2019-12-07 10:08:00,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:00,827 INFO L93 Difference]: Finished difference Result 1260 states and 2623 transitions. [2019-12-07 10:08:00,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:08:00,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-07 10:08:00,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:00,828 INFO L225 Difference]: With dead ends: 1260 [2019-12-07 10:08:00,828 INFO L226 Difference]: Without dead ends: 490 [2019-12-07 10:08:00,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:08:00,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-12-07 10:08:00,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2019-12-07 10:08:00,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-12-07 10:08:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 1054 transitions. [2019-12-07 10:08:00,832 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 1054 transitions. Word has length 48 [2019-12-07 10:08:00,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:00,832 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 1054 transitions. [2019-12-07 10:08:00,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:08:00,832 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 1054 transitions. [2019-12-07 10:08:00,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 10:08:00,833 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:00,833 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:00,833 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:00,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:00,833 INFO L82 PathProgramCache]: Analyzing trace with hash -880706143, now seen corresponding path program 2 times [2019-12-07 10:08:00,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:00,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450067304] [2019-12-07 10:08:00,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:01,052 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 10:08:01,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450067304] [2019-12-07 10:08:01,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:01,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 10:08:01,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933796519] [2019-12-07 10:08:01,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 10:08:01,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:01,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 10:08:01,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:08:01,053 INFO L87 Difference]: Start difference. First operand 490 states and 1054 transitions. Second operand 13 states. [2019-12-07 10:08:01,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:01,926 INFO L93 Difference]: Finished difference Result 962 states and 1989 transitions. [2019-12-07 10:08:01,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 10:08:01,927 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2019-12-07 10:08:01,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:01,927 INFO L225 Difference]: With dead ends: 962 [2019-12-07 10:08:01,927 INFO L226 Difference]: Without dead ends: 536 [2019-12-07 10:08:01,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=654, Unknown=0, NotChecked=0, Total=812 [2019-12-07 10:08:01,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-12-07 10:08:01,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 508. [2019-12-07 10:08:01,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-12-07 10:08:01,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 1076 transitions. [2019-12-07 10:08:01,932 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 1076 transitions. Word has length 48 [2019-12-07 10:08:01,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:01,932 INFO L462 AbstractCegarLoop]: Abstraction has 508 states and 1076 transitions. [2019-12-07 10:08:01,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 10:08:01,932 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 1076 transitions. [2019-12-07 10:08:01,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 10:08:01,933 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:01,933 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:01,933 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:01,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:01,933 INFO L82 PathProgramCache]: Analyzing trace with hash -369928875, now seen corresponding path program 3 times [2019-12-07 10:08:01,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:01,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672900352] [2019-12-07 10:08:01,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:01,998 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 10:08:01,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672900352] [2019-12-07 10:08:01,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:01,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:08:01,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839042616] [2019-12-07 10:08:01,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:08:01,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:01,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:08:01,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:08:01,999 INFO L87 Difference]: Start difference. First operand 508 states and 1076 transitions. Second operand 7 states. [2019-12-07 10:08:02,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:02,142 INFO L93 Difference]: Finished difference Result 866 states and 1800 transitions. [2019-12-07 10:08:02,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:08:02,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-07 10:08:02,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:02,143 INFO L225 Difference]: With dead ends: 866 [2019-12-07 10:08:02,143 INFO L226 Difference]: Without dead ends: 580 [2019-12-07 10:08:02,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:08:02,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-12-07 10:08:02,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 522. [2019-12-07 10:08:02,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2019-12-07 10:08:02,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1091 transitions. [2019-12-07 10:08:02,147 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1091 transitions. Word has length 48 [2019-12-07 10:08:02,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:02,147 INFO L462 AbstractCegarLoop]: Abstraction has 522 states and 1091 transitions. [2019-12-07 10:08:02,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:08:02,147 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1091 transitions. [2019-12-07 10:08:02,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 10:08:02,148 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:02,148 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:02,148 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:02,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:02,148 INFO L82 PathProgramCache]: Analyzing trace with hash 81842901, now seen corresponding path program 4 times [2019-12-07 10:08:02,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:02,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581659729] [2019-12-07 10:08:02,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:08:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:08:02,208 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:08:02,208 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:08:02,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_91| 0 0))) (and (= 0 v_~z$r_buff1_thd3~0_232) (= v_~weak$$choice2~0_162 0) (= v_~x~0_82 0) (= v_~z$w_buff1~0_269 0) (= v_~z$mem_tmp~0_40 0) (= 0 v_~z$flush_delayed~0_66) (= v_~z$w_buff0_used~0_718 0) (= v_~z$r_buff0_thd2~0_22 0) (= v_~z$read_delayed~0_6 0) (= v_~z$read_delayed_var~0.base_8 0) (= 0 v_~z$r_buff0_thd4~0_134) (= v_~z$r_buff0_thd0~0_100 0) (= v_~z$w_buff0~0_458 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1429~0.base_44|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1429~0.base_44| 1) |v_#valid_89|) (= 0 v_~z$r_buff1_thd4~0_125) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_p3_EAX~0_102 0) (= v_~__unbuffered_cnt~0_156 0) (= 0 v_~weak$$choice0~0_37) (< 0 |v_#StackHeapBarrier_20|) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t1429~0.base_44| 4) |v_#length_29|) (= 0 v_~__unbuffered_p2_EAX~0_62) (= v_~main$tmp_guard1~0_47 0) (= v_~y~0_80 0) (= v_~z$r_buff0_thd1~0_23 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1429~0.base_44|)) (= v_~a~0_45 0) (= |v_#NULL.offset_4| 0) (= v_~z$w_buff1_used~0_462 0) (= v_~z$r_buff1_thd0~0_156 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff1_thd1~0_67) (= |v_ULTIMATE.start_main_~#t1429~0.offset_29| 0) (= 0 v_~z$r_buff0_thd3~0_296) (= v_~z~0_165 0) (= v_~z$read_delayed_var~0.offset_8 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1429~0.base_44| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1429~0.base_44|) |v_ULTIMATE.start_main_~#t1429~0.offset_29| 0)) |v_#memory_int_25|) (= 0 v_~z$r_buff1_thd2~0_67))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_67, #NULL.offset=|v_#NULL.offset_4|, ~a~0=v_~a~0_45, ULTIMATE.start_main_~#t1430~0.base=|v_ULTIMATE.start_main_~#t1430~0.base_44|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_100, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_134, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_102, #length=|v_#length_29|, ULTIMATE.start_main_~#t1430~0.offset=|v_ULTIMATE.start_main_~#t1430~0.offset_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~z$mem_tmp~0=v_~z$mem_tmp~0_40, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_80|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_462, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_42|, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, ~weak$$choice0~0=v_~weak$$choice0~0_37, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_30|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_67, ULTIMATE.start_main_~#t1431~0.base=|v_ULTIMATE.start_main_~#t1431~0.base_36|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_296, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_156, ~x~0=v_~x~0_82, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_125, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_~#t1432~0.base=|v_ULTIMATE.start_main_~#t1432~0.base_27|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_22|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_269, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_156, ULTIMATE.start_main_~#t1429~0.base=|v_ULTIMATE.start_main_~#t1429~0.base_44|, ~y~0=v_~y~0_80, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_22, ULTIMATE.start_main_~#t1429~0.offset=|v_ULTIMATE.start_main_~#t1429~0.offset_29|, ULTIMATE.start_main_~#t1432~0.offset=|v_ULTIMATE.start_main_~#t1432~0.offset_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_718, ~z$w_buff0~0=v_~z$w_buff0~0_458, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_232, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_34|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_106|, ULTIMATE.start_main_~#t1431~0.offset=|v_ULTIMATE.start_main_~#t1431~0.offset_20|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_34|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_165, ~weak$$choice2~0=v_~weak$$choice2~0_162, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ULTIMATE.start_main_~#t1430~0.base, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t1430~0.offset, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_~#t1431~0.base, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1432~0.base, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1429~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1429~0.offset, ULTIMATE.start_main_~#t1432~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1431~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:08:02,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L831-1-->L833: Formula: (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1430~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1430~0.base_12|) |v_ULTIMATE.start_main_~#t1430~0.offset_11| 1)) |v_#memory_int_17|) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1430~0.base_12| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1430~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t1430~0.offset_11|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1430~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1430~0.base_12| 0)) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1430~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1430~0.base=|v_ULTIMATE.start_main_~#t1430~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1430~0.offset=|v_ULTIMATE.start_main_~#t1430~0.offset_11|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1430~0.base, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t1430~0.offset, #length] because there is no mapped edge [2019-12-07 10:08:02,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L833-1-->L835: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1431~0.base_11|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1431~0.base_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1431~0.base_11| 1)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1431~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1431~0.base_11|) |v_ULTIMATE.start_main_~#t1431~0.offset_10| 2))) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1431~0.base_11|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1431~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t1431~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1431~0.offset=|v_ULTIMATE.start_main_~#t1431~0.offset_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1431~0.base=|v_ULTIMATE.start_main_~#t1431~0.base_11|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1431~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t1431~0.base, #length] because there is no mapped edge [2019-12-07 10:08:02,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L835-1-->L837: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1432~0.base_12| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1432~0.base_12|) |v_ULTIMATE.start_main_~#t1432~0.offset_10| 3))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1432~0.base_12| 4)) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1432~0.base_12|) 0) (= 0 |v_ULTIMATE.start_main_~#t1432~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t1432~0.base_12| 0)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1432~0.base_12|) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1432~0.base_12| 1) |v_#valid_48|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1432~0.offset=|v_ULTIMATE.start_main_~#t1432~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ULTIMATE.start_main_~#t1432~0.base=|v_ULTIMATE.start_main_~#t1432~0.base_12|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1432~0.offset, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1432~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 10:08:02,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_100 v_~z$w_buff1_used~0_70) (= 1 v_~z$w_buff0~0_43) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_13| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_15) (= v_P3Thread1of1ForFork1_~arg.offset_13 |v_P3Thread1of1ForFork1_#in~arg.offset_15|) (= v_P3Thread1of1ForFork1_~arg.base_13 |v_P3Thread1of1ForFork1_#in~arg.base_15|) (= v_~z$w_buff0_used~0_99 1) (= v_~z$w_buff0~0_44 v_~z$w_buff1~0_34) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_15)) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_13| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_99 256) 0)) (not (= 0 (mod v_~z$w_buff1_used~0_70 256))))) 1 0))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_44, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_15|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_15|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_43, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_15|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_70, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_13|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_13, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_15|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_13} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 10:08:02,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_24| v_P0Thread1of1ForFork2_~arg.offset_22) (= v_P0Thread1of1ForFork2_~arg.base_22 |v_P0Thread1of1ForFork2_#in~arg.base_24|) (= v_~a~0_34 1) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_120 (+ v_~__unbuffered_cnt~0_121 1)) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|) (= v_~x~0_42 1)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_24|} OutVars{~a~0=v_~a~0_34, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_24|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_22, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_24|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|, ~x~0=v_~x~0_42, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_22} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 10:08:02,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_5|) (= 0 |v_P1Thread1of1ForFork3_#res.offset_5|) (= v_~x~0_38 2) (= v_~__unbuffered_cnt~0_114 (+ v_~__unbuffered_cnt~0_115 1)) (= v_~y~0_33 1) (= |v_P1Thread1of1ForFork3_#in~arg.offset_15| v_P1Thread1of1ForFork3_~arg.offset_13) (= |v_P1Thread1of1ForFork3_#in~arg.base_15| v_P1Thread1of1ForFork3_~arg.base_13)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_15|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_5|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_13, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_15|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_13, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_114, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_15|, ~y~0=v_~y~0_33, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-12-07 10:08:02,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1421475166 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1421475166 256) 0))) (or (and (= 0 |P3Thread1of1ForFork1_#t~ite28_Out-1421475166|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1421475166 |P3Thread1of1ForFork1_#t~ite28_Out-1421475166|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1421475166, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1421475166} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1421475166, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out-1421475166|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1421475166} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 10:08:02,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L810-->L810-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-132096088 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-132096088 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-132096088 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-132096088 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork1_#t~ite29_Out-132096088|)) (and (= ~z$w_buff1_used~0_In-132096088 |P3Thread1of1ForFork1_#t~ite29_Out-132096088|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-132096088, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-132096088, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-132096088, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-132096088} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-132096088, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out-132096088|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-132096088, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-132096088, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-132096088} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 10:08:02,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L811-->L812: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-849311250 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-849311250 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_In-849311250 ~z$r_buff0_thd4~0_Out-849311250))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-849311250)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-849311250, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-849311250} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-849311250, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-849311250, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-849311250|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 10:08:02,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-541856138 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-541856138 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-541856138 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-541856138 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork1_#t~ite31_Out-541856138| ~z$r_buff1_thd4~0_In-541856138) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P3Thread1of1ForFork1_#t~ite31_Out-541856138| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-541856138, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-541856138, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-541856138, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-541856138} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-541856138, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-541856138, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-541856138, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-541856138, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out-541856138|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 10:08:02,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L773-->L773-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1333683494 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1333683494 256)))) (or (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In1333683494 256))) (= 0 (mod ~z$w_buff0_used~0_In1333683494 256)) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1333683494 256))))) (= |P2Thread1of1ForFork0_#t~ite11_Out1333683494| |P2Thread1of1ForFork0_#t~ite12_Out1333683494|) .cse1 (= |P2Thread1of1ForFork0_#t~ite11_Out1333683494| ~z$w_buff1~0_In1333683494)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite12_Out1333683494| ~z$w_buff1~0_In1333683494) (= |P2Thread1of1ForFork0_#t~ite11_In1333683494| |P2Thread1of1ForFork0_#t~ite11_Out1333683494|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1333683494, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In1333683494|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1333683494, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1333683494, ~z$w_buff1~0=~z$w_buff1~0_In1333683494, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1333683494, ~weak$$choice2~0=~weak$$choice2~0_In1333683494} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out1333683494|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1333683494, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1333683494|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1333683494, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1333683494, ~z$w_buff1~0=~z$w_buff1~0_In1333683494, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1333683494, ~weak$$choice2~0=~weak$$choice2~0_In1333683494} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 10:08:02,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L812-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_98 (+ v_~__unbuffered_cnt~0_99 1)) (= v_~z$r_buff1_thd4~0_48 |v_P3Thread1of1ForFork1_#t~ite31_44|) (= |v_P3Thread1of1ForFork1_#res.offset_3| 0) (= |v_P3Thread1of1ForFork1_#res.base_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_44|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_48, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_3|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_43|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 10:08:02,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L776-->L777: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_5|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_5|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_11|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 10:08:02,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L779-->L787: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_14 256))) (= 0 v_~z$flush_delayed~0_13) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= v_~z~0_33 v_~z$mem_tmp~0_8)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52, ~z$flush_delayed~0=v_~z$flush_delayed~0_14} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_9|, ~z$mem_tmp~0=v_~z$mem_tmp~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_33} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 10:08:02,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L837-1-->L843: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_15) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:08:02,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L843-2-->L843-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-522808029 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-522808029 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite37_Out-522808029| |ULTIMATE.start_main_#t~ite36_Out-522808029|))) (or (and (not .cse0) (= ~z$w_buff1~0_In-522808029 |ULTIMATE.start_main_#t~ite36_Out-522808029|) (not .cse1) .cse2) (and (or .cse1 .cse0) .cse2 (= ~z~0_In-522808029 |ULTIMATE.start_main_#t~ite36_Out-522808029|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-522808029, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-522808029, ~z$w_buff1~0=~z$w_buff1~0_In-522808029, ~z~0=~z~0_In-522808029} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-522808029, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-522808029, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-522808029|, ~z$w_buff1~0=~z$w_buff1~0_In-522808029, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-522808029|, ~z~0=~z~0_In-522808029} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 10:08:02,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2045890460 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In2045890460 256) 0))) (or (and (= ~z$w_buff0_used~0_In2045890460 |ULTIMATE.start_main_#t~ite38_Out2045890460|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out2045890460|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2045890460, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2045890460} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2045890460, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2045890460, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out2045890460|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 10:08:02,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L845-->L845-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-170223306 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-170223306 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-170223306 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-170223306 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-170223306| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite39_Out-170223306| ~z$w_buff1_used~0_In-170223306)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-170223306, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-170223306, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-170223306, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-170223306} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-170223306, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-170223306|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-170223306, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-170223306, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-170223306} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 10:08:02,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In2053609953 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2053609953 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out2053609953| ~z$r_buff0_thd0~0_In2053609953)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite40_Out2053609953|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2053609953, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2053609953} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2053609953, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2053609953|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2053609953} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 10:08:02,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L847-->L847-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1764850861 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1764850861 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1764850861 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1764850861 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-1764850861 |ULTIMATE.start_main_#t~ite41_Out-1764850861|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite41_Out-1764850861|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1764850861, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1764850861, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1764850861, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1764850861} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1764850861|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1764850861, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1764850861, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1764850861, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1764850861} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 10:08:02,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EAX~0_70) (= v_~y~0_43 2) (= 0 v_~__unbuffered_p2_EAX~0_28) (= v_~x~0_52 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_115 |v_ULTIMATE.start_main_#t~ite41_47|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_47|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~y~0=v_~y~0_43, ~x~0=v_~x~0_52} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_46|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_115, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~y~0=v_~y~0_43, ~x~0=v_~x~0_52, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:08:02,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:08:02 BasicIcfg [2019-12-07 10:08:02,288 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:08:02,288 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:08:02,288 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:08:02,288 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:08:02,288 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:42" (3/4) ... [2019-12-07 10:08:02,290 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:08:02,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_91| 0 0))) (and (= 0 v_~z$r_buff1_thd3~0_232) (= v_~weak$$choice2~0_162 0) (= v_~x~0_82 0) (= v_~z$w_buff1~0_269 0) (= v_~z$mem_tmp~0_40 0) (= 0 v_~z$flush_delayed~0_66) (= v_~z$w_buff0_used~0_718 0) (= v_~z$r_buff0_thd2~0_22 0) (= v_~z$read_delayed~0_6 0) (= v_~z$read_delayed_var~0.base_8 0) (= 0 v_~z$r_buff0_thd4~0_134) (= v_~z$r_buff0_thd0~0_100 0) (= v_~z$w_buff0~0_458 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1429~0.base_44|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1429~0.base_44| 1) |v_#valid_89|) (= 0 v_~z$r_buff1_thd4~0_125) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_p3_EAX~0_102 0) (= v_~__unbuffered_cnt~0_156 0) (= 0 v_~weak$$choice0~0_37) (< 0 |v_#StackHeapBarrier_20|) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t1429~0.base_44| 4) |v_#length_29|) (= 0 v_~__unbuffered_p2_EAX~0_62) (= v_~main$tmp_guard1~0_47 0) (= v_~y~0_80 0) (= v_~z$r_buff0_thd1~0_23 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1429~0.base_44|)) (= v_~a~0_45 0) (= |v_#NULL.offset_4| 0) (= v_~z$w_buff1_used~0_462 0) (= v_~z$r_buff1_thd0~0_156 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff1_thd1~0_67) (= |v_ULTIMATE.start_main_~#t1429~0.offset_29| 0) (= 0 v_~z$r_buff0_thd3~0_296) (= v_~z~0_165 0) (= v_~z$read_delayed_var~0.offset_8 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1429~0.base_44| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1429~0.base_44|) |v_ULTIMATE.start_main_~#t1429~0.offset_29| 0)) |v_#memory_int_25|) (= 0 v_~z$r_buff1_thd2~0_67))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_67, #NULL.offset=|v_#NULL.offset_4|, ~a~0=v_~a~0_45, ULTIMATE.start_main_~#t1430~0.base=|v_ULTIMATE.start_main_~#t1430~0.base_44|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_100, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_134, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_102, #length=|v_#length_29|, ULTIMATE.start_main_~#t1430~0.offset=|v_ULTIMATE.start_main_~#t1430~0.offset_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~z$mem_tmp~0=v_~z$mem_tmp~0_40, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_80|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_462, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_42|, ~z$flush_delayed~0=v_~z$flush_delayed~0_66, ~weak$$choice0~0=v_~weak$$choice0~0_37, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_30|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_67, ULTIMATE.start_main_~#t1431~0.base=|v_ULTIMATE.start_main_~#t1431~0.base_36|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_296, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_156, ~x~0=v_~x~0_82, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_125, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_~#t1432~0.base=|v_ULTIMATE.start_main_~#t1432~0.base_27|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_22|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_269, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_156, ULTIMATE.start_main_~#t1429~0.base=|v_ULTIMATE.start_main_~#t1429~0.base_44|, ~y~0=v_~y~0_80, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_22, ULTIMATE.start_main_~#t1429~0.offset=|v_ULTIMATE.start_main_~#t1429~0.offset_29|, ULTIMATE.start_main_~#t1432~0.offset=|v_ULTIMATE.start_main_~#t1432~0.offset_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_718, ~z$w_buff0~0=v_~z$w_buff0~0_458, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_232, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_34|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_106|, ULTIMATE.start_main_~#t1431~0.offset=|v_ULTIMATE.start_main_~#t1431~0.offset_20|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_34|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_165, ~weak$$choice2~0=v_~weak$$choice2~0_162, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ULTIMATE.start_main_~#t1430~0.base, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t1430~0.offset, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_~#t1431~0.base, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1432~0.base, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1429~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1429~0.offset, ULTIMATE.start_main_~#t1432~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1431~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:08:02,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L831-1-->L833: Formula: (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1430~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1430~0.base_12|) |v_ULTIMATE.start_main_~#t1430~0.offset_11| 1)) |v_#memory_int_17|) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1430~0.base_12| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1430~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t1430~0.offset_11|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1430~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1430~0.base_12| 0)) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1430~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1430~0.base=|v_ULTIMATE.start_main_~#t1430~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1430~0.offset=|v_ULTIMATE.start_main_~#t1430~0.offset_11|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1430~0.base, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t1430~0.offset, #length] because there is no mapped edge [2019-12-07 10:08:02,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L833-1-->L835: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1431~0.base_11|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1431~0.base_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1431~0.base_11| 1)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1431~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1431~0.base_11|) |v_ULTIMATE.start_main_~#t1431~0.offset_10| 2))) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1431~0.base_11|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1431~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t1431~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1431~0.offset=|v_ULTIMATE.start_main_~#t1431~0.offset_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1431~0.base=|v_ULTIMATE.start_main_~#t1431~0.base_11|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1431~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t1431~0.base, #length] because there is no mapped edge [2019-12-07 10:08:02,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L835-1-->L837: Formula: (and (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1432~0.base_12| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1432~0.base_12|) |v_ULTIMATE.start_main_~#t1432~0.offset_10| 3))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1432~0.base_12| 4)) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1432~0.base_12|) 0) (= 0 |v_ULTIMATE.start_main_~#t1432~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t1432~0.base_12| 0)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1432~0.base_12|) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1432~0.base_12| 1) |v_#valid_48|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1432~0.offset=|v_ULTIMATE.start_main_~#t1432~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ULTIMATE.start_main_~#t1432~0.base=|v_ULTIMATE.start_main_~#t1432~0.base_12|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1432~0.offset, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1432~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 10:08:02,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_100 v_~z$w_buff1_used~0_70) (= 1 v_~z$w_buff0~0_43) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_13| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_15) (= v_P3Thread1of1ForFork1_~arg.offset_13 |v_P3Thread1of1ForFork1_#in~arg.offset_15|) (= v_P3Thread1of1ForFork1_~arg.base_13 |v_P3Thread1of1ForFork1_#in~arg.base_15|) (= v_~z$w_buff0_used~0_99 1) (= v_~z$w_buff0~0_44 v_~z$w_buff1~0_34) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_15)) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_13| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_99 256) 0)) (not (= 0 (mod v_~z$w_buff1_used~0_70 256))))) 1 0))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_44, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_15|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_15|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_43, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_15|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_70, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_13|, ~z$w_buff1~0=v_~z$w_buff1~0_34, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_13, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_15|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_13} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 10:08:02,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_24| v_P0Thread1of1ForFork2_~arg.offset_22) (= v_P0Thread1of1ForFork2_~arg.base_22 |v_P0Thread1of1ForFork2_#in~arg.base_24|) (= v_~a~0_34 1) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_120 (+ v_~__unbuffered_cnt~0_121 1)) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|) (= v_~x~0_42 1)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_24|} OutVars{~a~0=v_~a~0_34, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_24|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_22, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_24|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|, ~x~0=v_~x~0_42, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_22} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 10:08:02,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_5|) (= 0 |v_P1Thread1of1ForFork3_#res.offset_5|) (= v_~x~0_38 2) (= v_~__unbuffered_cnt~0_114 (+ v_~__unbuffered_cnt~0_115 1)) (= v_~y~0_33 1) (= |v_P1Thread1of1ForFork3_#in~arg.offset_15| v_P1Thread1of1ForFork3_~arg.offset_13) (= |v_P1Thread1of1ForFork3_#in~arg.base_15| v_P1Thread1of1ForFork3_~arg.base_13)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_15|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_5|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_13, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_15|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_13, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_114, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_15|, ~y~0=v_~y~0_33, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-12-07 10:08:02,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1421475166 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1421475166 256) 0))) (or (and (= 0 |P3Thread1of1ForFork1_#t~ite28_Out-1421475166|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1421475166 |P3Thread1of1ForFork1_#t~ite28_Out-1421475166|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1421475166, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1421475166} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1421475166, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out-1421475166|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1421475166} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 10:08:02,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L810-->L810-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-132096088 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-132096088 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-132096088 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-132096088 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork1_#t~ite29_Out-132096088|)) (and (= ~z$w_buff1_used~0_In-132096088 |P3Thread1of1ForFork1_#t~ite29_Out-132096088|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-132096088, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-132096088, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-132096088, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-132096088} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-132096088, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out-132096088|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-132096088, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-132096088, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-132096088} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 10:08:02,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L811-->L812: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-849311250 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-849311250 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_In-849311250 ~z$r_buff0_thd4~0_Out-849311250))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-849311250)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-849311250, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-849311250} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-849311250, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-849311250, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-849311250|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 10:08:02,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-541856138 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-541856138 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-541856138 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-541856138 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork1_#t~ite31_Out-541856138| ~z$r_buff1_thd4~0_In-541856138) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P3Thread1of1ForFork1_#t~ite31_Out-541856138| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-541856138, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-541856138, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-541856138, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-541856138} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-541856138, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-541856138, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-541856138, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-541856138, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out-541856138|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 10:08:02,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L773-->L773-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1333683494 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1333683494 256)))) (or (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In1333683494 256))) (= 0 (mod ~z$w_buff0_used~0_In1333683494 256)) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1333683494 256))))) (= |P2Thread1of1ForFork0_#t~ite11_Out1333683494| |P2Thread1of1ForFork0_#t~ite12_Out1333683494|) .cse1 (= |P2Thread1of1ForFork0_#t~ite11_Out1333683494| ~z$w_buff1~0_In1333683494)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite12_Out1333683494| ~z$w_buff1~0_In1333683494) (= |P2Thread1of1ForFork0_#t~ite11_In1333683494| |P2Thread1of1ForFork0_#t~ite11_Out1333683494|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1333683494, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In1333683494|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1333683494, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1333683494, ~z$w_buff1~0=~z$w_buff1~0_In1333683494, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1333683494, ~weak$$choice2~0=~weak$$choice2~0_In1333683494} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out1333683494|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1333683494, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out1333683494|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1333683494, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1333683494, ~z$w_buff1~0=~z$w_buff1~0_In1333683494, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1333683494, ~weak$$choice2~0=~weak$$choice2~0_In1333683494} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 10:08:02,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L812-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_98 (+ v_~__unbuffered_cnt~0_99 1)) (= v_~z$r_buff1_thd4~0_48 |v_P3Thread1of1ForFork1_#t~ite31_44|) (= |v_P3Thread1of1ForFork1_#res.offset_3| 0) (= |v_P3Thread1of1ForFork1_#res.base_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_44|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_48, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_3|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_43|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 10:08:02,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L776-->L777: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_5|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_5|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_11|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-07 10:08:02,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L779-->L787: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_14 256))) (= 0 v_~z$flush_delayed~0_13) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= v_~z~0_33 v_~z$mem_tmp~0_8)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52, ~z$flush_delayed~0=v_~z$flush_delayed~0_14} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_9|, ~z$mem_tmp~0=v_~z$mem_tmp~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_33} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 10:08:02,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L837-1-->L843: Formula: (and (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_15) 1 0)) 0 1)) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 10:08:02,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L843-2-->L843-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-522808029 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-522808029 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite37_Out-522808029| |ULTIMATE.start_main_#t~ite36_Out-522808029|))) (or (and (not .cse0) (= ~z$w_buff1~0_In-522808029 |ULTIMATE.start_main_#t~ite36_Out-522808029|) (not .cse1) .cse2) (and (or .cse1 .cse0) .cse2 (= ~z~0_In-522808029 |ULTIMATE.start_main_#t~ite36_Out-522808029|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-522808029, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-522808029, ~z$w_buff1~0=~z$w_buff1~0_In-522808029, ~z~0=~z~0_In-522808029} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-522808029, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-522808029, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-522808029|, ~z$w_buff1~0=~z$w_buff1~0_In-522808029, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-522808029|, ~z~0=~z~0_In-522808029} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 10:08:02,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2045890460 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In2045890460 256) 0))) (or (and (= ~z$w_buff0_used~0_In2045890460 |ULTIMATE.start_main_#t~ite38_Out2045890460|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out2045890460|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2045890460, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2045890460} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2045890460, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2045890460, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out2045890460|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 10:08:02,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L845-->L845-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-170223306 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-170223306 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-170223306 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-170223306 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-170223306| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite39_Out-170223306| ~z$w_buff1_used~0_In-170223306)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-170223306, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-170223306, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-170223306, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-170223306} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-170223306, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-170223306|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-170223306, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-170223306, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-170223306} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 10:08:02,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In2053609953 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2053609953 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out2053609953| ~z$r_buff0_thd0~0_In2053609953)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite40_Out2053609953|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2053609953, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2053609953} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2053609953, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2053609953|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2053609953} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 10:08:02,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L847-->L847-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1764850861 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1764850861 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1764850861 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1764850861 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-1764850861 |ULTIMATE.start_main_#t~ite41_Out-1764850861|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite41_Out-1764850861|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1764850861, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1764850861, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1764850861, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1764850861} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1764850861|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1764850861, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1764850861, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1764850861, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1764850861} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 10:08:02,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EAX~0_70) (= v_~y~0_43 2) (= 0 v_~__unbuffered_p2_EAX~0_28) (= v_~x~0_52 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_115 |v_ULTIMATE.start_main_#t~ite41_47|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_47|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~y~0=v_~y~0_43, ~x~0=v_~x~0_52} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_46|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_115, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_70, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~y~0=v_~y~0_43, ~x~0=v_~x~0_52, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:08:02,365 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6350feae-a99f-453a-ab39-04931e5d81c2/bin/uautomizer/witness.graphml [2019-12-07 10:08:02,365 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:08:02,366 INFO L168 Benchmark]: Toolchain (without parser) took 20510.35 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 934.0 MB in the beginning and 1.8 GB in the end (delta: -863.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 10:08:02,367 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:08:02,367 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -143.6 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:02,367 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.98 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 10:08:02,368 INFO L168 Benchmark]: Boogie Preprocessor took 28.09 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 10:08:02,368 INFO L168 Benchmark]: RCFGBuilder took 404.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:02,368 INFO L168 Benchmark]: TraceAbstraction took 19550.55 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -792.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 10:08:02,369 INFO L168 Benchmark]: Witness Printer took 77.26 ms. Allocated memory is still 3.0 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:08:02,371 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 405.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -143.6 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.98 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 28.09 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 404.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19550.55 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -792.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 77.26 ms. Allocated memory is still 3.0 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 167 ProgramPointsBefore, 78 ProgramPointsAfterwards, 189 TransitionsBefore, 86 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 19 ChoiceCompositions, 5650 VarBasedMoverChecksPositive, 211 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 185 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 48182 CheckedPairsTotal, 118 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t1429, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] FCALL, FORK 0 pthread_create(&t1430, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1431, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1432, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L797] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L798] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L799] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L800] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L801] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L802] 4 z$r_buff0_thd4 = (_Bool)1 [L805] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 3 y = 2 [L767] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 3 z$flush_delayed = weak$$choice2 [L770] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L809] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L810] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L771] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L772] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L772] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L773] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L774] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L775] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L778] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L846] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.3s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2632 SDtfs, 2873 SDslu, 5049 SDs, 0 SdLazy, 3301 SolverSat, 199 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 27 SyntacticMatches, 9 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40442occurred 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: 7.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 30129 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 598 NumberOfCodeBlocks, 598 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 530 ConstructedInterpolants, 0 QuantifiedInterpolants, 101517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...