./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix039_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_933bdd40-af54-467d-bb08-dc187ad7a996/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_933bdd40-af54-467d-bb08-dc187ad7a996/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_933bdd40-af54-467d-bb08-dc187ad7a996/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_933bdd40-af54-467d-bb08-dc187ad7a996/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix039_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_933bdd40-af54-467d-bb08-dc187ad7a996/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_933bdd40-af54-467d-bb08-dc187ad7a996/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 ba929f05014495cf2a9344860b4698dab00b7bbe ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 13:17:25,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:17:25,397 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:17:25,404 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:17:25,404 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:17:25,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:17:25,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:17:25,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:17:25,409 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:17:25,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:17:25,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:17:25,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:17:25,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:17:25,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:17:25,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:17:25,413 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:17:25,414 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:17:25,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:17:25,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:17:25,417 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:17:25,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:17:25,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:17:25,420 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:17:25,420 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:17:25,422 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:17:25,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:17:25,422 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:17:25,423 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:17:25,423 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:17:25,424 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:17:25,424 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:17:25,424 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:17:25,425 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:17:25,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:17:25,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:17:25,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:17:25,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:17:25,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:17:25,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:17:25,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:17:25,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:17:25,428 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_933bdd40-af54-467d-bb08-dc187ad7a996/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:17:25,437 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:17:25,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:17:25,438 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:17:25,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:17:25,438 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:17:25,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:17:25,439 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:17:25,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:17:25,439 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:17:25,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:17:25,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:17:25,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:17:25,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:17:25,440 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:17:25,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:17:25,440 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:17:25,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:17:25,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:17:25,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:17:25,441 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:17:25,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:17:25,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:17:25,441 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:17:25,441 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:17:25,441 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:17:25,441 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:17:25,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:17:25,442 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:17:25,442 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:17:25,442 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_933bdd40-af54-467d-bb08-dc187ad7a996/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 -> ba929f05014495cf2a9344860b4698dab00b7bbe [2019-12-07 13:17:25,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:17:25,549 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:17:25,552 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:17:25,553 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:17:25,553 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:17:25,554 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_933bdd40-af54-467d-bb08-dc187ad7a996/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix039_rmo.opt.i [2019-12-07 13:17:25,593 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_933bdd40-af54-467d-bb08-dc187ad7a996/bin/uautomizer/data/0ee19fed9/34aac17ea0454ebf8d5960d2d9734a3d/FLAG348d21ac3 [2019-12-07 13:17:26,065 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:17:26,066 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_933bdd40-af54-467d-bb08-dc187ad7a996/sv-benchmarks/c/pthread-wmm/mix039_rmo.opt.i [2019-12-07 13:17:26,076 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_933bdd40-af54-467d-bb08-dc187ad7a996/bin/uautomizer/data/0ee19fed9/34aac17ea0454ebf8d5960d2d9734a3d/FLAG348d21ac3 [2019-12-07 13:17:26,088 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_933bdd40-af54-467d-bb08-dc187ad7a996/bin/uautomizer/data/0ee19fed9/34aac17ea0454ebf8d5960d2d9734a3d [2019-12-07 13:17:26,090 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:17:26,091 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:17:26,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:17:26,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:17:26,095 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:17:26,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:17:26" (1/1) ... [2019-12-07 13:17:26,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:26, skipping insertion in model container [2019-12-07 13:17:26,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:17:26" (1/1) ... [2019-12-07 13:17:26,105 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:17:26,140 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:17:26,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:17:26,402 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:17:26,445 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:17:26,491 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:17:26,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:26 WrapperNode [2019-12-07 13:17:26,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:17:26,492 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:17:26,492 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:17:26,492 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:17:26,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:26" (1/1) ... [2019-12-07 13:17:26,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:26" (1/1) ... [2019-12-07 13:17:26,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:17:26,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:17:26,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:17:26,530 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:17:26,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:26" (1/1) ... [2019-12-07 13:17:26,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:26" (1/1) ... [2019-12-07 13:17:26,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:26" (1/1) ... [2019-12-07 13:17:26,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:26" (1/1) ... [2019-12-07 13:17:26,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:26" (1/1) ... [2019-12-07 13:17:26,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:26" (1/1) ... [2019-12-07 13:17:26,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:26" (1/1) ... [2019-12-07 13:17:26,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:17:26,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:17:26,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:17:26,556 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:17:26,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_933bdd40-af54-467d-bb08-dc187ad7a996/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:17:26,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:17:26,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:17:26,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:17:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:17:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:17:26,601 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:17:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:17:26,601 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:17:26,601 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 13:17:26,601 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 13:17:26,602 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 13:17:26,602 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 13:17:26,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:17:26,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:17:26,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:17:26,603 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 13:17:26,958 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:17:26,959 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:17:26,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:17:26 BoogieIcfgContainer [2019-12-07 13:17:26,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:17:26,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:17:26,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:17:26,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:17:26,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:17:26" (1/3) ... [2019-12-07 13:17:26,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de8782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:17:26, skipping insertion in model container [2019-12-07 13:17:26,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:26" (2/3) ... [2019-12-07 13:17:26,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de8782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:17:26, skipping insertion in model container [2019-12-07 13:17:26,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:17:26" (3/3) ... [2019-12-07 13:17:26,965 INFO L109 eAbstractionObserver]: Analyzing ICFG mix039_rmo.opt.i [2019-12-07 13:17:26,972 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:17:26,972 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:17:26,976 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:17:26,977 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:17:27,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,005 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,005 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,006 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,006 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,008 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,008 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,024 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,025 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,025 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,025 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,025 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,025 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,025 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,026 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,026 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,026 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,026 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,026 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,026 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,027 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,027 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,027 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,027 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,027 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,027 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,028 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,028 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,028 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,030 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,030 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,030 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,030 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,030 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,031 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,031 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,031 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,031 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,031 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,031 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,032 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:27,047 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 13:17:27,064 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:17:27,064 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:17:27,064 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:17:27,064 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:17:27,064 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:17:27,065 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:17:27,065 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:17:27,065 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:17:27,078 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-07 13:17:27,080 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-07 13:17:27,134 INFO L134 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-07 13:17:27,134 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:17:27,143 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 575 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 13:17:27,155 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-07 13:17:27,182 INFO L134 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-07 13:17:27,182 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:17:27,186 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 575 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 13:17:27,198 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-07 13:17:27,199 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:17:30,001 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 13:17:30,270 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 13:17:30,371 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44168 [2019-12-07 13:17:30,371 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-07 13:17:30,374 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 78 transitions [2019-12-07 13:17:31,353 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 21398 states. [2019-12-07 13:17:31,354 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states. [2019-12-07 13:17:31,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 13:17:31,359 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:31,359 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:31,360 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:31,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:31,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1244651740, now seen corresponding path program 1 times [2019-12-07 13:17:31,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:31,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423784975] [2019-12-07 13:17:31,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:31,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:31,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423784975] [2019-12-07 13:17:31,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:31,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:17:31,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003628759] [2019-12-07 13:17:31,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:17:31,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:31,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:17:31,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:17:31,544 INFO L87 Difference]: Start difference. First operand 21398 states. Second operand 3 states. [2019-12-07 13:17:31,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:31,790 INFO L93 Difference]: Finished difference Result 20958 states and 90416 transitions. [2019-12-07 13:17:31,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:17:31,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 13:17:31,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:31,924 INFO L225 Difference]: With dead ends: 20958 [2019-12-07 13:17:31,925 INFO L226 Difference]: Without dead ends: 19662 [2019-12-07 13:17:31,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:17:32,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-07 13:17:32,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 19662. [2019-12-07 13:17:32,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-12-07 13:17:32,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 84692 transitions. [2019-12-07 13:17:32,708 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 84692 transitions. Word has length 9 [2019-12-07 13:17:32,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:32,709 INFO L462 AbstractCegarLoop]: Abstraction has 19662 states and 84692 transitions. [2019-12-07 13:17:32,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:17:32,709 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 84692 transitions. [2019-12-07 13:17:32,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 13:17:32,715 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:32,715 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:32,715 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:32,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:32,715 INFO L82 PathProgramCache]: Analyzing trace with hash -6792795, now seen corresponding path program 1 times [2019-12-07 13:17:32,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:32,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879164085] [2019-12-07 13:17:32,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:32,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879164085] [2019-12-07 13:17:32,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:32,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:17:32,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562236260] [2019-12-07 13:17:32,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:17:32,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:32,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:17:32,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:17:32,776 INFO L87 Difference]: Start difference. First operand 19662 states and 84692 transitions. Second operand 4 states. [2019-12-07 13:17:33,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:33,190 INFO L93 Difference]: Finished difference Result 30494 states and 126452 transitions. [2019-12-07 13:17:33,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:17:33,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 13:17:33,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:33,274 INFO L225 Difference]: With dead ends: 30494 [2019-12-07 13:17:33,275 INFO L226 Difference]: Without dead ends: 30438 [2019-12-07 13:17:33,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:17:33,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30438 states. [2019-12-07 13:17:33,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30438 to 27742. [2019-12-07 13:17:33,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-12-07 13:17:34,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 116300 transitions. [2019-12-07 13:17:34,057 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 116300 transitions. Word has length 15 [2019-12-07 13:17:34,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:34,057 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 116300 transitions. [2019-12-07 13:17:34,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:17:34,057 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 116300 transitions. [2019-12-07 13:17:34,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:17:34,062 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:34,062 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:34,062 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:34,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:34,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1479332799, now seen corresponding path program 1 times [2019-12-07 13:17:34,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:34,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906811422] [2019-12-07 13:17:34,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:34,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:34,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906811422] [2019-12-07 13:17:34,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:34,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:17:34,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135837842] [2019-12-07 13:17:34,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:17:34,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:34,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:17:34,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:17:34,114 INFO L87 Difference]: Start difference. First operand 27742 states and 116300 transitions. Second operand 4 states. [2019-12-07 13:17:34,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:34,319 INFO L93 Difference]: Finished difference Result 35230 states and 146308 transitions. [2019-12-07 13:17:34,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:17:34,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 13:17:34,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:34,405 INFO L225 Difference]: With dead ends: 35230 [2019-12-07 13:17:34,405 INFO L226 Difference]: Without dead ends: 35182 [2019-12-07 13:17:34,405 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:17:34,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-12-07 13:17:35,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 30378. [2019-12-07 13:17:35,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30378 states. [2019-12-07 13:17:35,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30378 states to 30378 states and 127172 transitions. [2019-12-07 13:17:35,111 INFO L78 Accepts]: Start accepts. Automaton has 30378 states and 127172 transitions. Word has length 18 [2019-12-07 13:17:35,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:35,111 INFO L462 AbstractCegarLoop]: Abstraction has 30378 states and 127172 transitions. [2019-12-07 13:17:35,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:17:35,112 INFO L276 IsEmpty]: Start isEmpty. Operand 30378 states and 127172 transitions. [2019-12-07 13:17:35,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 13:17:35,121 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:35,122 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:35,122 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:35,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:35,122 INFO L82 PathProgramCache]: Analyzing trace with hash -45820751, now seen corresponding path program 1 times [2019-12-07 13:17:35,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:35,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546646576] [2019-12-07 13:17:35,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:35,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546646576] [2019-12-07 13:17:35,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:35,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:17:35,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927830901] [2019-12-07 13:17:35,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:17:35,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:35,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:17:35,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:17:35,210 INFO L87 Difference]: Start difference. First operand 30378 states and 127172 transitions. Second operand 3 states. [2019-12-07 13:17:35,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:35,375 INFO L93 Difference]: Finished difference Result 45592 states and 181958 transitions. [2019-12-07 13:17:35,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:17:35,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 13:17:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:35,466 INFO L225 Difference]: With dead ends: 45592 [2019-12-07 13:17:35,466 INFO L226 Difference]: Without dead ends: 44928 [2019-12-07 13:17:35,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:17:35,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44928 states. [2019-12-07 13:17:36,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44928 to 43523. [2019-12-07 13:17:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43523 states. [2019-12-07 13:17:36,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43523 states to 43523 states and 175527 transitions. [2019-12-07 13:17:36,420 INFO L78 Accepts]: Start accepts. Automaton has 43523 states and 175527 transitions. Word has length 20 [2019-12-07 13:17:36,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:36,420 INFO L462 AbstractCegarLoop]: Abstraction has 43523 states and 175527 transitions. [2019-12-07 13:17:36,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:17:36,420 INFO L276 IsEmpty]: Start isEmpty. Operand 43523 states and 175527 transitions. [2019-12-07 13:17:36,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 13:17:36,432 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:36,432 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 13:17:36,432 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:36,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:36,432 INFO L82 PathProgramCache]: Analyzing trace with hash -129088173, now seen corresponding path program 1 times [2019-12-07 13:17:36,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:36,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437944940] [2019-12-07 13:17:36,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:36,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:36,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437944940] [2019-12-07 13:17:36,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:36,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:17:36,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535019449] [2019-12-07 13:17:36,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:17:36,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:36,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:17:36,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:17:36,492 INFO L87 Difference]: Start difference. First operand 43523 states and 175527 transitions. Second operand 5 states. [2019-12-07 13:17:36,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:36,613 INFO L93 Difference]: Finished difference Result 19792 states and 66044 transitions. [2019-12-07 13:17:36,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:17:36,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-07 13:17:36,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:36,638 INFO L225 Difference]: With dead ends: 19792 [2019-12-07 13:17:36,638 INFO L226 Difference]: Without dead ends: 16954 [2019-12-07 13:17:36,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:17:36,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16954 states. [2019-12-07 13:17:36,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16954 to 16879. [2019-12-07 13:17:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16879 states. [2019-12-07 13:17:36,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16879 states to 16879 states and 55343 transitions. [2019-12-07 13:17:36,962 INFO L78 Accepts]: Start accepts. Automaton has 16879 states and 55343 transitions. Word has length 21 [2019-12-07 13:17:36,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:36,963 INFO L462 AbstractCegarLoop]: Abstraction has 16879 states and 55343 transitions. [2019-12-07 13:17:36,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:17:36,963 INFO L276 IsEmpty]: Start isEmpty. Operand 16879 states and 55343 transitions. [2019-12-07 13:17:36,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 13:17:36,968 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:36,968 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 13:17:36,968 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:36,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:36,968 INFO L82 PathProgramCache]: Analyzing trace with hash -554820601, now seen corresponding path program 1 times [2019-12-07 13:17:36,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:36,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499654618] [2019-12-07 13:17:36,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:37,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:37,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499654618] [2019-12-07 13:17:37,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:37,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:17:37,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335051815] [2019-12-07 13:17:37,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:17:37,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:37,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:17:37,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:17:37,035 INFO L87 Difference]: Start difference. First operand 16879 states and 55343 transitions. Second operand 4 states. [2019-12-07 13:17:37,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:37,123 INFO L93 Difference]: Finished difference Result 22654 states and 74007 transitions. [2019-12-07 13:17:37,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:17:37,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 13:17:37,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:37,153 INFO L225 Difference]: With dead ends: 22654 [2019-12-07 13:17:37,153 INFO L226 Difference]: Without dead ends: 21638 [2019-12-07 13:17:37,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:17:37,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21638 states. [2019-12-07 13:17:37,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21638 to 16457. [2019-12-07 13:17:37,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16457 states. [2019-12-07 13:17:37,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16457 states to 16457 states and 53398 transitions. [2019-12-07 13:17:37,421 INFO L78 Accepts]: Start accepts. Automaton has 16457 states and 53398 transitions. Word has length 22 [2019-12-07 13:17:37,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:37,421 INFO L462 AbstractCegarLoop]: Abstraction has 16457 states and 53398 transitions. [2019-12-07 13:17:37,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:17:37,422 INFO L276 IsEmpty]: Start isEmpty. Operand 16457 states and 53398 transitions. [2019-12-07 13:17:37,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 13:17:37,426 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:37,427 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:37,427 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:37,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:37,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1969131095, now seen corresponding path program 1 times [2019-12-07 13:17:37,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:37,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809675435] [2019-12-07 13:17:37,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:37,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:37,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809675435] [2019-12-07 13:17:37,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:37,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:17:37,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585685949] [2019-12-07 13:17:37,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:17:37,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:37,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:17:37,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:17:37,458 INFO L87 Difference]: Start difference. First operand 16457 states and 53398 transitions. Second operand 3 states. [2019-12-07 13:17:37,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:37,500 INFO L93 Difference]: Finished difference Result 16343 states and 53027 transitions. [2019-12-07 13:17:37,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:17:37,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 13:17:37,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:37,521 INFO L225 Difference]: With dead ends: 16343 [2019-12-07 13:17:37,521 INFO L226 Difference]: Without dead ends: 16343 [2019-12-07 13:17:37,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:17:37,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16343 states. [2019-12-07 13:17:37,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16343 to 15276. [2019-12-07 13:17:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15276 states. [2019-12-07 13:17:37,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15276 states to 15276 states and 49623 transitions. [2019-12-07 13:17:37,738 INFO L78 Accepts]: Start accepts. Automaton has 15276 states and 49623 transitions. Word has length 23 [2019-12-07 13:17:37,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:37,738 INFO L462 AbstractCegarLoop]: Abstraction has 15276 states and 49623 transitions. [2019-12-07 13:17:37,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:17:37,738 INFO L276 IsEmpty]: Start isEmpty. Operand 15276 states and 49623 transitions. [2019-12-07 13:17:37,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 13:17:37,743 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:37,743 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 13:17:37,743 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:37,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:37,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1876344722, now seen corresponding path program 1 times [2019-12-07 13:17:37,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:37,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871418977] [2019-12-07 13:17:37,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:37,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:37,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871418977] [2019-12-07 13:17:37,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:37,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:17:37,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604446037] [2019-12-07 13:17:37,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:17:37,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:37,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:17:37,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:17:37,772 INFO L87 Difference]: Start difference. First operand 15276 states and 49623 transitions. Second operand 3 states. [2019-12-07 13:17:37,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:37,820 INFO L93 Difference]: Finished difference Result 15276 states and 48897 transitions. [2019-12-07 13:17:37,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:17:37,821 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 13:17:37,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:37,841 INFO L225 Difference]: With dead ends: 15276 [2019-12-07 13:17:37,841 INFO L226 Difference]: Without dead ends: 15276 [2019-12-07 13:17:37,842 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:17:37,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15276 states. [2019-12-07 13:17:38,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15276 to 14947. [2019-12-07 13:17:38,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14947 states. [2019-12-07 13:17:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14947 states to 14947 states and 47986 transitions. [2019-12-07 13:17:38,071 INFO L78 Accepts]: Start accepts. Automaton has 14947 states and 47986 transitions. Word has length 23 [2019-12-07 13:17:38,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:38,072 INFO L462 AbstractCegarLoop]: Abstraction has 14947 states and 47986 transitions. [2019-12-07 13:17:38,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:17:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 14947 states and 47986 transitions. [2019-12-07 13:17:38,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 13:17:38,077 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:38,077 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:38,077 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:38,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:38,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1862087193, now seen corresponding path program 1 times [2019-12-07 13:17:38,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:38,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415457141] [2019-12-07 13:17:38,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:38,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:38,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415457141] [2019-12-07 13:17:38,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:38,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:17:38,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851681271] [2019-12-07 13:17:38,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:17:38,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:38,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:17:38,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:17:38,126 INFO L87 Difference]: Start difference. First operand 14947 states and 47986 transitions. Second operand 6 states. [2019-12-07 13:17:38,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:38,187 INFO L93 Difference]: Finished difference Result 4619 states and 13592 transitions. [2019-12-07 13:17:38,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:17:38,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 13:17:38,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:38,192 INFO L225 Difference]: With dead ends: 4619 [2019-12-07 13:17:38,192 INFO L226 Difference]: Without dead ends: 3694 [2019-12-07 13:17:38,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:17:38,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3694 states. [2019-12-07 13:17:38,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3694 to 3363. [2019-12-07 13:17:38,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3363 states. [2019-12-07 13:17:38,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3363 states to 3363 states and 9550 transitions. [2019-12-07 13:17:38,227 INFO L78 Accepts]: Start accepts. Automaton has 3363 states and 9550 transitions. Word has length 24 [2019-12-07 13:17:38,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:38,227 INFO L462 AbstractCegarLoop]: Abstraction has 3363 states and 9550 transitions. [2019-12-07 13:17:38,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:17:38,227 INFO L276 IsEmpty]: Start isEmpty. Operand 3363 states and 9550 transitions. [2019-12-07 13:17:38,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 13:17:38,230 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:38,231 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:38,231 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:38,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:38,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1619810495, now seen corresponding path program 1 times [2019-12-07 13:17:38,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:38,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687646701] [2019-12-07 13:17:38,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:38,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:38,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687646701] [2019-12-07 13:17:38,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:38,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:17:38,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446813968] [2019-12-07 13:17:38,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:17:38,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:38,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:17:38,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:17:38,256 INFO L87 Difference]: Start difference. First operand 3363 states and 9550 transitions. Second operand 3 states. [2019-12-07 13:17:38,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:38,295 INFO L93 Difference]: Finished difference Result 4998 states and 14084 transitions. [2019-12-07 13:17:38,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:17:38,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 13:17:38,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:38,299 INFO L225 Difference]: With dead ends: 4998 [2019-12-07 13:17:38,300 INFO L226 Difference]: Without dead ends: 4998 [2019-12-07 13:17:38,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:17:38,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4998 states. [2019-12-07 13:17:38,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4998 to 4031. [2019-12-07 13:17:38,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4031 states. [2019-12-07 13:17:38,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 4031 states and 11605 transitions. [2019-12-07 13:17:38,343 INFO L78 Accepts]: Start accepts. Automaton has 4031 states and 11605 transitions. Word has length 32 [2019-12-07 13:17:38,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:38,343 INFO L462 AbstractCegarLoop]: Abstraction has 4031 states and 11605 transitions. [2019-12-07 13:17:38,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:17:38,343 INFO L276 IsEmpty]: Start isEmpty. Operand 4031 states and 11605 transitions. [2019-12-07 13:17:38,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 13:17:38,346 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:38,347 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:38,347 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:38,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:38,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1082300219, now seen corresponding path program 1 times [2019-12-07 13:17:38,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:38,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905170715] [2019-12-07 13:17:38,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:38,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:38,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905170715] [2019-12-07 13:17:38,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:38,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:17:38,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774960522] [2019-12-07 13:17:38,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:17:38,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:38,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:17:38,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:17:38,413 INFO L87 Difference]: Start difference. First operand 4031 states and 11605 transitions. Second operand 6 states. [2019-12-07 13:17:38,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:38,716 INFO L93 Difference]: Finished difference Result 8131 states and 21958 transitions. [2019-12-07 13:17:38,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:17:38,717 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-07 13:17:38,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:38,724 INFO L225 Difference]: With dead ends: 8131 [2019-12-07 13:17:38,724 INFO L226 Difference]: Without dead ends: 8127 [2019-12-07 13:17:38,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:17:38,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8127 states. [2019-12-07 13:17:38,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8127 to 4318. [2019-12-07 13:17:38,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4318 states. [2019-12-07 13:17:38,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4318 states to 4318 states and 12385 transitions. [2019-12-07 13:17:38,787 INFO L78 Accepts]: Start accepts. Automaton has 4318 states and 12385 transitions. Word has length 32 [2019-12-07 13:17:38,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:38,788 INFO L462 AbstractCegarLoop]: Abstraction has 4318 states and 12385 transitions. [2019-12-07 13:17:38,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:17:38,788 INFO L276 IsEmpty]: Start isEmpty. Operand 4318 states and 12385 transitions. [2019-12-07 13:17:38,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 13:17:38,792 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:38,792 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 13:17:38,792 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:38,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:38,792 INFO L82 PathProgramCache]: Analyzing trace with hash -345264620, now seen corresponding path program 1 times [2019-12-07 13:17:38,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:38,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304650142] [2019-12-07 13:17:38,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:38,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304650142] [2019-12-07 13:17:38,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:38,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:17:38,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814423455] [2019-12-07 13:17:38,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:17:38,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:38,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:17:38,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:17:38,845 INFO L87 Difference]: Start difference. First operand 4318 states and 12385 transitions. Second operand 6 states. [2019-12-07 13:17:39,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:39,114 INFO L93 Difference]: Finished difference Result 7856 states and 21058 transitions. [2019-12-07 13:17:39,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:17:39,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 13:17:39,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:39,122 INFO L225 Difference]: With dead ends: 7856 [2019-12-07 13:17:39,122 INFO L226 Difference]: Without dead ends: 7854 [2019-12-07 13:17:39,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:17:39,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7854 states. [2019-12-07 13:17:39,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7854 to 4198. [2019-12-07 13:17:39,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4198 states. [2019-12-07 13:17:39,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4198 states to 4198 states and 12099 transitions. [2019-12-07 13:17:39,181 INFO L78 Accepts]: Start accepts. Automaton has 4198 states and 12099 transitions. Word has length 33 [2019-12-07 13:17:39,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:39,181 INFO L462 AbstractCegarLoop]: Abstraction has 4198 states and 12099 transitions. [2019-12-07 13:17:39,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:17:39,181 INFO L276 IsEmpty]: Start isEmpty. Operand 4198 states and 12099 transitions. [2019-12-07 13:17:39,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 13:17:39,185 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:39,185 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:39,186 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:39,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:39,186 INFO L82 PathProgramCache]: Analyzing trace with hash 452387979, now seen corresponding path program 1 times [2019-12-07 13:17:39,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:39,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397227054] [2019-12-07 13:17:39,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:39,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:39,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397227054] [2019-12-07 13:17:39,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:39,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:17:39,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933846983] [2019-12-07 13:17:39,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:17:39,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:39,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:17:39,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:17:39,241 INFO L87 Difference]: Start difference. First operand 4198 states and 12099 transitions. Second operand 7 states. [2019-12-07 13:17:39,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:39,308 INFO L93 Difference]: Finished difference Result 3000 states and 9201 transitions. [2019-12-07 13:17:39,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:17:39,309 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 13:17:39,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:39,312 INFO L225 Difference]: With dead ends: 3000 [2019-12-07 13:17:39,312 INFO L226 Difference]: Without dead ends: 2738 [2019-12-07 13:17:39,312 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:17:39,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2738 states. [2019-12-07 13:17:39,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2738 to 2226. [2019-12-07 13:17:39,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2226 states. [2019-12-07 13:17:39,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 7219 transitions. [2019-12-07 13:17:39,338 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 7219 transitions. Word has length 33 [2019-12-07 13:17:39,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:39,339 INFO L462 AbstractCegarLoop]: Abstraction has 2226 states and 7219 transitions. [2019-12-07 13:17:39,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:17:39,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 7219 transitions. [2019-12-07 13:17:39,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:17:39,341 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:39,342 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:39,342 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:39,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:39,342 INFO L82 PathProgramCache]: Analyzing trace with hash -754041251, now seen corresponding path program 1 times [2019-12-07 13:17:39,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:39,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474428987] [2019-12-07 13:17:39,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:39,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474428987] [2019-12-07 13:17:39,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:39,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:17:39,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723028909] [2019-12-07 13:17:39,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:17:39,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:39,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:17:39,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:17:39,403 INFO L87 Difference]: Start difference. First operand 2226 states and 7219 transitions. Second operand 5 states. [2019-12-07 13:17:39,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:39,449 INFO L93 Difference]: Finished difference Result 4208 states and 12761 transitions. [2019-12-07 13:17:39,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:17:39,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-07 13:17:39,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:39,453 INFO L225 Difference]: With dead ends: 4208 [2019-12-07 13:17:39,453 INFO L226 Difference]: Without dead ends: 2887 [2019-12-07 13:17:39,453 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:17:39,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2019-12-07 13:17:39,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 1954. [2019-12-07 13:17:39,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-12-07 13:17:39,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 6282 transitions. [2019-12-07 13:17:39,479 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 6282 transitions. Word has length 48 [2019-12-07 13:17:39,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:39,479 INFO L462 AbstractCegarLoop]: Abstraction has 1954 states and 6282 transitions. [2019-12-07 13:17:39,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:17:39,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 6282 transitions. [2019-12-07 13:17:39,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:17:39,482 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:39,482 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:39,482 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:39,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:39,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1894134845, now seen corresponding path program 2 times [2019-12-07 13:17:39,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:39,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626957749] [2019-12-07 13:17:39,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:39,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:39,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626957749] [2019-12-07 13:17:39,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:39,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:17:39,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522523624] [2019-12-07 13:17:39,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:17:39,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:39,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:17:39,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:17:39,552 INFO L87 Difference]: Start difference. First operand 1954 states and 6282 transitions. Second operand 6 states. [2019-12-07 13:17:39,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:39,775 INFO L93 Difference]: Finished difference Result 8194 states and 25034 transitions. [2019-12-07 13:17:39,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:17:39,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-12-07 13:17:39,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:39,781 INFO L225 Difference]: With dead ends: 8194 [2019-12-07 13:17:39,781 INFO L226 Difference]: Without dead ends: 5278 [2019-12-07 13:17:39,781 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:17:39,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5278 states. [2019-12-07 13:17:39,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5278 to 2238. [2019-12-07 13:17:39,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2238 states. [2019-12-07 13:17:39,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 7162 transitions. [2019-12-07 13:17:39,819 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 7162 transitions. Word has length 48 [2019-12-07 13:17:39,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:39,819 INFO L462 AbstractCegarLoop]: Abstraction has 2238 states and 7162 transitions. [2019-12-07 13:17:39,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:17:39,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 7162 transitions. [2019-12-07 13:17:39,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:17:39,822 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:39,822 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:39,822 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 13:17:39,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:39,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1878148035, now seen corresponding path program 3 times [2019-12-07 13:17:39,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:39,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545012028] [2019-12-07 13:17:39,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:40,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545012028] [2019-12-07 13:17:40,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:40,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 13:17:40,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476577968] [2019-12-07 13:17:40,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 13:17:40,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:40,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 13:17:40,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:17:40,015 INFO L87 Difference]: Start difference. First operand 2238 states and 7162 transitions. Second operand 12 states. [2019-12-07 13:17:41,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:41,718 INFO L93 Difference]: Finished difference Result 5979 states and 17439 transitions. [2019-12-07 13:17:41,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 13:17:41,719 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-07 13:17:41,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:41,727 INFO L225 Difference]: With dead ends: 5979 [2019-12-07 13:17:41,727 INFO L226 Difference]: Without dead ends: 5910 [2019-12-07 13:17:41,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=239, Invalid=753, Unknown=0, NotChecked=0, Total=992 [2019-12-07 13:17:41,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5910 states. [2019-12-07 13:17:41,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5910 to 2261. [2019-12-07 13:17:41,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2261 states. [2019-12-07 13:17:41,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 7233 transitions. [2019-12-07 13:17:41,767 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 7233 transitions. Word has length 48 [2019-12-07 13:17:41,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:41,767 INFO L462 AbstractCegarLoop]: Abstraction has 2261 states and 7233 transitions. [2019-12-07 13:17:41,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 13:17:41,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 7233 transitions. [2019-12-07 13:17:41,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:17:41,769 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:41,770 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:41,770 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 13:17:41,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:41,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1317469255, now seen corresponding path program 4 times [2019-12-07 13:17:41,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:41,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959068750] [2019-12-07 13:17:41,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:41,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:41,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959068750] [2019-12-07 13:17:41,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:41,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 13:17:41,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436794257] [2019-12-07 13:17:41,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:17:41,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:41,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:17:41,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:17:41,872 INFO L87 Difference]: Start difference. First operand 2261 states and 7233 transitions. Second operand 9 states. [2019-12-07 13:17:43,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:43,003 INFO L93 Difference]: Finished difference Result 11898 states and 35122 transitions. [2019-12-07 13:17:43,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 13:17:43,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2019-12-07 13:17:43,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:43,015 INFO L225 Difference]: With dead ends: 11898 [2019-12-07 13:17:43,015 INFO L226 Difference]: Without dead ends: 11202 [2019-12-07 13:17:43,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=396, Invalid=1244, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 13:17:43,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11202 states. [2019-12-07 13:17:43,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11202 to 2372. [2019-12-07 13:17:43,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2372 states. [2019-12-07 13:17:43,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 7636 transitions. [2019-12-07 13:17:43,080 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 7636 transitions. Word has length 48 [2019-12-07 13:17:43,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:43,080 INFO L462 AbstractCegarLoop]: Abstraction has 2372 states and 7636 transitions. [2019-12-07 13:17:43,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:17:43,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 7636 transitions. [2019-12-07 13:17:43,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:17:43,083 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:43,084 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:43,084 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 13:17:43,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:43,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1933491589, now seen corresponding path program 1 times [2019-12-07 13:17:43,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:43,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290993782] [2019-12-07 13:17:43,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:43,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:43,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290993782] [2019-12-07 13:17:43,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:43,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:17:43,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597832971] [2019-12-07 13:17:43,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:17:43,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:43,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:17:43,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:17:43,104 INFO L87 Difference]: Start difference. First operand 2372 states and 7636 transitions. Second operand 3 states. [2019-12-07 13:17:43,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:43,133 INFO L93 Difference]: Finished difference Result 2650 states and 8095 transitions. [2019-12-07 13:17:43,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:17:43,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-12-07 13:17:43,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:43,138 INFO L225 Difference]: With dead ends: 2650 [2019-12-07 13:17:43,138 INFO L226 Difference]: Without dead ends: 2586 [2019-12-07 13:17:43,138 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:17:43,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2019-12-07 13:17:43,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 2268. [2019-12-07 13:17:43,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2268 states. [2019-12-07 13:17:43,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2268 states to 2268 states and 7148 transitions. [2019-12-07 13:17:43,165 INFO L78 Accepts]: Start accepts. Automaton has 2268 states and 7148 transitions. Word has length 48 [2019-12-07 13:17:43,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:43,165 INFO L462 AbstractCegarLoop]: Abstraction has 2268 states and 7148 transitions. [2019-12-07 13:17:43,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:17:43,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2268 states and 7148 transitions. [2019-12-07 13:17:43,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:17:43,168 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:43,168 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:43,168 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 13:17:43,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:43,169 INFO L82 PathProgramCache]: Analyzing trace with hash -576774001, now seen corresponding path program 5 times [2019-12-07 13:17:43,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:43,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717590732] [2019-12-07 13:17:43,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:43,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717590732] [2019-12-07 13:17:43,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:43,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:17:43,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907866546] [2019-12-07 13:17:43,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:17:43,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:43,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:17:43,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:17:43,233 INFO L87 Difference]: Start difference. First operand 2268 states and 7148 transitions. Second operand 5 states. [2019-12-07 13:17:43,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:43,271 INFO L93 Difference]: Finished difference Result 3787 states and 11058 transitions. [2019-12-07 13:17:43,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:17:43,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-07 13:17:43,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:43,274 INFO L225 Difference]: With dead ends: 3787 [2019-12-07 13:17:43,274 INFO L226 Difference]: Without dead ends: 2004 [2019-12-07 13:17:43,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:17:43,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2019-12-07 13:17:43,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1637. [2019-12-07 13:17:43,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1637 states. [2019-12-07 13:17:43,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 4633 transitions. [2019-12-07 13:17:43,292 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 4633 transitions. Word has length 48 [2019-12-07 13:17:43,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:43,292 INFO L462 AbstractCegarLoop]: Abstraction has 1637 states and 4633 transitions. [2019-12-07 13:17:43,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:17:43,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 4633 transitions. [2019-12-07 13:17:43,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:17:43,294 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:43,295 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:43,295 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 13:17:43,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:43,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1923718495, now seen corresponding path program 6 times [2019-12-07 13:17:43,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:43,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003572688] [2019-12-07 13:17:43,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:43,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:43,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003572688] [2019-12-07 13:17:43,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:43,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:17:43,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027777574] [2019-12-07 13:17:43,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:17:43,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:43,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:17:43,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:17:43,345 INFO L87 Difference]: Start difference. First operand 1637 states and 4633 transitions. Second operand 4 states. [2019-12-07 13:17:43,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:43,359 INFO L93 Difference]: Finished difference Result 2070 states and 5595 transitions. [2019-12-07 13:17:43,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:17:43,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 13:17:43,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:43,360 INFO L225 Difference]: With dead ends: 2070 [2019-12-07 13:17:43,360 INFO L226 Difference]: Without dead ends: 481 [2019-12-07 13:17:43,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:17:43,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-12-07 13:17:43,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2019-12-07 13:17:43,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-12-07 13:17:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1047 transitions. [2019-12-07 13:17:43,364 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 1047 transitions. Word has length 48 [2019-12-07 13:17:43,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:43,364 INFO L462 AbstractCegarLoop]: Abstraction has 481 states and 1047 transitions. [2019-12-07 13:17:43,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:17:43,364 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 1047 transitions. [2019-12-07 13:17:43,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:17:43,365 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:43,365 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:43,365 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 13:17:43,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:43,365 INFO L82 PathProgramCache]: Analyzing trace with hash -126758993, now seen corresponding path program 7 times [2019-12-07 13:17:43,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:43,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736242045] [2019-12-07 13:17:43,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:43,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:43,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736242045] [2019-12-07 13:17:43,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:43,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:17:43,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499670983] [2019-12-07 13:17:43,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:17:43,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:17:43,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:17:43,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:17:43,427 INFO L87 Difference]: Start difference. First operand 481 states and 1047 transitions. Second operand 7 states. [2019-12-07 13:17:43,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:43,584 INFO L93 Difference]: Finished difference Result 849 states and 1817 transitions. [2019-12-07 13:17:43,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:17:43,584 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-07 13:17:43,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:43,585 INFO L225 Difference]: With dead ends: 849 [2019-12-07 13:17:43,585 INFO L226 Difference]: Without dead ends: 571 [2019-12-07 13:17:43,585 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 13:17:43,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-12-07 13:17:43,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 513. [2019-12-07 13:17:43,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2019-12-07 13:17:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 1107 transitions. [2019-12-07 13:17:43,589 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 1107 transitions. Word has length 48 [2019-12-07 13:17:43,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:43,589 INFO L462 AbstractCegarLoop]: Abstraction has 513 states and 1107 transitions. [2019-12-07 13:17:43,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:17:43,590 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 1107 transitions. [2019-12-07 13:17:43,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:17:43,590 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:43,590 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:43,590 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:43,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:43,591 INFO L82 PathProgramCache]: Analyzing trace with hash 24927743, now seen corresponding path program 8 times [2019-12-07 13:17:43,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:17:43,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446410657] [2019-12-07 13:17:43,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:43,652 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:17:43,652 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:17:43,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_119| 0 0))) (and (= v_~z~0_122 0) (= v_~z$w_buff0_used~0_514 0) (= v_~z$mem_tmp~0_32 0) (= v_~main$tmp_guard0~0_30 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1045~0.base_71| 4)) (= v_~main$tmp_guard1~0_50 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~__unbuffered_p3_EBX~0_94) (= 0 v_~__unbuffered_p3_EAX~0_93) (= 0 v_~weak$$choice0~0_26) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= v_~z$w_buff0~0_183 0) (= 0 v_~z$r_buff1_thd3~0_197) (= 0 v_~z$flush_delayed~0_53) (= 0 v_~z$r_buff1_thd1~0_59) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd0~0_138 0) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (= v_~z$r_buff0_thd2~0_57 0) (= v_~z$read_delayed~0_7 0) (= 0 |v_ULTIMATE.start_main_~#t1045~0.offset_43|) (= |v_#valid_117| (store .cse0 |v_ULTIMATE.start_main_~#t1045~0.base_71| 1)) (= |v_#NULL.offset_5| 0) (= v_~weak$$choice2~0_111 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1045~0.base_71|) (= 0 v_~z$r_buff0_thd3~0_266) (= v_~x~0_36 0) (= v_~y~0_68 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1045~0.base_71| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1045~0.base_71|) |v_ULTIMATE.start_main_~#t1045~0.offset_43| 0)) |v_#memory_int_27|) (= v_~z$w_buff1_used~0_298 0) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~z$w_buff1~0_123 0) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1045~0.base_71|)) (= 0 v_~__unbuffered_p2_EAX~0_55))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_119|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t1047~0.base=|v_ULTIMATE.start_main_~#t1047~0.base_36|, ULTIMATE.start_main_~#t1046~0.offset=|v_ULTIMATE.start_main_~#t1046~0.offset_41|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_93, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ~z$mem_tmp~0=v_~z$mem_tmp~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ULTIMATE.start_main_~#t1045~0.offset=|v_ULTIMATE.start_main_~#t1045~0.offset_43|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ULTIMATE.start_main_~#t1045~0.base=|v_ULTIMATE.start_main_~#t1045~0.base_71|, ~x~0=v_~x~0_36, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_~#t1046~0.base=|v_ULTIMATE.start_main_~#t1046~0.base_68|, ULTIMATE.start_main_~#t1047~0.offset=|v_ULTIMATE.start_main_~#t1047~0.offset_25|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_138, ~y~0=v_~y~0_68, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_197, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_94, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_103|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_44|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~#t1048~0.base=|v_ULTIMATE.start_main_~#t1048~0.base_36|, ULTIMATE.start_main_~#t1048~0.offset=|v_ULTIMATE.start_main_~#t1048~0.offset_24|, ~z~0=v_~z~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1047~0.base, ULTIMATE.start_main_~#t1046~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1045~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1045~0.base, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1046~0.base, ULTIMATE.start_main_~#t1047~0.offset, 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, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1048~0.base, ULTIMATE.start_main_~#t1048~0.offset, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:17:43,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1046~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1046~0.base_11|)) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1046~0.base_11|) 0) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1046~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1046~0.base_11|) |v_ULTIMATE.start_main_~#t1046~0.offset_10| 1))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1046~0.base_11| 4)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1046~0.base_11|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1046~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1046~0.offset=|v_ULTIMATE.start_main_~#t1046~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1046~0.base=|v_ULTIMATE.start_main_~#t1046~0.base_11|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1046~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1046~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:17:43,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1047~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t1047~0.offset_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1047~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1047~0.base_12|) |v_ULTIMATE.start_main_~#t1047~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1047~0.base_12|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1047~0.base_12|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1047~0.base_12| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1047~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1047~0.base=|v_ULTIMATE.start_main_~#t1047~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1047~0.offset=|v_ULTIMATE.start_main_~#t1047~0.offset_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1047~0.base, ULTIMATE.start_main_~#t1047~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:17:43,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1048~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1048~0.base_12|) |v_ULTIMATE.start_main_~#t1048~0.offset_10| 3)) |v_#memory_int_15|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1048~0.base_12| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1048~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t1048~0.base_12| 0)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1048~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1048~0.offset_10|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1048~0.base_12| 4) |v_#length_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1048~0.base=|v_ULTIMATE.start_main_~#t1048~0.base_12|, ULTIMATE.start_main_~#t1048~0.offset=|v_ULTIMATE.start_main_~#t1048~0.offset_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1048~0.base, ULTIMATE.start_main_~#t1048~0.offset, #length] because there is no mapped edge [2019-12-07 13:17:43,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~z$r_buff0_thd1~0_In1762638813 ~z$r_buff1_thd1~0_Out1762638813) (= ~z$r_buff1_thd3~0_Out1762638813 ~z$r_buff0_thd3~0_In1762638813) (= ~z$r_buff0_thd0~0_In1762638813 ~z$r_buff1_thd0~0_Out1762638813) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1762638813)) (= ~z$r_buff1_thd4~0_Out1762638813 ~z$r_buff0_thd4~0_In1762638813) (= ~z$r_buff1_thd2~0_Out1762638813 ~z$r_buff0_thd2~0_In1762638813) (= ~a~0_Out1762638813 1) (= ~b~0_In1762638813 ~__unbuffered_p3_EBX~0_Out1762638813) (= ~a~0_Out1762638813 ~__unbuffered_p3_EAX~0_Out1762638813) (= 1 ~z$r_buff0_thd4~0_Out1762638813)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1762638813, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1762638813, ~b~0=~b~0_In1762638813, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1762638813, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1762638813, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1762638813, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1762638813} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1762638813, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1762638813, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1762638813, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1762638813, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out1762638813, ~a~0=~a~0_Out1762638813, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1762638813, ~b~0=~b~0_In1762638813, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1762638813, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1762638813, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out1762638813, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1762638813, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1762638813, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1762638813, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1762638813} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-07 13:17:43,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_20 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~x~0_30 v_~__unbuffered_p0_EAX~0_26) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_20) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~b~0_48 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_20, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_20, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 13:17:43,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg.base_11| v_P1Thread1of1ForFork0_~arg.base_9) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x~0_19 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~y~0_18 1) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_9)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_18, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 13:17:43,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1590328055 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite9_Out-1590328055| |P2Thread1of1ForFork1_#t~ite8_Out-1590328055|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1590328055 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1590328055 256))) (= 0 (mod ~z$w_buff0_used~0_In-1590328055 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1590328055 256) 0)))) (= ~z$w_buff0~0_In-1590328055 |P2Thread1of1ForFork1_#t~ite8_Out-1590328055|)) (and (not .cse0) (= ~z$w_buff0~0_In-1590328055 |P2Thread1of1ForFork1_#t~ite9_Out-1590328055|) (= |P2Thread1of1ForFork1_#t~ite8_In-1590328055| |P2Thread1of1ForFork1_#t~ite8_Out-1590328055|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1590328055, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1590328055, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1590328055, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1590328055, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1590328055, ~weak$$choice2~0=~weak$$choice2~0_In-1590328055, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In-1590328055|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-1590328055, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1590328055, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1590328055, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1590328055, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1590328055, ~weak$$choice2~0=~weak$$choice2~0_In-1590328055, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out-1590328055|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-1590328055|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 13:17:43,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1874553667 256)))) (or (and .cse0 (= ~z$w_buff1~0_In1874553667 |P2Thread1of1ForFork1_#t~ite11_Out1874553667|) (= |P2Thread1of1ForFork1_#t~ite12_Out1874553667| |P2Thread1of1ForFork1_#t~ite11_Out1874553667|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1874553667 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1874553667 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1874553667 256))) (and (= 0 (mod ~z$r_buff1_thd3~0_In1874553667 256)) .cse1)))) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite12_Out1874553667| ~z$w_buff1~0_In1874553667) (= |P2Thread1of1ForFork1_#t~ite11_In1874553667| |P2Thread1of1ForFork1_#t~ite11_Out1874553667|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1874553667, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1874553667, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In1874553667|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1874553667, ~z$w_buff1~0=~z$w_buff1~0_In1874553667, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1874553667, ~weak$$choice2~0=~weak$$choice2~0_In1874553667} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1874553667, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1874553667|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1874553667, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1874553667|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1874553667, ~z$w_buff1~0=~z$w_buff1~0_In1874553667, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1874553667, ~weak$$choice2~0=~weak$$choice2~0_In1874553667} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 13:17:43,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1210292619 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite14_In1210292619| |P2Thread1of1ForFork1_#t~ite14_Out1210292619|) (= ~z$w_buff0_used~0_In1210292619 |P2Thread1of1ForFork1_#t~ite15_Out1210292619|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1210292619 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1210292619 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1210292619 256))) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1210292619 256))))) (= |P2Thread1of1ForFork1_#t~ite14_Out1210292619| |P2Thread1of1ForFork1_#t~ite15_Out1210292619|) (= |P2Thread1of1ForFork1_#t~ite14_Out1210292619| ~z$w_buff0_used~0_In1210292619) .cse0))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In1210292619|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1210292619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1210292619, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1210292619, ~weak$$choice2~0=~weak$$choice2~0_In1210292619} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1210292619|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out1210292619|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1210292619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1210292619, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1210292619, ~weak$$choice2~0=~weak$$choice2~0_In1210292619} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-07 13:17:43,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_9|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 13:17:43,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-60958231 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite23_Out-60958231| |P2Thread1of1ForFork1_#t~ite24_Out-60958231|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-60958231 256)))) (or (= (mod ~z$w_buff0_used~0_In-60958231 256) 0) (and (= (mod ~z$w_buff1_used~0_In-60958231 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In-60958231 256)) .cse1))) (= |P2Thread1of1ForFork1_#t~ite23_Out-60958231| ~z$r_buff1_thd3~0_In-60958231)) (and (= ~z$r_buff1_thd3~0_In-60958231 |P2Thread1of1ForFork1_#t~ite24_Out-60958231|) (= |P2Thread1of1ForFork1_#t~ite23_In-60958231| |P2Thread1of1ForFork1_#t~ite23_Out-60958231|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-60958231, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-60958231, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In-60958231|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-60958231, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-60958231, ~weak$$choice2~0=~weak$$choice2~0_In-60958231} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out-60958231|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-60958231, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-60958231, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out-60958231|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-60958231, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-60958231, ~weak$$choice2~0=~weak$$choice2~0_In-60958231} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-07 13:17:43,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 13:17:43,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1050210907 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-1050210907 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out-1050210907| ~z$w_buff0_used~0_In-1050210907)) (and (not .cse1) (= 0 |P3Thread1of1ForFork2_#t~ite28_Out-1050210907|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1050210907, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1050210907} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1050210907|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1050210907, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1050210907} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 13:17:43,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd4~0_In-1401843794 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1401843794 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-1401843794 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1401843794 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1401843794 |P3Thread1of1ForFork2_#t~ite29_Out-1401843794|)) (and (= |P3Thread1of1ForFork2_#t~ite29_Out-1401843794| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1401843794, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1401843794, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1401843794, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1401843794} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1401843794|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1401843794, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1401843794, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1401843794, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1401843794} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 13:17:43,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In815910660 256) 0)) (.cse0 (= ~z$r_buff0_thd4~0_Out815910660 ~z$r_buff0_thd4~0_In815910660)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In815910660 256)))) (or (and .cse0 .cse1) (and (= ~z$r_buff0_thd4~0_Out815910660 0) (not .cse1) (not .cse2)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In815910660, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In815910660} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In815910660, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out815910660, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out815910660|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-07 13:17:43,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1852831118 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-1852831118 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1852831118 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1852831118 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite31_Out-1852831118|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In-1852831118 |P3Thread1of1ForFork2_#t~ite31_Out-1852831118|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1852831118, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1852831118, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1852831118, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1852831118} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1852831118, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1852831118, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1852831118, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1852831118, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out-1852831118|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 13:17:43,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= |v_P3Thread1of1ForFork2_#t~ite31_42| v_~z$r_buff1_thd4~0_62) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_42|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_41|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 13:17:43,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:17:43,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1376465572 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1376465572 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite37_Out-1376465572| |ULTIMATE.start_main_#t~ite36_Out-1376465572|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-1376465572| ~z$w_buff1~0_In-1376465572) .cse1 (not .cse2)) (and (= ~z~0_In-1376465572 |ULTIMATE.start_main_#t~ite36_Out-1376465572|) (or .cse2 .cse0) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1376465572, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1376465572, ~z$w_buff1~0=~z$w_buff1~0_In-1376465572, ~z~0=~z~0_In-1376465572} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1376465572, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1376465572, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1376465572|, ~z$w_buff1~0=~z$w_buff1~0_In-1376465572, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1376465572|, ~z~0=~z~0_In-1376465572} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 13:17:43,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-484439986 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-484439986 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-484439986 |ULTIMATE.start_main_#t~ite38_Out-484439986|)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-484439986|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-484439986, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-484439986} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-484439986, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-484439986, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-484439986|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 13:17:43,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2096769610 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In2096769610 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In2096769610 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In2096769610 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out2096769610| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite39_Out2096769610| ~z$w_buff1_used~0_In2096769610) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2096769610, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2096769610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2096769610} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2096769610, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out2096769610|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2096769610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2096769610} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 13:17:43,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-163914762 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-163914762 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite40_Out-163914762|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-163914762 |ULTIMATE.start_main_#t~ite40_Out-163914762|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-163914762, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-163914762} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-163914762, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-163914762|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-163914762} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:17:43,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In528227422 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In528227422 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In528227422 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In528227422 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite41_Out528227422|)) (and (= ~z$r_buff1_thd0~0_In528227422 |ULTIMATE.start_main_#t~ite41_Out528227422|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In528227422, ~z$w_buff0_used~0=~z$w_buff0_used~0_In528227422, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In528227422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In528227422} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out528227422|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In528227422, ~z$w_buff0_used~0=~z$w_buff0_used~0_In528227422, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In528227422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In528227422} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 13:17:43,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= v_~y~0_25 2) (= 0 v_~__unbuffered_p0_EAX~0_32) (= 0 v_~__unbuffered_p2_EAX~0_16))) 1 0)) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:17:43,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:17:43 BasicIcfg [2019-12-07 13:17:43,714 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:17:43,715 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:17:43,715 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:17:43,715 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:17:43,715 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:17:26" (3/4) ... [2019-12-07 13:17:43,717 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:17:43,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_119| 0 0))) (and (= v_~z~0_122 0) (= v_~z$w_buff0_used~0_514 0) (= v_~z$mem_tmp~0_32 0) (= v_~main$tmp_guard0~0_30 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1045~0.base_71| 4)) (= v_~main$tmp_guard1~0_50 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~__unbuffered_p3_EBX~0_94) (= 0 v_~__unbuffered_p3_EAX~0_93) (= 0 v_~weak$$choice0~0_26) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= v_~z$w_buff0~0_183 0) (= 0 v_~z$r_buff1_thd3~0_197) (= 0 v_~z$flush_delayed~0_53) (= 0 v_~z$r_buff1_thd1~0_59) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd0~0_138 0) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (= v_~z$r_buff0_thd2~0_57 0) (= v_~z$read_delayed~0_7 0) (= 0 |v_ULTIMATE.start_main_~#t1045~0.offset_43|) (= |v_#valid_117| (store .cse0 |v_ULTIMATE.start_main_~#t1045~0.base_71| 1)) (= |v_#NULL.offset_5| 0) (= v_~weak$$choice2~0_111 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1045~0.base_71|) (= 0 v_~z$r_buff0_thd3~0_266) (= v_~x~0_36 0) (= v_~y~0_68 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1045~0.base_71| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1045~0.base_71|) |v_ULTIMATE.start_main_~#t1045~0.offset_43| 0)) |v_#memory_int_27|) (= v_~z$w_buff1_used~0_298 0) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~z$w_buff1~0_123 0) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1045~0.base_71|)) (= 0 v_~__unbuffered_p2_EAX~0_55))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_119|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t1047~0.base=|v_ULTIMATE.start_main_~#t1047~0.base_36|, ULTIMATE.start_main_~#t1046~0.offset=|v_ULTIMATE.start_main_~#t1046~0.offset_41|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_93, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ~z$mem_tmp~0=v_~z$mem_tmp~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ULTIMATE.start_main_~#t1045~0.offset=|v_ULTIMATE.start_main_~#t1045~0.offset_43|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ULTIMATE.start_main_~#t1045~0.base=|v_ULTIMATE.start_main_~#t1045~0.base_71|, ~x~0=v_~x~0_36, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_~#t1046~0.base=|v_ULTIMATE.start_main_~#t1046~0.base_68|, ULTIMATE.start_main_~#t1047~0.offset=|v_ULTIMATE.start_main_~#t1047~0.offset_25|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_138, ~y~0=v_~y~0_68, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_197, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_94, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_103|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_44|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~#t1048~0.base=|v_ULTIMATE.start_main_~#t1048~0.base_36|, ULTIMATE.start_main_~#t1048~0.offset=|v_ULTIMATE.start_main_~#t1048~0.offset_24|, ~z~0=v_~z~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1047~0.base, ULTIMATE.start_main_~#t1046~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1045~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1045~0.base, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1046~0.base, ULTIMATE.start_main_~#t1047~0.offset, 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, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1048~0.base, ULTIMATE.start_main_~#t1048~0.offset, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:17:43,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1046~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1046~0.base_11|)) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1046~0.base_11|) 0) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1046~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1046~0.base_11|) |v_ULTIMATE.start_main_~#t1046~0.offset_10| 1))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1046~0.base_11| 4)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1046~0.base_11|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1046~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1046~0.offset=|v_ULTIMATE.start_main_~#t1046~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1046~0.base=|v_ULTIMATE.start_main_~#t1046~0.base_11|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1046~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1046~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:17:43,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1047~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t1047~0.offset_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1047~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1047~0.base_12|) |v_ULTIMATE.start_main_~#t1047~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1047~0.base_12|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1047~0.base_12|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1047~0.base_12| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1047~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1047~0.base=|v_ULTIMATE.start_main_~#t1047~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1047~0.offset=|v_ULTIMATE.start_main_~#t1047~0.offset_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1047~0.base, ULTIMATE.start_main_~#t1047~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 13:17:43,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1048~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1048~0.base_12|) |v_ULTIMATE.start_main_~#t1048~0.offset_10| 3)) |v_#memory_int_15|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1048~0.base_12| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1048~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t1048~0.base_12| 0)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1048~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1048~0.offset_10|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1048~0.base_12| 4) |v_#length_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1048~0.base=|v_ULTIMATE.start_main_~#t1048~0.base_12|, ULTIMATE.start_main_~#t1048~0.offset=|v_ULTIMATE.start_main_~#t1048~0.offset_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1048~0.base, ULTIMATE.start_main_~#t1048~0.offset, #length] because there is no mapped edge [2019-12-07 13:17:43,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~z$r_buff0_thd1~0_In1762638813 ~z$r_buff1_thd1~0_Out1762638813) (= ~z$r_buff1_thd3~0_Out1762638813 ~z$r_buff0_thd3~0_In1762638813) (= ~z$r_buff0_thd0~0_In1762638813 ~z$r_buff1_thd0~0_Out1762638813) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1762638813)) (= ~z$r_buff1_thd4~0_Out1762638813 ~z$r_buff0_thd4~0_In1762638813) (= ~z$r_buff1_thd2~0_Out1762638813 ~z$r_buff0_thd2~0_In1762638813) (= ~a~0_Out1762638813 1) (= ~b~0_In1762638813 ~__unbuffered_p3_EBX~0_Out1762638813) (= ~a~0_Out1762638813 ~__unbuffered_p3_EAX~0_Out1762638813) (= 1 ~z$r_buff0_thd4~0_Out1762638813)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1762638813, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1762638813, ~b~0=~b~0_In1762638813, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1762638813, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1762638813, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1762638813, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1762638813} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1762638813, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1762638813, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1762638813, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1762638813, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out1762638813, ~a~0=~a~0_Out1762638813, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1762638813, ~b~0=~b~0_In1762638813, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1762638813, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1762638813, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out1762638813, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1762638813, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1762638813, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1762638813, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1762638813} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-07 13:17:43,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_20 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~x~0_30 v_~__unbuffered_p0_EAX~0_26) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_20) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~b~0_48 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_20, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_20, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 13:17:43,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg.base_11| v_P1Thread1of1ForFork0_~arg.base_9) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x~0_19 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~y~0_18 1) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_9)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_18, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 13:17:43,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1590328055 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite9_Out-1590328055| |P2Thread1of1ForFork1_#t~ite8_Out-1590328055|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1590328055 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1590328055 256))) (= 0 (mod ~z$w_buff0_used~0_In-1590328055 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1590328055 256) 0)))) (= ~z$w_buff0~0_In-1590328055 |P2Thread1of1ForFork1_#t~ite8_Out-1590328055|)) (and (not .cse0) (= ~z$w_buff0~0_In-1590328055 |P2Thread1of1ForFork1_#t~ite9_Out-1590328055|) (= |P2Thread1of1ForFork1_#t~ite8_In-1590328055| |P2Thread1of1ForFork1_#t~ite8_Out-1590328055|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1590328055, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1590328055, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1590328055, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1590328055, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1590328055, ~weak$$choice2~0=~weak$$choice2~0_In-1590328055, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In-1590328055|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-1590328055, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1590328055, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1590328055, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1590328055, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1590328055, ~weak$$choice2~0=~weak$$choice2~0_In-1590328055, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out-1590328055|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-1590328055|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 13:17:43,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1874553667 256)))) (or (and .cse0 (= ~z$w_buff1~0_In1874553667 |P2Thread1of1ForFork1_#t~ite11_Out1874553667|) (= |P2Thread1of1ForFork1_#t~ite12_Out1874553667| |P2Thread1of1ForFork1_#t~ite11_Out1874553667|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1874553667 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1874553667 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1874553667 256))) (and (= 0 (mod ~z$r_buff1_thd3~0_In1874553667 256)) .cse1)))) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite12_Out1874553667| ~z$w_buff1~0_In1874553667) (= |P2Thread1of1ForFork1_#t~ite11_In1874553667| |P2Thread1of1ForFork1_#t~ite11_Out1874553667|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1874553667, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1874553667, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In1874553667|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1874553667, ~z$w_buff1~0=~z$w_buff1~0_In1874553667, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1874553667, ~weak$$choice2~0=~weak$$choice2~0_In1874553667} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1874553667, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1874553667|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1874553667, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1874553667|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1874553667, ~z$w_buff1~0=~z$w_buff1~0_In1874553667, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1874553667, ~weak$$choice2~0=~weak$$choice2~0_In1874553667} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 13:17:43,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1210292619 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite14_In1210292619| |P2Thread1of1ForFork1_#t~ite14_Out1210292619|) (= ~z$w_buff0_used~0_In1210292619 |P2Thread1of1ForFork1_#t~ite15_Out1210292619|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1210292619 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1210292619 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1210292619 256))) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In1210292619 256))))) (= |P2Thread1of1ForFork1_#t~ite14_Out1210292619| |P2Thread1of1ForFork1_#t~ite15_Out1210292619|) (= |P2Thread1of1ForFork1_#t~ite14_Out1210292619| ~z$w_buff0_used~0_In1210292619) .cse0))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In1210292619|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1210292619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1210292619, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1210292619, ~weak$$choice2~0=~weak$$choice2~0_In1210292619} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1210292619|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out1210292619|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1210292619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1210292619, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1210292619, ~weak$$choice2~0=~weak$$choice2~0_In1210292619} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-07 13:17:43,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_9|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 13:17:43,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-60958231 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite23_Out-60958231| |P2Thread1of1ForFork1_#t~ite24_Out-60958231|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-60958231 256)))) (or (= (mod ~z$w_buff0_used~0_In-60958231 256) 0) (and (= (mod ~z$w_buff1_used~0_In-60958231 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In-60958231 256)) .cse1))) (= |P2Thread1of1ForFork1_#t~ite23_Out-60958231| ~z$r_buff1_thd3~0_In-60958231)) (and (= ~z$r_buff1_thd3~0_In-60958231 |P2Thread1of1ForFork1_#t~ite24_Out-60958231|) (= |P2Thread1of1ForFork1_#t~ite23_In-60958231| |P2Thread1of1ForFork1_#t~ite23_Out-60958231|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-60958231, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-60958231, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In-60958231|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-60958231, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-60958231, ~weak$$choice2~0=~weak$$choice2~0_In-60958231} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out-60958231|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-60958231, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-60958231, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out-60958231|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-60958231, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-60958231, ~weak$$choice2~0=~weak$$choice2~0_In-60958231} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-07 13:17:43,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 13:17:43,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1050210907 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-1050210907 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out-1050210907| ~z$w_buff0_used~0_In-1050210907)) (and (not .cse1) (= 0 |P3Thread1of1ForFork2_#t~ite28_Out-1050210907|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1050210907, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1050210907} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1050210907|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1050210907, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1050210907} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 13:17:43,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd4~0_In-1401843794 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1401843794 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-1401843794 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1401843794 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1401843794 |P3Thread1of1ForFork2_#t~ite29_Out-1401843794|)) (and (= |P3Thread1of1ForFork2_#t~ite29_Out-1401843794| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1401843794, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1401843794, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1401843794, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1401843794} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1401843794|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1401843794, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1401843794, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1401843794, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1401843794} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 13:17:43,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In815910660 256) 0)) (.cse0 (= ~z$r_buff0_thd4~0_Out815910660 ~z$r_buff0_thd4~0_In815910660)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In815910660 256)))) (or (and .cse0 .cse1) (and (= ~z$r_buff0_thd4~0_Out815910660 0) (not .cse1) (not .cse2)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In815910660, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In815910660} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In815910660, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out815910660, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out815910660|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-07 13:17:43,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1852831118 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-1852831118 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1852831118 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1852831118 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite31_Out-1852831118|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In-1852831118 |P3Thread1of1ForFork2_#t~ite31_Out-1852831118|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1852831118, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1852831118, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1852831118, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1852831118} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1852831118, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1852831118, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1852831118, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1852831118, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out-1852831118|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 13:17:43,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= |v_P3Thread1of1ForFork2_#t~ite31_42| v_~z$r_buff1_thd4~0_62) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_42|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_41|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 13:17:43,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:17:43,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1376465572 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1376465572 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite37_Out-1376465572| |ULTIMATE.start_main_#t~ite36_Out-1376465572|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-1376465572| ~z$w_buff1~0_In-1376465572) .cse1 (not .cse2)) (and (= ~z~0_In-1376465572 |ULTIMATE.start_main_#t~ite36_Out-1376465572|) (or .cse2 .cse0) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1376465572, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1376465572, ~z$w_buff1~0=~z$w_buff1~0_In-1376465572, ~z~0=~z~0_In-1376465572} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1376465572, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1376465572, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1376465572|, ~z$w_buff1~0=~z$w_buff1~0_In-1376465572, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1376465572|, ~z~0=~z~0_In-1376465572} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 13:17:43,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-484439986 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-484439986 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-484439986 |ULTIMATE.start_main_#t~ite38_Out-484439986|)) (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-484439986|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-484439986, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-484439986} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-484439986, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-484439986, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-484439986|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 13:17:43,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2096769610 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In2096769610 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In2096769610 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In2096769610 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out2096769610| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite39_Out2096769610| ~z$w_buff1_used~0_In2096769610) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2096769610, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2096769610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2096769610} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2096769610, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out2096769610|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2096769610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2096769610} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 13:17:43,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-163914762 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-163914762 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite40_Out-163914762|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-163914762 |ULTIMATE.start_main_#t~ite40_Out-163914762|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-163914762, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-163914762} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-163914762, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-163914762|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-163914762} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:17:43,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In528227422 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In528227422 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In528227422 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In528227422 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite41_Out528227422|)) (and (= ~z$r_buff1_thd0~0_In528227422 |ULTIMATE.start_main_#t~ite41_Out528227422|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In528227422, ~z$w_buff0_used~0=~z$w_buff0_used~0_In528227422, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In528227422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In528227422} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out528227422|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In528227422, ~z$w_buff0_used~0=~z$w_buff0_used~0_In528227422, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In528227422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In528227422} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 13:17:43,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= v_~y~0_25 2) (= 0 v_~__unbuffered_p0_EAX~0_32) (= 0 v_~__unbuffered_p2_EAX~0_16))) 1 0)) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:17:43,775 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_933bdd40-af54-467d-bb08-dc187ad7a996/bin/uautomizer/witness.graphml [2019-12-07 13:17:43,775 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:17:43,776 INFO L168 Benchmark]: Toolchain (without parser) took 17684.85 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 942.5 MB in the beginning and 1.0 GB in the end (delta: -102.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-12-07 13:17:43,776 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:17:43,776 INFO L168 Benchmark]: CACSL2BoogieTranslator took 399.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -130.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 13:17:43,777 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:17:43,777 INFO L168 Benchmark]: Boogie Preprocessor took 26.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:17:43,777 INFO L168 Benchmark]: RCFGBuilder took 403.74 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.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:17:43,777 INFO L168 Benchmark]: TraceAbstraction took 16753.65 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -41.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 13:17:43,778 INFO L168 Benchmark]: Witness Printer took 60.38 ms. Allocated memory is still 2.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:17:43,779 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 399.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -130.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.83 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 26.07 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 403.74 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.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16753.65 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -41.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 60.38 ms. Allocated memory is still 2.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 170 ProgramPointsBefore, 74 ProgramPointsAfterwards, 192 TransitionsBefore, 78 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 23 ChoiceCompositions, 5707 VarBasedMoverChecksPositive, 158 VarBasedMoverChecksNegative, 28 SemBasedMoverChecksPositive, 169 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 44168 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t1045, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1046, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1047, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1048, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L770] 3 y = 2 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, 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] [L777] 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_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, 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] [L777] 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) [L778] 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)) [L779] 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)) [L780] 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)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$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)) [L783] 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)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, 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] [L820] 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) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 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 [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=1, 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] [L855] 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) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 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 [L858] 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, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.5s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2987 SDtfs, 4201 SDslu, 6710 SDs, 0 SdLazy, 2929 SolverSat, 382 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 213 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43523occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 42027 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 737 NumberOfCodeBlocks, 737 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 668 ConstructedInterpolants, 0 QuantifiedInterpolants, 189936 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...