./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix037_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4ef8ff53-ab58-4c88-a80b-cf6ca6fb10db/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4ef8ff53-ab58-4c88-a80b-cf6ca6fb10db/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4ef8ff53-ab58-4c88-a80b-cf6ca6fb10db/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4ef8ff53-ab58-4c88-a80b-cf6ca6fb10db/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix037_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4ef8ff53-ab58-4c88-a80b-cf6ca6fb10db/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4ef8ff53-ab58-4c88-a80b-cf6ca6fb10db/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 1c5053ec830cefcd320dbb25efcd509b117d8e95 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 11:09:58,740 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:09:58,741 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:09:58,748 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:09:58,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:09:58,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:09:58,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:09:58,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:09:58,754 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:09:58,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:09:58,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:09:58,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:09:58,756 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:09:58,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:09:58,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:09:58,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:09:58,759 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:09:58,760 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:09:58,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:09:58,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:09:58,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:09:58,765 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:09:58,765 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:09:58,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:09:58,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:09:58,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:09:58,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:09:58,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:09:58,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:09:58,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:09:58,769 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:09:58,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:09:58,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:09:58,771 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:09:58,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:09:58,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:09:58,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:09:58,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:09:58,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:09:58,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:09:58,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:09:58,775 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4ef8ff53-ab58-4c88-a80b-cf6ca6fb10db/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:09:58,788 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:09:58,788 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:09:58,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:09:58,789 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:09:58,789 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:09:58,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:09:58,790 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:09:58,790 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:09:58,790 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:09:58,790 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:09:58,791 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:09:58,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:09:58,791 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:09:58,791 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:09:58,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:09:58,791 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:09:58,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:09:58,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:09:58,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:09:58,792 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:09:58,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:09:58,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:09:58,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:09:58,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:09:58,793 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:09:58,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:09:58,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:09:58,794 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:09:58,794 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:09:58,794 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_4ef8ff53-ab58-4c88-a80b-cf6ca6fb10db/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 -> 1c5053ec830cefcd320dbb25efcd509b117d8e95 [2019-12-07 11:09:58,905 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:09:58,913 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:09:58,915 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:09:58,916 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:09:58,916 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:09:58,916 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4ef8ff53-ab58-4c88-a80b-cf6ca6fb10db/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix037_pso.opt.i [2019-12-07 11:09:58,955 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4ef8ff53-ab58-4c88-a80b-cf6ca6fb10db/bin/uautomizer/data/da54bbae8/ac5b170d9bbe461ca8c141ed14472534/FLAGd3b0ee86b [2019-12-07 11:09:59,424 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:09:59,424 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4ef8ff53-ab58-4c88-a80b-cf6ca6fb10db/sv-benchmarks/c/pthread-wmm/mix037_pso.opt.i [2019-12-07 11:09:59,434 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4ef8ff53-ab58-4c88-a80b-cf6ca6fb10db/bin/uautomizer/data/da54bbae8/ac5b170d9bbe461ca8c141ed14472534/FLAGd3b0ee86b [2019-12-07 11:09:59,446 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4ef8ff53-ab58-4c88-a80b-cf6ca6fb10db/bin/uautomizer/data/da54bbae8/ac5b170d9bbe461ca8c141ed14472534 [2019-12-07 11:09:59,448 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:09:59,449 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:09:59,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:09:59,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:09:59,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:09:59,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:09:59" (1/1) ... [2019-12-07 11:09:59,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:09:59, skipping insertion in model container [2019-12-07 11:09:59,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:09:59" (1/1) ... [2019-12-07 11:09:59,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:09:59,489 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:09:59,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:09:59,736 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:09:59,779 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:09:59,827 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:09:59,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:09:59 WrapperNode [2019-12-07 11:09:59,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:09:59,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:09:59,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:09:59,828 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:09:59,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:09:59" (1/1) ... [2019-12-07 11:09:59,846 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:09:59" (1/1) ... [2019-12-07 11:09:59,867 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:09:59,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:09:59,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:09:59,868 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:09:59,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:09:59" (1/1) ... [2019-12-07 11:09:59,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:09:59" (1/1) ... [2019-12-07 11:09:59,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:09:59" (1/1) ... [2019-12-07 11:09:59,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:09:59" (1/1) ... [2019-12-07 11:09:59,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:09:59" (1/1) ... [2019-12-07 11:09:59,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:09:59" (1/1) ... [2019-12-07 11:09:59,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:09:59" (1/1) ... [2019-12-07 11:09:59,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:09:59,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:09:59,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:09:59,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:09:59,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:09:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4ef8ff53-ab58-4c88-a80b-cf6ca6fb10db/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 11:09:59,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:09:59,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:09:59,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:09:59,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:09:59,934 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:09:59,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:09:59,935 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:09:59,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:09:59,935 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 11:09:59,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 11:09:59,935 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 11:09:59,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 11:09:59,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:09:59,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:09:59,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:09:59,936 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 11:10:00,287 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:10:00,287 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:10:00,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:10:00 BoogieIcfgContainer [2019-12-07 11:10:00,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:10:00,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:10:00,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:10:00,291 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:10:00,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:09:59" (1/3) ... [2019-12-07 11:10:00,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc88732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:10:00, skipping insertion in model container [2019-12-07 11:10:00,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:09:59" (2/3) ... [2019-12-07 11:10:00,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc88732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:10:00, skipping insertion in model container [2019-12-07 11:10:00,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:10:00" (3/3) ... [2019-12-07 11:10:00,294 INFO L109 eAbstractionObserver]: Analyzing ICFG mix037_pso.opt.i [2019-12-07 11:10:00,300 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:10:00,300 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:10:00,305 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:10:00,305 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:10:00,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,331 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,331 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,332 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,333 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,335 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,335 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,351 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,351 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,351 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,351 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,351 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,351 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,352 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,352 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,352 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,352 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,353 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,353 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,353 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,353 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,353 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,353 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,353 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,354 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,354 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,354 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,354 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,354 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,354 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,355 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,355 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,355 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,355 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,355 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,355 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,356 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,356 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,356 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,356 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,356 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:10:00,372 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 11:10:00,389 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:10:00,389 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:10:00,389 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:10:00,389 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:10:00,389 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:10:00,389 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:10:00,389 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:10:00,389 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:10:00,404 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-07 11:10:00,405 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-07 11:10:00,456 INFO L134 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-07 11:10:00,456 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:10:00,464 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 11:10:00,476 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-07 11:10:00,505 INFO L134 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-07 11:10:00,505 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:10:00,508 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 11:10:00,519 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-07 11:10:00,520 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:10:03,357 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 11:10:03,593 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 11:10:03,698 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44168 [2019-12-07 11:10:03,698 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-07 11:10:03,701 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 78 transitions [2019-12-07 11:10:04,657 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 21398 states. [2019-12-07 11:10:04,658 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states. [2019-12-07 11:10:04,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:10:04,663 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:04,663 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:10:04,663 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 11:10:04,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:04,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1244651740, now seen corresponding path program 1 times [2019-12-07 11:10:04,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:04,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2988974] [2019-12-07 11:10:04,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:04,829 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 11:10:04,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2988974] [2019-12-07 11:10:04,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:04,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:10:04,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690724843] [2019-12-07 11:10:04,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:10:04,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:04,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:10:04,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:10:04,852 INFO L87 Difference]: Start difference. First operand 21398 states. Second operand 3 states. [2019-12-07 11:10:05,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:05,138 INFO L93 Difference]: Finished difference Result 20958 states and 90416 transitions. [2019-12-07 11:10:05,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:10:05,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 11:10:05,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:05,272 INFO L225 Difference]: With dead ends: 20958 [2019-12-07 11:10:05,272 INFO L226 Difference]: Without dead ends: 19662 [2019-12-07 11:10:05,273 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 11:10:05,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-07 11:10:05,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 19662. [2019-12-07 11:10:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-12-07 11:10:05,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 84692 transitions. [2019-12-07 11:10:05,969 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 84692 transitions. Word has length 9 [2019-12-07 11:10:05,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:05,970 INFO L462 AbstractCegarLoop]: Abstraction has 19662 states and 84692 transitions. [2019-12-07 11:10:05,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:10:05,970 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 84692 transitions. [2019-12-07 11:10:05,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 11:10:05,975 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:05,975 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:10:05,976 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 11:10:05,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:05,976 INFO L82 PathProgramCache]: Analyzing trace with hash -6792795, now seen corresponding path program 1 times [2019-12-07 11:10:05,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:05,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586143244] [2019-12-07 11:10:05,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:06,035 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 11:10:06,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586143244] [2019-12-07 11:10:06,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:06,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:10:06,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908208435] [2019-12-07 11:10:06,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:10:06,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:06,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:10:06,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:10:06,037 INFO L87 Difference]: Start difference. First operand 19662 states and 84692 transitions. Second operand 4 states. [2019-12-07 11:10:06,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:06,442 INFO L93 Difference]: Finished difference Result 30494 states and 126452 transitions. [2019-12-07 11:10:06,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:10:06,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 11:10:06,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:06,523 INFO L225 Difference]: With dead ends: 30494 [2019-12-07 11:10:06,523 INFO L226 Difference]: Without dead ends: 30438 [2019-12-07 11:10:06,523 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 11:10:06,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30438 states. [2019-12-07 11:10:07,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30438 to 27742. [2019-12-07 11:10:07,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-12-07 11:10:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 116300 transitions. [2019-12-07 11:10:07,162 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 116300 transitions. Word has length 15 [2019-12-07 11:10:07,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:07,163 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 116300 transitions. [2019-12-07 11:10:07,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:10:07,163 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 116300 transitions. [2019-12-07 11:10:07,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:10:07,169 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:07,169 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 11:10:07,169 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 11:10:07,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:07,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1479332799, now seen corresponding path program 1 times [2019-12-07 11:10:07,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:07,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134220081] [2019-12-07 11:10:07,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:07,244 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 11:10:07,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134220081] [2019-12-07 11:10:07,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:07,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:10:07,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086860296] [2019-12-07 11:10:07,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:10:07,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:07,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:10:07,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:10:07,245 INFO L87 Difference]: Start difference. First operand 27742 states and 116300 transitions. Second operand 4 states. [2019-12-07 11:10:07,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:07,562 INFO L93 Difference]: Finished difference Result 35230 states and 146308 transitions. [2019-12-07 11:10:07,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:10:07,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 11:10:07,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:07,642 INFO L225 Difference]: With dead ends: 35230 [2019-12-07 11:10:07,642 INFO L226 Difference]: Without dead ends: 35182 [2019-12-07 11:10:07,642 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 11:10:07,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-12-07 11:10:08,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 30378. [2019-12-07 11:10:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30378 states. [2019-12-07 11:10:08,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30378 states to 30378 states and 127172 transitions. [2019-12-07 11:10:08,367 INFO L78 Accepts]: Start accepts. Automaton has 30378 states and 127172 transitions. Word has length 18 [2019-12-07 11:10:08,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:08,367 INFO L462 AbstractCegarLoop]: Abstraction has 30378 states and 127172 transitions. [2019-12-07 11:10:08,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:10:08,367 INFO L276 IsEmpty]: Start isEmpty. Operand 30378 states and 127172 transitions. [2019-12-07 11:10:08,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 11:10:08,375 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:08,375 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 11:10:08,375 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 11:10:08,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:08,376 INFO L82 PathProgramCache]: Analyzing trace with hash -45820751, now seen corresponding path program 1 times [2019-12-07 11:10:08,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:08,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282993396] [2019-12-07 11:10:08,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:08,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:10:08,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282993396] [2019-12-07 11:10:08,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:08,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:10:08,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295415936] [2019-12-07 11:10:08,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:10:08,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:08,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:10:08,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:10:08,436 INFO L87 Difference]: Start difference. First operand 30378 states and 127172 transitions. Second operand 4 states. [2019-12-07 11:10:08,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:08,548 INFO L93 Difference]: Finished difference Result 26024 states and 100213 transitions. [2019-12-07 11:10:08,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:10:08,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 11:10:08,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:08,594 INFO L225 Difference]: With dead ends: 26024 [2019-12-07 11:10:08,594 INFO L226 Difference]: Without dead ends: 24072 [2019-12-07 11:10:08,594 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 11:10:08,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24072 states. [2019-12-07 11:10:08,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24072 to 24072. [2019-12-07 11:10:08,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24072 states. [2019-12-07 11:10:09,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24072 states to 24072 states and 93462 transitions. [2019-12-07 11:10:09,012 INFO L78 Accepts]: Start accepts. Automaton has 24072 states and 93462 transitions. Word has length 20 [2019-12-07 11:10:09,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:09,012 INFO L462 AbstractCegarLoop]: Abstraction has 24072 states and 93462 transitions. [2019-12-07 11:10:09,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:10:09,012 INFO L276 IsEmpty]: Start isEmpty. Operand 24072 states and 93462 transitions. [2019-12-07 11:10:09,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 11:10:09,017 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:09,017 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 11:10:09,017 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 11:10:09,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:09,018 INFO L82 PathProgramCache]: Analyzing trace with hash -129088173, now seen corresponding path program 1 times [2019-12-07 11:10:09,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:09,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593917670] [2019-12-07 11:10:09,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:09,070 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 11:10:09,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593917670] [2019-12-07 11:10:09,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:09,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:10:09,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067845833] [2019-12-07 11:10:09,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:10:09,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:09,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:10:09,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:10:09,072 INFO L87 Difference]: Start difference. First operand 24072 states and 93462 transitions. Second operand 5 states. [2019-12-07 11:10:09,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:09,219 INFO L93 Difference]: Finished difference Result 12278 states and 40771 transitions. [2019-12-07 11:10:09,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:10:09,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-07 11:10:09,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:09,233 INFO L225 Difference]: With dead ends: 12278 [2019-12-07 11:10:09,233 INFO L226 Difference]: Without dead ends: 10729 [2019-12-07 11:10:09,234 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 11:10:09,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10729 states. [2019-12-07 11:10:09,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10729 to 10729. [2019-12-07 11:10:09,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10729 states. [2019-12-07 11:10:09,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10729 states to 10729 states and 35320 transitions. [2019-12-07 11:10:09,380 INFO L78 Accepts]: Start accepts. Automaton has 10729 states and 35320 transitions. Word has length 21 [2019-12-07 11:10:09,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:09,381 INFO L462 AbstractCegarLoop]: Abstraction has 10729 states and 35320 transitions. [2019-12-07 11:10:09,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:10:09,381 INFO L276 IsEmpty]: Start isEmpty. Operand 10729 states and 35320 transitions. [2019-12-07 11:10:09,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:10:09,383 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:09,383 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:10:09,384 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 11:10:09,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:09,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2097022487, now seen corresponding path program 1 times [2019-12-07 11:10:09,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:09,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543575349] [2019-12-07 11:10:09,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:09,421 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 11:10:09,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543575349] [2019-12-07 11:10:09,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:09,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:10:09,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070930100] [2019-12-07 11:10:09,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:10:09,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:09,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:10:09,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:10:09,422 INFO L87 Difference]: Start difference. First operand 10729 states and 35320 transitions. Second operand 3 states. [2019-12-07 11:10:09,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:09,471 INFO L93 Difference]: Finished difference Result 10729 states and 34882 transitions. [2019-12-07 11:10:09,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:10:09,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 11:10:09,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:09,486 INFO L225 Difference]: With dead ends: 10729 [2019-12-07 11:10:09,486 INFO L226 Difference]: Without dead ends: 10729 [2019-12-07 11:10:09,487 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 11:10:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10729 states. [2019-12-07 11:10:09,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10729 to 10431. [2019-12-07 11:10:09,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10431 states. [2019-12-07 11:10:09,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10431 states to 10431 states and 33896 transitions. [2019-12-07 11:10:09,635 INFO L78 Accepts]: Start accepts. Automaton has 10431 states and 33896 transitions. Word has length 22 [2019-12-07 11:10:09,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:09,635 INFO L462 AbstractCegarLoop]: Abstraction has 10431 states and 33896 transitions. [2019-12-07 11:10:09,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:10:09,635 INFO L276 IsEmpty]: Start isEmpty. Operand 10431 states and 33896 transitions. [2019-12-07 11:10:09,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:10:09,638 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:09,638 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 11:10:09,638 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 11:10:09,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:09,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1838174912, now seen corresponding path program 1 times [2019-12-07 11:10:09,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:09,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416357616] [2019-12-07 11:10:09,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:09,696 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 11:10:09,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416357616] [2019-12-07 11:10:09,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:09,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:10:09,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920261322] [2019-12-07 11:10:09,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:10:09,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:09,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:10:09,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:10:09,698 INFO L87 Difference]: Start difference. First operand 10431 states and 33896 transitions. Second operand 6 states. [2019-12-07 11:10:09,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:09,756 INFO L93 Difference]: Finished difference Result 3272 states and 10004 transitions. [2019-12-07 11:10:09,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:10:09,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 11:10:09,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:09,760 INFO L225 Difference]: With dead ends: 3272 [2019-12-07 11:10:09,760 INFO L226 Difference]: Without dead ends: 2708 [2019-12-07 11:10:09,760 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 11:10:09,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states. [2019-12-07 11:10:09,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2708. [2019-12-07 11:10:09,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2708 states. [2019-12-07 11:10:09,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 8195 transitions. [2019-12-07 11:10:09,786 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 8195 transitions. Word has length 22 [2019-12-07 11:10:09,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:09,787 INFO L462 AbstractCegarLoop]: Abstraction has 2708 states and 8195 transitions. [2019-12-07 11:10:09,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:10:09,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 8195 transitions. [2019-12-07 11:10:09,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 11:10:09,789 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:09,790 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 11:10:09,790 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 11:10:09,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:09,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1619810495, now seen corresponding path program 1 times [2019-12-07 11:10:09,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:09,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532666307] [2019-12-07 11:10:09,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:09,822 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 11:10:09,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532666307] [2019-12-07 11:10:09,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:09,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:10:09,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755575992] [2019-12-07 11:10:09,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:10:09,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:09,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:10:09,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:10:09,824 INFO L87 Difference]: Start difference. First operand 2708 states and 8195 transitions. Second operand 3 states. [2019-12-07 11:10:09,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:09,869 INFO L93 Difference]: Finished difference Result 4106 states and 12338 transitions. [2019-12-07 11:10:09,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:10:09,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 11:10:09,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:09,876 INFO L225 Difference]: With dead ends: 4106 [2019-12-07 11:10:09,876 INFO L226 Difference]: Without dead ends: 4106 [2019-12-07 11:10:09,877 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 11:10:09,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2019-12-07 11:10:09,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 3200. [2019-12-07 11:10:09,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3200 states. [2019-12-07 11:10:09,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3200 states to 3200 states and 9811 transitions. [2019-12-07 11:10:09,921 INFO L78 Accepts]: Start accepts. Automaton has 3200 states and 9811 transitions. Word has length 32 [2019-12-07 11:10:09,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:09,921 INFO L462 AbstractCegarLoop]: Abstraction has 3200 states and 9811 transitions. [2019-12-07 11:10:09,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:10:09,922 INFO L276 IsEmpty]: Start isEmpty. Operand 3200 states and 9811 transitions. [2019-12-07 11:10:09,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 11:10:09,925 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:09,926 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 11:10:09,926 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 11:10:09,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:09,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1082300219, now seen corresponding path program 1 times [2019-12-07 11:10:09,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:09,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372659146] [2019-12-07 11:10:09,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:09,985 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 11:10:09,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372659146] [2019-12-07 11:10:09,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:09,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:10:09,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556642077] [2019-12-07 11:10:09,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:10:09,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:09,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:10:09,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:10:09,987 INFO L87 Difference]: Start difference. First operand 3200 states and 9811 transitions. Second operand 6 states. [2019-12-07 11:10:10,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:10,287 INFO L93 Difference]: Finished difference Result 6768 states and 19665 transitions. [2019-12-07 11:10:10,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:10:10,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-07 11:10:10,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:10,297 INFO L225 Difference]: With dead ends: 6768 [2019-12-07 11:10:10,298 INFO L226 Difference]: Without dead ends: 6764 [2019-12-07 11:10:10,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:10:10,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6764 states. [2019-12-07 11:10:10,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6764 to 3476. [2019-12-07 11:10:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3476 states. [2019-12-07 11:10:10,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 10586 transitions. [2019-12-07 11:10:10,347 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 10586 transitions. Word has length 32 [2019-12-07 11:10:10,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:10,347 INFO L462 AbstractCegarLoop]: Abstraction has 3476 states and 10586 transitions. [2019-12-07 11:10:10,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:10:10,347 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 10586 transitions. [2019-12-07 11:10:10,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 11:10:10,350 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:10,351 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:10:10,351 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 11:10:10,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:10,351 INFO L82 PathProgramCache]: Analyzing trace with hash -345264620, now seen corresponding path program 1 times [2019-12-07 11:10:10,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:10,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874945943] [2019-12-07 11:10:10,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:10,420 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 11:10:10,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874945943] [2019-12-07 11:10:10,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:10,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:10:10,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470848426] [2019-12-07 11:10:10,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:10:10,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:10,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:10:10,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:10:10,421 INFO L87 Difference]: Start difference. First operand 3476 states and 10586 transitions. Second operand 6 states. [2019-12-07 11:10:10,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:10,697 INFO L93 Difference]: Finished difference Result 6621 states and 19118 transitions. [2019-12-07 11:10:10,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:10:10,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 11:10:10,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:10,703 INFO L225 Difference]: With dead ends: 6621 [2019-12-07 11:10:10,703 INFO L226 Difference]: Without dead ends: 6619 [2019-12-07 11:10:10,704 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 11:10:10,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6619 states. [2019-12-07 11:10:10,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6619 to 3328. [2019-12-07 11:10:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3328 states. [2019-12-07 11:10:10,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3328 states to 3328 states and 10212 transitions. [2019-12-07 11:10:10,748 INFO L78 Accepts]: Start accepts. Automaton has 3328 states and 10212 transitions. Word has length 33 [2019-12-07 11:10:10,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:10,749 INFO L462 AbstractCegarLoop]: Abstraction has 3328 states and 10212 transitions. [2019-12-07 11:10:10,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:10:10,749 INFO L276 IsEmpty]: Start isEmpty. Operand 3328 states and 10212 transitions. [2019-12-07 11:10:10,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 11:10:10,752 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:10,752 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 11:10:10,752 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 11:10:10,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:10,752 INFO L82 PathProgramCache]: Analyzing trace with hash 452387979, now seen corresponding path program 1 times [2019-12-07 11:10:10,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:10,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396310892] [2019-12-07 11:10:10,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:10,814 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 11:10:10,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396310892] [2019-12-07 11:10:10,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:10,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:10:10,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022865490] [2019-12-07 11:10:10,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:10:10,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:10,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:10:10,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:10:10,815 INFO L87 Difference]: Start difference. First operand 3328 states and 10212 transitions. Second operand 7 states. [2019-12-07 11:10:10,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:10,886 INFO L93 Difference]: Finished difference Result 2519 states and 8206 transitions. [2019-12-07 11:10:10,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:10:10,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 11:10:10,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:10,889 INFO L225 Difference]: With dead ends: 2519 [2019-12-07 11:10:10,889 INFO L226 Difference]: Without dead ends: 2442 [2019-12-07 11:10:10,889 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 11:10:10,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2019-12-07 11:10:10,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2370. [2019-12-07 11:10:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2370 states. [2019-12-07 11:10:10,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 7792 transitions. [2019-12-07 11:10:10,915 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 7792 transitions. Word has length 33 [2019-12-07 11:10:10,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:10,915 INFO L462 AbstractCegarLoop]: Abstraction has 2370 states and 7792 transitions. [2019-12-07 11:10:10,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:10:10,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 7792 transitions. [2019-12-07 11:10:10,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 11:10:10,919 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:10,919 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 11:10:10,919 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 11:10:10,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:10,919 INFO L82 PathProgramCache]: Analyzing trace with hash -754041251, now seen corresponding path program 1 times [2019-12-07 11:10:10,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:10,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347186215] [2019-12-07 11:10:10,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:10,990 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 11:10:10,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347186215] [2019-12-07 11:10:10,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:10,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:10:10,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338202165] [2019-12-07 11:10:10,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:10:10,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:10,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:10:10,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:10:10,991 INFO L87 Difference]: Start difference. First operand 2370 states and 7792 transitions. Second operand 6 states. [2019-12-07 11:10:11,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:11,211 INFO L93 Difference]: Finished difference Result 9526 states and 29591 transitions. [2019-12-07 11:10:11,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:10:11,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-12-07 11:10:11,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:11,220 INFO L225 Difference]: With dead ends: 9526 [2019-12-07 11:10:11,220 INFO L226 Difference]: Without dead ends: 7666 [2019-12-07 11:10:11,220 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 11:10:11,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7666 states. [2019-12-07 11:10:11,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7666 to 3194. [2019-12-07 11:10:11,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3194 states. [2019-12-07 11:10:11,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 10217 transitions. [2019-12-07 11:10:11,274 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 10217 transitions. Word has length 48 [2019-12-07 11:10:11,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:11,274 INFO L462 AbstractCegarLoop]: Abstraction has 3194 states and 10217 transitions. [2019-12-07 11:10:11,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:10:11,274 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 10217 transitions. [2019-12-07 11:10:11,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 11:10:11,279 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:11,279 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 11:10:11,279 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 11:10:11,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:11,280 INFO L82 PathProgramCache]: Analyzing trace with hash -231356835, now seen corresponding path program 2 times [2019-12-07 11:10:11,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:11,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010429493] [2019-12-07 11:10:11,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:11,358 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 11:10:11,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010429493] [2019-12-07 11:10:11,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:11,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:10:11,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012988500] [2019-12-07 11:10:11,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:10:11,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:11,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:10:11,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:10:11,359 INFO L87 Difference]: Start difference. First operand 3194 states and 10217 transitions. Second operand 5 states. [2019-12-07 11:10:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:11,398 INFO L93 Difference]: Finished difference Result 5235 states and 15549 transitions. [2019-12-07 11:10:11,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:10:11,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-07 11:10:11,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:11,402 INFO L225 Difference]: With dead ends: 5235 [2019-12-07 11:10:11,402 INFO L226 Difference]: Without dead ends: 3428 [2019-12-07 11:10:11,403 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 11:10:11,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3428 states. [2019-12-07 11:10:11,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3428 to 2898. [2019-12-07 11:10:11,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2898 states. [2019-12-07 11:10:11,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 9136 transitions. [2019-12-07 11:10:11,436 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 9136 transitions. Word has length 48 [2019-12-07 11:10:11,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:11,437 INFO L462 AbstractCegarLoop]: Abstraction has 2898 states and 9136 transitions. [2019-12-07 11:10:11,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:10:11,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 9136 transitions. [2019-12-07 11:10:11,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 11:10:11,440 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:11,441 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 11:10:11,441 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 11:10:11,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:11,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1878148035, now seen corresponding path program 3 times [2019-12-07 11:10:11,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:11,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265738289] [2019-12-07 11:10:11,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:11,496 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 11:10:11,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265738289] [2019-12-07 11:10:11,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:11,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:10:11,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459633795] [2019-12-07 11:10:11,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:10:11,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:11,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:10:11,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:10:11,498 INFO L87 Difference]: Start difference. First operand 2898 states and 9136 transitions. Second operand 4 states. [2019-12-07 11:10:11,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:11,517 INFO L93 Difference]: Finished difference Result 3450 states and 10403 transitions. [2019-12-07 11:10:11,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:10:11,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 11:10:11,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:11,520 INFO L225 Difference]: With dead ends: 3450 [2019-12-07 11:10:11,520 INFO L226 Difference]: Without dead ends: 2299 [2019-12-07 11:10:11,520 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 11:10:11,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2019-12-07 11:10:11,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 2299. [2019-12-07 11:10:11,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2299 states. [2019-12-07 11:10:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 6689 transitions. [2019-12-07 11:10:11,545 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 6689 transitions. Word has length 48 [2019-12-07 11:10:11,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:11,545 INFO L462 AbstractCegarLoop]: Abstraction has 2299 states and 6689 transitions. [2019-12-07 11:10:11,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:10:11,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 6689 transitions. [2019-12-07 11:10:11,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 11:10:11,548 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:11,548 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 11:10:11,548 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 11:10:11,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:11,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1908529501, now seen corresponding path program 4 times [2019-12-07 11:10:11,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:11,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036732034] [2019-12-07 11:10:11,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:11,620 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 11:10:11,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036732034] [2019-12-07 11:10:11,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:11,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:10:11,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113750907] [2019-12-07 11:10:11,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:10:11,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:11,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:10:11,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:10:11,622 INFO L87 Difference]: Start difference. First operand 2299 states and 6689 transitions. Second operand 7 states. [2019-12-07 11:10:11,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:11,857 INFO L93 Difference]: Finished difference Result 4402 states and 12500 transitions. [2019-12-07 11:10:11,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 11:10:11,857 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-07 11:10:11,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:11,860 INFO L225 Difference]: With dead ends: 4402 [2019-12-07 11:10:11,861 INFO L226 Difference]: Without dead ends: 3230 [2019-12-07 11:10:11,861 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:10:11,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2019-12-07 11:10:11,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 1755. [2019-12-07 11:10:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1755 states. [2019-12-07 11:10:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 5105 transitions. [2019-12-07 11:10:11,883 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 5105 transitions. Word has length 48 [2019-12-07 11:10:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:11,883 INFO L462 AbstractCegarLoop]: Abstraction has 1755 states and 5105 transitions. [2019-12-07 11:10:11,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:10:11,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 5105 transitions. [2019-12-07 11:10:11,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 11:10:11,885 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:11,885 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 11:10:11,886 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 11:10:11,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:11,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1923718495, now seen corresponding path program 5 times [2019-12-07 11:10:11,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:11,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375455355] [2019-12-07 11:10:11,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:12,085 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 11:10:12,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375455355] [2019-12-07 11:10:12,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:12,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 11:10:12,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355335996] [2019-12-07 11:10:12,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:10:12,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:12,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:10:12,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:10:12,086 INFO L87 Difference]: Start difference. First operand 1755 states and 5105 transitions. Second operand 12 states. [2019-12-07 11:10:13,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:13,549 INFO L93 Difference]: Finished difference Result 3685 states and 10444 transitions. [2019-12-07 11:10:13,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 11:10:13,550 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-07 11:10:13,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:13,554 INFO L225 Difference]: With dead ends: 3685 [2019-12-07 11:10:13,554 INFO L226 Difference]: Without dead ends: 3616 [2019-12-07 11:10:13,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=259, Invalid=863, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 11:10:13,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3616 states. [2019-12-07 11:10:13,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3616 to 1786. [2019-12-07 11:10:13,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1786 states. [2019-12-07 11:10:13,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 5206 transitions. [2019-12-07 11:10:13,578 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 5206 transitions. Word has length 48 [2019-12-07 11:10:13,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:13,578 INFO L462 AbstractCegarLoop]: Abstraction has 1786 states and 5206 transitions. [2019-12-07 11:10:13,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:10:13,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 5206 transitions. [2019-12-07 11:10:13,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 11:10:13,580 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:13,580 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 11:10:13,580 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 11:10:13,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:13,580 INFO L82 PathProgramCache]: Analyzing trace with hash -507128511, now seen corresponding path program 6 times [2019-12-07 11:10:13,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:13,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966636036] [2019-12-07 11:10:13,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:13,625 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 11:10:13,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966636036] [2019-12-07 11:10:13,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:13,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:10:13,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700598275] [2019-12-07 11:10:13,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:10:13,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:13,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:10:13,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:10:13,626 INFO L87 Difference]: Start difference. First operand 1786 states and 5206 transitions. Second operand 4 states. [2019-12-07 11:10:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:13,651 INFO L93 Difference]: Finished difference Result 2242 states and 6232 transitions. [2019-12-07 11:10:13,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:10:13,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 11:10:13,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:13,651 INFO L225 Difference]: With dead ends: 2242 [2019-12-07 11:10:13,652 INFO L226 Difference]: Without dead ends: 504 [2019-12-07 11:10:13,652 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 11:10:13,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-12-07 11:10:13,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-12-07 11:10:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-12-07 11:10:13,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1111 transitions. [2019-12-07 11:10:13,656 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1111 transitions. Word has length 48 [2019-12-07 11:10:13,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:13,656 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 1111 transitions. [2019-12-07 11:10:13,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:10:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1111 transitions. [2019-12-07 11:10:13,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 11:10:13,657 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:13,657 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 11:10:13,657 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 11:10:13,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:13,658 INFO L82 PathProgramCache]: Analyzing trace with hash -126758993, now seen corresponding path program 7 times [2019-12-07 11:10:13,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:13,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224127874] [2019-12-07 11:10:13,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:10:13,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224127874] [2019-12-07 11:10:13,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:13,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:10:13,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622029837] [2019-12-07 11:10:13,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:10:13,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:10:13,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:10:13,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:10:13,704 INFO L87 Difference]: Start difference. First operand 504 states and 1111 transitions. Second operand 7 states. [2019-12-07 11:10:13,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:13,800 INFO L93 Difference]: Finished difference Result 892 states and 1938 transitions. [2019-12-07 11:10:13,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:10:13,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-07 11:10:13,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:13,801 INFO L225 Difference]: With dead ends: 892 [2019-12-07 11:10:13,801 INFO L226 Difference]: Without dead ends: 594 [2019-12-07 11:10:13,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:10:13,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-12-07 11:10:13,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 536. [2019-12-07 11:10:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-07 11:10:13,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1171 transitions. [2019-12-07 11:10:13,806 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1171 transitions. Word has length 48 [2019-12-07 11:10:13,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:13,806 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1171 transitions. [2019-12-07 11:10:13,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:10:13,806 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1171 transitions. [2019-12-07 11:10:13,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 11:10:13,807 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:13,807 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 11:10:13,807 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 11:10:13,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:13,807 INFO L82 PathProgramCache]: Analyzing trace with hash 24927743, now seen corresponding path program 8 times [2019-12-07 11:10:13,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:10:13,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149923552] [2019-12-07 11:10:13,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:10:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:10:13,871 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:10:13,871 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:10:13,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_107| 0 0))) (and (= v_~x~0_71 0) (= 0 v_~weak$$choice0~0_10) (= v_~z$w_buff0_used~0_514 0) (= 0 v_~z$r_buff1_thd3~0_207) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_44 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~z$flush_delayed~0_37) (= v_~z$mem_tmp~0_16 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t981~0.base_59| 4)) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= (select .cse0 |v_ULTIMATE.start_main_~#t981~0.base_59|) 0) (= v_~y~0_19 0) (= v_~z$w_buff0~0_183 0) (= 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) (= 0 v_~__unbuffered_p3_EAX~0_87) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t981~0.base_59|) (= |v_#memory_int_27| (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t981~0.base_59| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t981~0.base_59|) |v_ULTIMATE.start_main_~#t981~0.offset_37| 0))) (= v_~z$r_buff0_thd2~0_57 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd0~0_132 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_116 0) (= 0 v_~__unbuffered_p2_EAX~0_54) (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~z$r_buff0_thd3~0_266) (= 0 v_~__unbuffered_p3_EBX~0_88) (= |v_#valid_105| (store .cse0 |v_ULTIMATE.start_main_~#t981~0.base_59| 1)) (= 0 v_~weak$$choice2~0_95) (= v_~z$w_buff1_used~0_298 0) (= 0 |v_#NULL.base_5|) (= v_~z$w_buff1~0_123 0) (= v_~b~0_79 0) (= |v_ULTIMATE.start_main_~#t981~0.offset_37| 0) (= v_~__unbuffered_cnt~0_126 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_107|, #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|, ULTIMATE.start_main_~#t981~0.offset=|v_ULTIMATE.start_main_~#t981~0.offset_37|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_87, #length=|v_#length_31|, ULTIMATE.start_main_~#t984~0.offset=|v_ULTIMATE.start_main_~#t984~0.offset_22|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ~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_37, ULTIMATE.start_main_~#t983~0.base=|v_ULTIMATE.start_main_~#t983~0.base_32|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ULTIMATE.start_main_~#t984~0.base=|v_ULTIMATE.start_main_~#t984~0.base_32|, ~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, ~x~0=v_~x~0_71, ULTIMATE.start_main_~#t982~0.base=|v_ULTIMATE.start_main_~#t982~0.base_56|, ~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_#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_44, ~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_132, ~y~0=v_~y~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ULTIMATE.start_main_~#t983~0.offset=|v_ULTIMATE.start_main_~#t983~0.offset_23|, ~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_207, 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_88, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t982~0.offset=|v_ULTIMATE.start_main_~#t982~0.offset_35|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_91|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_38|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~#t981~0.base=|v_ULTIMATE.start_main_~#t981~0.base_59|, ~z~0=v_~z~0_116, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t981~0.offset, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t984~0.offset, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t983~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t984~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t982~0.base, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t983~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_~#t982~0.offset, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t981~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 11:10:13,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t982~0.base_11|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t982~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t982~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t982~0.base_11| 0)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t982~0.base_11|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t982~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t982~0.base_11|) |v_ULTIMATE.start_main_~#t982~0.offset_10| 1)) |v_#memory_int_19|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t982~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_~#t982~0.base=|v_ULTIMATE.start_main_~#t982~0.base_11|, ULTIMATE.start_main_~#t982~0.offset=|v_ULTIMATE.start_main_~#t982~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t982~0.base, ULTIMATE.start_main_~#t982~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 11:10:13,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t983~0.base_12|)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t983~0.base_12| 1) |v_#valid_46|) (not (= 0 |v_ULTIMATE.start_main_~#t983~0.base_12|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t983~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t983~0.base_12|) |v_ULTIMATE.start_main_~#t983~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t983~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t983~0.offset_11|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t983~0.base_12| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t983~0.offset=|v_ULTIMATE.start_main_~#t983~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|, ULTIMATE.start_main_~#t983~0.base=|v_ULTIMATE.start_main_~#t983~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t983~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t983~0.base] because there is no mapped edge [2019-12-07 11:10:13,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t984~0.base_12|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t984~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t984~0.base_12|) |v_ULTIMATE.start_main_~#t984~0.offset_10| 3)) |v_#memory_int_15|) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t984~0.base_12|) 0) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t984~0.base_12| 1)) (not (= |v_ULTIMATE.start_main_~#t984~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t984~0.offset_10|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t984~0.base_12| 4))) 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|, ULTIMATE.start_main_~#t984~0.base=|v_ULTIMATE.start_main_~#t984~0.base_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t984~0.offset=|v_ULTIMATE.start_main_~#t984~0.offset_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t984~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t984~0.offset, #length] because there is no mapped edge [2019-12-07 11:10:13,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~z$r_buff1_thd0~0_Out1179349087 ~z$r_buff0_thd0~0_In1179349087) (= 1 ~z$r_buff0_thd4~0_Out1179349087) (= ~z$r_buff0_thd4~0_In1179349087 ~z$r_buff1_thd4~0_Out1179349087) (= ~__unbuffered_p3_EAX~0_Out1179349087 ~a~0_Out1179349087) (= 1 ~a~0_Out1179349087) (= ~b~0_In1179349087 ~__unbuffered_p3_EBX~0_Out1179349087) (= ~z$r_buff1_thd3~0_Out1179349087 ~z$r_buff0_thd3~0_In1179349087) (= ~z$r_buff0_thd1~0_In1179349087 ~z$r_buff1_thd1~0_Out1179349087) (= ~z$r_buff0_thd2~0_In1179349087 ~z$r_buff1_thd2~0_Out1179349087) (not (= P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1179349087 0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1179349087, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1179349087, ~b~0=~b~0_In1179349087, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1179349087, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1179349087, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1179349087, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1179349087} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1179349087, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1179349087, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1179349087, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1179349087, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out1179349087, ~a~0=~a~0_Out1179349087, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1179349087, ~b~0=~b~0_In1179349087, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1179349087, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1179349087, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out1179349087, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1179349087, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1179349087, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1179349087, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1179349087} 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 11:10:13,876 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_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_20) (= v_~x~0_36 1) (= 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|} OutVars{~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_36} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 11:10:13,876 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_~y~0_15 v_~__unbuffered_p1_EAX~0_14) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x~0_23 2) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 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, ~y~0=v_~y~0_15} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, 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_15, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 11:10:13,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In759781224 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite9_Out759781224| ~z$w_buff0~0_In759781224) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite8_In759781224| |P2Thread1of1ForFork1_#t~ite8_Out759781224|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In759781224 256)))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In759781224 256))) (= 0 (mod ~z$w_buff0_used~0_In759781224 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In759781224 256))))) .cse0 (= |P2Thread1of1ForFork1_#t~ite9_Out759781224| |P2Thread1of1ForFork1_#t~ite8_Out759781224|) (= |P2Thread1of1ForFork1_#t~ite8_Out759781224| ~z$w_buff0~0_In759781224)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In759781224, ~z$w_buff0_used~0=~z$w_buff0_used~0_In759781224, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In759781224, ~z$w_buff1_used~0=~z$w_buff1_used~0_In759781224, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In759781224, ~weak$$choice2~0=~weak$$choice2~0_In759781224, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In759781224|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In759781224, ~z$w_buff0_used~0=~z$w_buff0_used~0_In759781224, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In759781224, ~z$w_buff1_used~0=~z$w_buff1_used~0_In759781224, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In759781224, ~weak$$choice2~0=~weak$$choice2~0_In759781224, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out759781224|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out759781224|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 11:10:13,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1173370317 256)))) (or (and (= ~z$w_buff1~0_In1173370317 |P2Thread1of1ForFork1_#t~ite11_Out1173370317|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1173370317 256) 0))) (or (and (= (mod ~z$r_buff1_thd3~0_In1173370317 256) 0) .cse0) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In1173370317 256))) (= 0 (mod ~z$w_buff0_used~0_In1173370317 256)))) (= |P2Thread1of1ForFork1_#t~ite12_Out1173370317| |P2Thread1of1ForFork1_#t~ite11_Out1173370317|) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite12_Out1173370317| ~z$w_buff1~0_In1173370317) (= |P2Thread1of1ForFork1_#t~ite11_In1173370317| |P2Thread1of1ForFork1_#t~ite11_Out1173370317|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1173370317, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1173370317, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In1173370317|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1173370317, ~z$w_buff1~0=~z$w_buff1~0_In1173370317, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1173370317, ~weak$$choice2~0=~weak$$choice2~0_In1173370317} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1173370317, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1173370317|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1173370317, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1173370317|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1173370317, ~z$w_buff1~0=~z$w_buff1~0_In1173370317, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1173370317, ~weak$$choice2~0=~weak$$choice2~0_In1173370317} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 11:10:13,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1405101165 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1405101165 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1405101165 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1405101165 256))) (and (= 0 (mod ~z$w_buff1_used~0_In1405101165 256)) .cse1))) (= |P2Thread1of1ForFork1_#t~ite14_Out1405101165| |P2Thread1of1ForFork1_#t~ite15_Out1405101165|) (= |P2Thread1of1ForFork1_#t~ite14_Out1405101165| ~z$w_buff0_used~0_In1405101165)) (and (not .cse0) (= ~z$w_buff0_used~0_In1405101165 |P2Thread1of1ForFork1_#t~ite15_Out1405101165|) (= |P2Thread1of1ForFork1_#t~ite14_In1405101165| |P2Thread1of1ForFork1_#t~ite14_Out1405101165|)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In1405101165|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1405101165, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1405101165, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1405101165, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1405101165, ~weak$$choice2~0=~weak$$choice2~0_In1405101165} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1405101165|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out1405101165|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1405101165, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1405101165, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1405101165, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1405101165, ~weak$$choice2~0=~weak$$choice2~0_In1405101165} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-07 11:10:13,879 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 11:10:13,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In660635871 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite23_Out660635871| ~z$r_buff1_thd3~0_In660635871) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In660635871 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In660635871 256)) .cse0) (= (mod ~z$w_buff0_used~0_In660635871 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In660635871 256)) .cse0))) (= |P2Thread1of1ForFork1_#t~ite24_Out660635871| |P2Thread1of1ForFork1_#t~ite23_Out660635871|) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite24_Out660635871| ~z$r_buff1_thd3~0_In660635871) (= |P2Thread1of1ForFork1_#t~ite23_In660635871| |P2Thread1of1ForFork1_#t~ite23_Out660635871|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In660635871, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In660635871, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In660635871|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In660635871, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In660635871, ~weak$$choice2~0=~weak$$choice2~0_In660635871} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out660635871|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In660635871, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In660635871, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out660635871|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In660635871, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In660635871, ~weak$$choice2~0=~weak$$choice2~0_In660635871} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-07 11:10:13,880 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 11:10:13,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In439984207 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In439984207 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In439984207 |P3Thread1of1ForFork2_#t~ite28_Out439984207|)) (and (not .cse1) (not .cse0) (= 0 |P3Thread1of1ForFork2_#t~ite28_Out439984207|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In439984207, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In439984207} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out439984207|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In439984207, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In439984207} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 11:10:13,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-854036548 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-854036548 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-854036548 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-854036548 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite29_Out-854036548| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite29_Out-854036548| ~z$w_buff1_used~0_In-854036548)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-854036548, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-854036548, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-854036548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-854036548} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-854036548|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-854036548, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-854036548, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-854036548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-854036548} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 11:10:13,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1115521006 256))) (.cse2 (= ~z$r_buff0_thd4~0_Out1115521006 ~z$r_buff0_thd4~0_In1115521006)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In1115521006 256) 0))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out1115521006) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1115521006, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1115521006} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1115521006, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1115521006, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out1115521006|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-07 11:10:13,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In1325027743 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1325027743 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1325027743 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd4~0_In1325027743 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite31_Out1325027743| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite31_Out1325027743| ~z$r_buff1_thd4~0_In1325027743)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1325027743, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1325027743, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1325027743, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1325027743} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1325027743, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1325027743, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1325027743, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1325027743, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out1325027743|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 11:10:13,881 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 11:10:13,882 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 11:10:13,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite37_Out335686140| |ULTIMATE.start_main_#t~ite36_Out335686140|)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In335686140 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In335686140 256) 0))) (or (and (= ~z~0_In335686140 |ULTIMATE.start_main_#t~ite36_Out335686140|) (or .cse0 .cse1) .cse2) (and .cse2 (not .cse0) (= ~z$w_buff1~0_In335686140 |ULTIMATE.start_main_#t~ite36_Out335686140|) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In335686140, ~z$w_buff1_used~0=~z$w_buff1_used~0_In335686140, ~z$w_buff1~0=~z$w_buff1~0_In335686140, ~z~0=~z~0_In335686140} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In335686140, ~z$w_buff1_used~0=~z$w_buff1_used~0_In335686140, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out335686140|, ~z$w_buff1~0=~z$w_buff1~0_In335686140, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out335686140|, ~z~0=~z~0_In335686140} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 11:10:13,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1860948 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1860948 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out1860948| ~z$w_buff0_used~0_In1860948)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out1860948| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1860948, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1860948} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1860948, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1860948, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1860948|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 11:10:13,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-520684658 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-520684658 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-520684658 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-520684658 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite39_Out-520684658| ~z$w_buff1_used~0_In-520684658)) (and (= |ULTIMATE.start_main_#t~ite39_Out-520684658| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-520684658, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-520684658, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-520684658, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-520684658} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-520684658, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-520684658|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-520684658, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-520684658, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-520684658} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 11:10:13,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-520889407 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-520889407 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-520889407| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out-520889407| ~z$r_buff0_thd0~0_In-520889407) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-520889407, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-520889407} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-520889407, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-520889407|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-520889407} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 11:10:13,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1651096095 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1651096095 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1651096095 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1651096095 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In1651096095 |ULTIMATE.start_main_#t~ite41_Out1651096095|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite41_Out1651096095| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1651096095, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1651096095, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1651096095, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1651096095} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1651096095|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1651096095, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1651096095, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1651096095, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1651096095} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 11:10:13,884 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 (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= v_~x~0_41 2) (= 0 v_~__unbuffered_p2_EAX~0_17))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~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_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41, 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 11:10:13,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:10:13 BasicIcfg [2019-12-07 11:10:13,928 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:10:13,929 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:10:13,929 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:10:13,929 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:10:13,929 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:10:00" (3/4) ... [2019-12-07 11:10:13,930 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:10:13,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_107| 0 0))) (and (= v_~x~0_71 0) (= 0 v_~weak$$choice0~0_10) (= v_~z$w_buff0_used~0_514 0) (= 0 v_~z$r_buff1_thd3~0_207) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_44 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~z$flush_delayed~0_37) (= v_~z$mem_tmp~0_16 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t981~0.base_59| 4)) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= (select .cse0 |v_ULTIMATE.start_main_~#t981~0.base_59|) 0) (= v_~y~0_19 0) (= v_~z$w_buff0~0_183 0) (= 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) (= 0 v_~__unbuffered_p3_EAX~0_87) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t981~0.base_59|) (= |v_#memory_int_27| (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t981~0.base_59| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t981~0.base_59|) |v_ULTIMATE.start_main_~#t981~0.offset_37| 0))) (= v_~z$r_buff0_thd2~0_57 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd0~0_132 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_116 0) (= 0 v_~__unbuffered_p2_EAX~0_54) (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~z$r_buff0_thd3~0_266) (= 0 v_~__unbuffered_p3_EBX~0_88) (= |v_#valid_105| (store .cse0 |v_ULTIMATE.start_main_~#t981~0.base_59| 1)) (= 0 v_~weak$$choice2~0_95) (= v_~z$w_buff1_used~0_298 0) (= 0 |v_#NULL.base_5|) (= v_~z$w_buff1~0_123 0) (= v_~b~0_79 0) (= |v_ULTIMATE.start_main_~#t981~0.offset_37| 0) (= v_~__unbuffered_cnt~0_126 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_107|, #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|, ULTIMATE.start_main_~#t981~0.offset=|v_ULTIMATE.start_main_~#t981~0.offset_37|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_87, #length=|v_#length_31|, ULTIMATE.start_main_~#t984~0.offset=|v_ULTIMATE.start_main_~#t984~0.offset_22|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ~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_37, ULTIMATE.start_main_~#t983~0.base=|v_ULTIMATE.start_main_~#t983~0.base_32|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ULTIMATE.start_main_~#t984~0.base=|v_ULTIMATE.start_main_~#t984~0.base_32|, ~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, ~x~0=v_~x~0_71, ULTIMATE.start_main_~#t982~0.base=|v_ULTIMATE.start_main_~#t982~0.base_56|, ~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_#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_44, ~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_132, ~y~0=v_~y~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ULTIMATE.start_main_~#t983~0.offset=|v_ULTIMATE.start_main_~#t983~0.offset_23|, ~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_207, 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_88, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t982~0.offset=|v_ULTIMATE.start_main_~#t982~0.offset_35|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_91|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_38|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~#t981~0.base=|v_ULTIMATE.start_main_~#t981~0.base_59|, ~z~0=v_~z~0_116, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t981~0.offset, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t984~0.offset, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t983~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t984~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t982~0.base, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t983~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_~#t982~0.offset, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t981~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 11:10:13,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t982~0.base_11|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t982~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t982~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t982~0.base_11| 0)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t982~0.base_11|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t982~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t982~0.base_11|) |v_ULTIMATE.start_main_~#t982~0.offset_10| 1)) |v_#memory_int_19|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t982~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_~#t982~0.base=|v_ULTIMATE.start_main_~#t982~0.base_11|, ULTIMATE.start_main_~#t982~0.offset=|v_ULTIMATE.start_main_~#t982~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t982~0.base, ULTIMATE.start_main_~#t982~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 11:10:13,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t983~0.base_12|)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t983~0.base_12| 1) |v_#valid_46|) (not (= 0 |v_ULTIMATE.start_main_~#t983~0.base_12|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t983~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t983~0.base_12|) |v_ULTIMATE.start_main_~#t983~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t983~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t983~0.offset_11|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t983~0.base_12| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t983~0.offset=|v_ULTIMATE.start_main_~#t983~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|, ULTIMATE.start_main_~#t983~0.base=|v_ULTIMATE.start_main_~#t983~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t983~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t983~0.base] because there is no mapped edge [2019-12-07 11:10:13,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t984~0.base_12|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t984~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t984~0.base_12|) |v_ULTIMATE.start_main_~#t984~0.offset_10| 3)) |v_#memory_int_15|) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t984~0.base_12|) 0) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t984~0.base_12| 1)) (not (= |v_ULTIMATE.start_main_~#t984~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t984~0.offset_10|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t984~0.base_12| 4))) 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|, ULTIMATE.start_main_~#t984~0.base=|v_ULTIMATE.start_main_~#t984~0.base_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t984~0.offset=|v_ULTIMATE.start_main_~#t984~0.offset_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t984~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t984~0.offset, #length] because there is no mapped edge [2019-12-07 11:10:13,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~z$r_buff1_thd0~0_Out1179349087 ~z$r_buff0_thd0~0_In1179349087) (= 1 ~z$r_buff0_thd4~0_Out1179349087) (= ~z$r_buff0_thd4~0_In1179349087 ~z$r_buff1_thd4~0_Out1179349087) (= ~__unbuffered_p3_EAX~0_Out1179349087 ~a~0_Out1179349087) (= 1 ~a~0_Out1179349087) (= ~b~0_In1179349087 ~__unbuffered_p3_EBX~0_Out1179349087) (= ~z$r_buff1_thd3~0_Out1179349087 ~z$r_buff0_thd3~0_In1179349087) (= ~z$r_buff0_thd1~0_In1179349087 ~z$r_buff1_thd1~0_Out1179349087) (= ~z$r_buff0_thd2~0_In1179349087 ~z$r_buff1_thd2~0_Out1179349087) (not (= P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1179349087 0))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1179349087, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1179349087, ~b~0=~b~0_In1179349087, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1179349087, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1179349087, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1179349087, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1179349087} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In1179349087, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1179349087, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1179349087, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1179349087, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out1179349087, ~a~0=~a~0_Out1179349087, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1179349087, ~b~0=~b~0_In1179349087, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1179349087, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1179349087, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out1179349087, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1179349087, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1179349087, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1179349087, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1179349087} 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 11:10:13,933 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_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_20) (= v_~x~0_36 1) (= 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|} OutVars{~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_36} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 11:10:13,933 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_~y~0_15 v_~__unbuffered_p1_EAX~0_14) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x~0_23 2) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 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, ~y~0=v_~y~0_15} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, 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_15, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 11:10:13,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In759781224 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite9_Out759781224| ~z$w_buff0~0_In759781224) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite8_In759781224| |P2Thread1of1ForFork1_#t~ite8_Out759781224|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In759781224 256)))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In759781224 256))) (= 0 (mod ~z$w_buff0_used~0_In759781224 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In759781224 256))))) .cse0 (= |P2Thread1of1ForFork1_#t~ite9_Out759781224| |P2Thread1of1ForFork1_#t~ite8_Out759781224|) (= |P2Thread1of1ForFork1_#t~ite8_Out759781224| ~z$w_buff0~0_In759781224)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In759781224, ~z$w_buff0_used~0=~z$w_buff0_used~0_In759781224, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In759781224, ~z$w_buff1_used~0=~z$w_buff1_used~0_In759781224, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In759781224, ~weak$$choice2~0=~weak$$choice2~0_In759781224, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In759781224|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In759781224, ~z$w_buff0_used~0=~z$w_buff0_used~0_In759781224, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In759781224, ~z$w_buff1_used~0=~z$w_buff1_used~0_In759781224, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In759781224, ~weak$$choice2~0=~weak$$choice2~0_In759781224, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out759781224|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out759781224|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 11:10:13,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1173370317 256)))) (or (and (= ~z$w_buff1~0_In1173370317 |P2Thread1of1ForFork1_#t~ite11_Out1173370317|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1173370317 256) 0))) (or (and (= (mod ~z$r_buff1_thd3~0_In1173370317 256) 0) .cse0) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In1173370317 256))) (= 0 (mod ~z$w_buff0_used~0_In1173370317 256)))) (= |P2Thread1of1ForFork1_#t~ite12_Out1173370317| |P2Thread1of1ForFork1_#t~ite11_Out1173370317|) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite12_Out1173370317| ~z$w_buff1~0_In1173370317) (= |P2Thread1of1ForFork1_#t~ite11_In1173370317| |P2Thread1of1ForFork1_#t~ite11_Out1173370317|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1173370317, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1173370317, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In1173370317|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1173370317, ~z$w_buff1~0=~z$w_buff1~0_In1173370317, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1173370317, ~weak$$choice2~0=~weak$$choice2~0_In1173370317} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1173370317, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1173370317|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1173370317, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1173370317|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1173370317, ~z$w_buff1~0=~z$w_buff1~0_In1173370317, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1173370317, ~weak$$choice2~0=~weak$$choice2~0_In1173370317} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 11:10:13,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1405101165 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1405101165 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1405101165 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1405101165 256))) (and (= 0 (mod ~z$w_buff1_used~0_In1405101165 256)) .cse1))) (= |P2Thread1of1ForFork1_#t~ite14_Out1405101165| |P2Thread1of1ForFork1_#t~ite15_Out1405101165|) (= |P2Thread1of1ForFork1_#t~ite14_Out1405101165| ~z$w_buff0_used~0_In1405101165)) (and (not .cse0) (= ~z$w_buff0_used~0_In1405101165 |P2Thread1of1ForFork1_#t~ite15_Out1405101165|) (= |P2Thread1of1ForFork1_#t~ite14_In1405101165| |P2Thread1of1ForFork1_#t~ite14_Out1405101165|)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In1405101165|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1405101165, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1405101165, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1405101165, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1405101165, ~weak$$choice2~0=~weak$$choice2~0_In1405101165} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out1405101165|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out1405101165|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1405101165, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1405101165, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1405101165, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1405101165, ~weak$$choice2~0=~weak$$choice2~0_In1405101165} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-07 11:10:13,936 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 11:10:13,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In660635871 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite23_Out660635871| ~z$r_buff1_thd3~0_In660635871) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In660635871 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In660635871 256)) .cse0) (= (mod ~z$w_buff0_used~0_In660635871 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In660635871 256)) .cse0))) (= |P2Thread1of1ForFork1_#t~ite24_Out660635871| |P2Thread1of1ForFork1_#t~ite23_Out660635871|) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite24_Out660635871| ~z$r_buff1_thd3~0_In660635871) (= |P2Thread1of1ForFork1_#t~ite23_In660635871| |P2Thread1of1ForFork1_#t~ite23_Out660635871|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In660635871, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In660635871, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In660635871|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In660635871, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In660635871, ~weak$$choice2~0=~weak$$choice2~0_In660635871} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out660635871|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In660635871, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In660635871, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out660635871|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In660635871, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In660635871, ~weak$$choice2~0=~weak$$choice2~0_In660635871} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-07 11:10:13,936 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 11:10:13,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In439984207 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In439984207 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In439984207 |P3Thread1of1ForFork2_#t~ite28_Out439984207|)) (and (not .cse1) (not .cse0) (= 0 |P3Thread1of1ForFork2_#t~ite28_Out439984207|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In439984207, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In439984207} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out439984207|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In439984207, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In439984207} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 11:10:13,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-854036548 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-854036548 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-854036548 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-854036548 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite29_Out-854036548| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite29_Out-854036548| ~z$w_buff1_used~0_In-854036548)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-854036548, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-854036548, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-854036548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-854036548} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-854036548|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-854036548, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-854036548, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-854036548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-854036548} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 11:10:13,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1115521006 256))) (.cse2 (= ~z$r_buff0_thd4~0_Out1115521006 ~z$r_buff0_thd4~0_In1115521006)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In1115521006 256) 0))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out1115521006) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1115521006, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1115521006} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1115521006, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1115521006, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out1115521006|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-07 11:10:13,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In1325027743 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1325027743 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1325027743 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd4~0_In1325027743 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite31_Out1325027743| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite31_Out1325027743| ~z$r_buff1_thd4~0_In1325027743)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1325027743, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1325027743, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1325027743, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1325027743} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1325027743, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1325027743, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1325027743, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1325027743, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out1325027743|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 11:10:13,938 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 11:10:13,938 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 11:10:13,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite37_Out335686140| |ULTIMATE.start_main_#t~ite36_Out335686140|)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In335686140 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In335686140 256) 0))) (or (and (= ~z~0_In335686140 |ULTIMATE.start_main_#t~ite36_Out335686140|) (or .cse0 .cse1) .cse2) (and .cse2 (not .cse0) (= ~z$w_buff1~0_In335686140 |ULTIMATE.start_main_#t~ite36_Out335686140|) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In335686140, ~z$w_buff1_used~0=~z$w_buff1_used~0_In335686140, ~z$w_buff1~0=~z$w_buff1~0_In335686140, ~z~0=~z~0_In335686140} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In335686140, ~z$w_buff1_used~0=~z$w_buff1_used~0_In335686140, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out335686140|, ~z$w_buff1~0=~z$w_buff1~0_In335686140, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out335686140|, ~z~0=~z~0_In335686140} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 11:10:13,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1860948 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1860948 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out1860948| ~z$w_buff0_used~0_In1860948)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out1860948| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1860948, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1860948} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1860948, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1860948, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1860948|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 11:10:13,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-520684658 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-520684658 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-520684658 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-520684658 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite39_Out-520684658| ~z$w_buff1_used~0_In-520684658)) (and (= |ULTIMATE.start_main_#t~ite39_Out-520684658| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-520684658, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-520684658, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-520684658, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-520684658} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-520684658, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-520684658|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-520684658, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-520684658, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-520684658} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 11:10:13,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-520889407 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-520889407 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-520889407| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out-520889407| ~z$r_buff0_thd0~0_In-520889407) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-520889407, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-520889407} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-520889407, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-520889407|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-520889407} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 11:10:13,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1651096095 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1651096095 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1651096095 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1651096095 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In1651096095 |ULTIMATE.start_main_#t~ite41_Out1651096095|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite41_Out1651096095| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1651096095, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1651096095, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1651096095, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1651096095} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1651096095|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1651096095, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1651096095, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1651096095, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1651096095} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 11:10:13,940 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 (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= v_~x~0_41 2) (= 0 v_~__unbuffered_p2_EAX~0_17))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~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_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41, 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 11:10:13,985 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4ef8ff53-ab58-4c88-a80b-cf6ca6fb10db/bin/uautomizer/witness.graphml [2019-12-07 11:10:13,985 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:10:13,986 INFO L168 Benchmark]: Toolchain (without parser) took 14537.27 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 938.5 MB). Free memory was 932.6 MB in the beginning and 1.5 GB in the end (delta: -550.8 MB). Peak memory consumption was 387.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:10:13,986 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:10:13,987 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -139.4 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:10:13,987 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.70 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 11:10:13,987 INFO L168 Benchmark]: Boogie Preprocessor took 25.98 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 11:10:13,987 INFO L168 Benchmark]: RCFGBuilder took 394.22 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.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:10:13,988 INFO L168 Benchmark]: TraceAbstraction took 13639.80 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 834.1 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -497.9 MB). Peak memory consumption was 336.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:10:13,988 INFO L168 Benchmark]: Witness Printer took 56.83 ms. Allocated memory is still 2.0 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:10:13,989 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 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 377.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -139.4 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.70 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 25.98 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 394.22 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.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13639.80 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 834.1 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -497.9 MB). Peak memory consumption was 336.2 MB. Max. memory is 11.5 GB. * Witness Printer took 56.83 ms. Allocated memory is still 2.0 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 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, 5751 VarBasedMoverChecksPositive, 155 VarBasedMoverChecksNegative, 25 SemBasedMoverChecksPositive, 169 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.6s, 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(&t981, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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(&t982, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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(&t983, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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(&t984, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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_p1_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=1, 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 = 1 [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_p1_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=2, y=1, 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_p1_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=2, y=1, 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_p1_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=2, y=1, 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_p1_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=2, y=1, 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_p1_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=2, y=1, 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: 13.4s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2499 SDtfs, 3721 SDslu, 5807 SDs, 0 SdLazy, 2146 SolverSat, 286 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30378occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 23720 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 641 NumberOfCodeBlocks, 641 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 575 ConstructedInterpolants, 0 QuantifiedInterpolants, 148345 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...