./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix037_power.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_ff6bf84f-91b5-451f-bc64-80e5f26f6eb1/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ff6bf84f-91b5-451f-bc64-80e5f26f6eb1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ff6bf84f-91b5-451f-bc64-80e5f26f6eb1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ff6bf84f-91b5-451f-bc64-80e5f26f6eb1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix037_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ff6bf84f-91b5-451f-bc64-80e5f26f6eb1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ff6bf84f-91b5-451f-bc64-80e5f26f6eb1/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 d096e932b8c7643c581280a03a197c0822d7907c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 18:07:33,439 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:07:33,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:07:33,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:07:33,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:07:33,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:07:33,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:07:33,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:07:33,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:07:33,455 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:07:33,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:07:33,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:07:33,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:07:33,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:07:33,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:07:33,460 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:07:33,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:07:33,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:07:33,463 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:07:33,464 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:07:33,466 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:07:33,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:07:33,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:07:33,468 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:07:33,470 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:07:33,470 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:07:33,470 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:07:33,471 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:07:33,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:07:33,472 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:07:33,472 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:07:33,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:07:33,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:07:33,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:07:33,474 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:07:33,475 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:07:33,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:07:33,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:07:33,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:07:33,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:07:33,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:07:33,477 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ff6bf84f-91b5-451f-bc64-80e5f26f6eb1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:07:33,487 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:07:33,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:07:33,488 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:07:33,488 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:07:33,488 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:07:33,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:07:33,489 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:07:33,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:07:33,489 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:07:33,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:07:33,489 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:07:33,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:07:33,489 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:07:33,490 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:07:33,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:07:33,490 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:07:33,490 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:07:33,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:07:33,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:07:33,490 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:07:33,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:07:33,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:07:33,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:07:33,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:07:33,491 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:07:33,491 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:07:33,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:07:33,491 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:07:33,491 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:07:33,491 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_ff6bf84f-91b5-451f-bc64-80e5f26f6eb1/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 -> d096e932b8c7643c581280a03a197c0822d7907c [2019-12-07 18:07:33,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:07:33,600 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:07:33,603 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:07:33,604 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:07:33,605 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:07:33,605 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ff6bf84f-91b5-451f-bc64-80e5f26f6eb1/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix037_power.opt.i [2019-12-07 18:07:33,644 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ff6bf84f-91b5-451f-bc64-80e5f26f6eb1/bin/uautomizer/data/ced84e3f8/09137ee9f6f943bfa258efc9dfd532f8/FLAGa4f3e9f31 [2019-12-07 18:07:34,022 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:07:34,022 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ff6bf84f-91b5-451f-bc64-80e5f26f6eb1/sv-benchmarks/c/pthread-wmm/mix037_power.opt.i [2019-12-07 18:07:34,032 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ff6bf84f-91b5-451f-bc64-80e5f26f6eb1/bin/uautomizer/data/ced84e3f8/09137ee9f6f943bfa258efc9dfd532f8/FLAGa4f3e9f31 [2019-12-07 18:07:34,041 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ff6bf84f-91b5-451f-bc64-80e5f26f6eb1/bin/uautomizer/data/ced84e3f8/09137ee9f6f943bfa258efc9dfd532f8 [2019-12-07 18:07:34,042 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:07:34,043 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:07:34,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:07:34,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:07:34,046 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:07:34,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:07:34" (1/1) ... [2019-12-07 18:07:34,049 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 06:07:34, skipping insertion in model container [2019-12-07 18:07:34,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:07:34" (1/1) ... [2019-12-07 18:07:34,053 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:07:34,086 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:07:34,345 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:07:34,353 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:07:34,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:07:34,439 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:07:34,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:07:34 WrapperNode [2019-12-07 18:07:34,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:07:34,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:07:34,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:07:34,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:07:34,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:07:34" (1/1) ... [2019-12-07 18:07:34,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:07:34" (1/1) ... [2019-12-07 18:07:34,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:07:34,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:07:34,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:07:34,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:07:34,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:07:34" (1/1) ... [2019-12-07 18:07:34,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:07:34" (1/1) ... [2019-12-07 18:07:34,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:07:34" (1/1) ... [2019-12-07 18:07:34,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:07:34" (1/1) ... [2019-12-07 18:07:34,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:07:34" (1/1) ... [2019-12-07 18:07:34,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:07:34" (1/1) ... [2019-12-07 18:07:34,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:07:34" (1/1) ... [2019-12-07 18:07:34,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:07:34,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:07:34,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:07:34,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:07:34,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:07:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ff6bf84f-91b5-451f-bc64-80e5f26f6eb1/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 18:07:34,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:07:34,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:07:34,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:07:34,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:07:34,546 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:07:34,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:07:34,546 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:07:34,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:07:34,546 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 18:07:34,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 18:07:34,546 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 18:07:34,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 18:07:34,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:07:34,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:07:34,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:07:34,548 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 18:07:34,892 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:07:34,893 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:07:34,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:07:34 BoogieIcfgContainer [2019-12-07 18:07:34,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:07:34,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:07:34,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:07:34,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:07:34,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:07:34" (1/3) ... [2019-12-07 18:07:34,897 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 06:07:34, skipping insertion in model container [2019-12-07 18:07:34,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:07:34" (2/3) ... [2019-12-07 18:07:34,897 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 06:07:34, skipping insertion in model container [2019-12-07 18:07:34,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:07:34" (3/3) ... [2019-12-07 18:07:34,898 INFO L109 eAbstractionObserver]: Analyzing ICFG mix037_power.opt.i [2019-12-07 18:07:34,905 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:07:34,905 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:07:34,909 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:07:34,910 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:07:34,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,934 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,934 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,934 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,934 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,936 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,936 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,944 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,945 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,946 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,946 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,947 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,947 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,947 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,947 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,947 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,947 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,947 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,947 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,948 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,948 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,948 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,948 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,948 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,948 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,948 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,948 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,948 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,948 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,949 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,949 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,949 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,949 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,949 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,949 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,949 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,949 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,949 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,950 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,950 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,950 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,950 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,950 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:07:34,962 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 18:07:34,974 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:07:34,975 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:07:34,975 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:07:34,975 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:07:34,975 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:07:34,975 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:07:34,975 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:07:34,975 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:07:34,986 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-07 18:07:34,987 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-07 18:07:35,039 INFO L134 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-07 18:07:35,039 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:07:35,048 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 18:07:35,060 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-07 18:07:35,086 INFO L134 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-07 18:07:35,086 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:07:35,090 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 18:07:35,101 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-07 18:07:35,102 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:07:37,948 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 18:07:38,177 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 18:07:38,278 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44168 [2019-12-07 18:07:38,278 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-07 18:07:38,280 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 78 transitions [2019-12-07 18:07:39,237 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 21398 states. [2019-12-07 18:07:39,239 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states. [2019-12-07 18:07:39,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 18:07:39,244 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:39,244 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:07:39,244 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 18:07:39,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:39,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1244651740, now seen corresponding path program 1 times [2019-12-07 18:07:39,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:39,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2988974] [2019-12-07 18:07:39,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:39,414 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 18:07:39,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2988974] [2019-12-07 18:07:39,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:39,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:07:39,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690724843] [2019-12-07 18:07:39,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:07:39,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:39,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:07:39,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:07:39,429 INFO L87 Difference]: Start difference. First operand 21398 states. Second operand 3 states. [2019-12-07 18:07:39,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:39,698 INFO L93 Difference]: Finished difference Result 20958 states and 90416 transitions. [2019-12-07 18:07:39,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:07:39,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 18:07:39,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:39,838 INFO L225 Difference]: With dead ends: 20958 [2019-12-07 18:07:39,838 INFO L226 Difference]: Without dead ends: 19662 [2019-12-07 18:07:39,839 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 18:07:40,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-07 18:07:40,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 19662. [2019-12-07 18:07:40,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-12-07 18:07:40,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 84692 transitions. [2019-12-07 18:07:40,546 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 84692 transitions. Word has length 9 [2019-12-07 18:07:40,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:40,547 INFO L462 AbstractCegarLoop]: Abstraction has 19662 states and 84692 transitions. [2019-12-07 18:07:40,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:07:40,548 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 84692 transitions. [2019-12-07 18:07:40,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:07:40,552 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:40,552 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:07:40,552 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 18:07:40,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:40,552 INFO L82 PathProgramCache]: Analyzing trace with hash -6792795, now seen corresponding path program 1 times [2019-12-07 18:07:40,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:40,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586143244] [2019-12-07 18:07:40,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:40,616 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 18:07:40,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586143244] [2019-12-07 18:07:40,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:40,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:07:40,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908208435] [2019-12-07 18:07:40,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:07:40,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:40,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:07:40,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:07:40,618 INFO L87 Difference]: Start difference. First operand 19662 states and 84692 transitions. Second operand 4 states. [2019-12-07 18:07:41,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:41,007 INFO L93 Difference]: Finished difference Result 30494 states and 126452 transitions. [2019-12-07 18:07:41,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:07:41,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 18:07:41,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:41,174 INFO L225 Difference]: With dead ends: 30494 [2019-12-07 18:07:41,175 INFO L226 Difference]: Without dead ends: 30438 [2019-12-07 18:07:41,175 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 18:07:41,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30438 states. [2019-12-07 18:07:41,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30438 to 27742. [2019-12-07 18:07:41,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-12-07 18:07:41,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 116300 transitions. [2019-12-07 18:07:41,803 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 116300 transitions. Word has length 15 [2019-12-07 18:07:41,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:41,803 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 116300 transitions. [2019-12-07 18:07:41,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:07:41,803 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 116300 transitions. [2019-12-07 18:07:41,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:07:41,808 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:41,809 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 18:07:41,809 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 18:07:41,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:41,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1479332799, now seen corresponding path program 1 times [2019-12-07 18:07:41,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:41,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134220081] [2019-12-07 18:07:41,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:41,863 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 18:07:41,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134220081] [2019-12-07 18:07:41,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:41,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:07:41,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086860296] [2019-12-07 18:07:41,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:07:41,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:41,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:07:41,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:07:41,865 INFO L87 Difference]: Start difference. First operand 27742 states and 116300 transitions. Second operand 4 states. [2019-12-07 18:07:42,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:42,179 INFO L93 Difference]: Finished difference Result 35230 states and 146308 transitions. [2019-12-07 18:07:42,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:07:42,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 18:07:42,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:42,253 INFO L225 Difference]: With dead ends: 35230 [2019-12-07 18:07:42,254 INFO L226 Difference]: Without dead ends: 35182 [2019-12-07 18:07:42,254 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 18:07:42,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-12-07 18:07:42,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 30378. [2019-12-07 18:07:42,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30378 states. [2019-12-07 18:07:42,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30378 states to 30378 states and 127172 transitions. [2019-12-07 18:07:42,984 INFO L78 Accepts]: Start accepts. Automaton has 30378 states and 127172 transitions. Word has length 18 [2019-12-07 18:07:42,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:42,984 INFO L462 AbstractCegarLoop]: Abstraction has 30378 states and 127172 transitions. [2019-12-07 18:07:42,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:07:42,984 INFO L276 IsEmpty]: Start isEmpty. Operand 30378 states and 127172 transitions. [2019-12-07 18:07:42,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:07:42,992 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:42,992 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 18:07:42,992 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 18:07:42,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:42,992 INFO L82 PathProgramCache]: Analyzing trace with hash -45820751, now seen corresponding path program 1 times [2019-12-07 18:07:42,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:42,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282993396] [2019-12-07 18:07:42,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:43,042 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 18:07:43,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282993396] [2019-12-07 18:07:43,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:43,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:07:43,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295415936] [2019-12-07 18:07:43,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:07:43,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:43,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:07:43,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:07:43,044 INFO L87 Difference]: Start difference. First operand 30378 states and 127172 transitions. Second operand 4 states. [2019-12-07 18:07:43,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:43,154 INFO L93 Difference]: Finished difference Result 26024 states and 100213 transitions. [2019-12-07 18:07:43,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:07:43,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 18:07:43,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:43,201 INFO L225 Difference]: With dead ends: 26024 [2019-12-07 18:07:43,201 INFO L226 Difference]: Without dead ends: 24072 [2019-12-07 18:07:43,201 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 18:07:43,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24072 states. [2019-12-07 18:07:43,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24072 to 24072. [2019-12-07 18:07:43,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24072 states. [2019-12-07 18:07:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24072 states to 24072 states and 93462 transitions. [2019-12-07 18:07:43,615 INFO L78 Accepts]: Start accepts. Automaton has 24072 states and 93462 transitions. Word has length 20 [2019-12-07 18:07:43,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:43,615 INFO L462 AbstractCegarLoop]: Abstraction has 24072 states and 93462 transitions. [2019-12-07 18:07:43,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:07:43,615 INFO L276 IsEmpty]: Start isEmpty. Operand 24072 states and 93462 transitions. [2019-12-07 18:07:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:07:43,620 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:43,620 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 18:07:43,621 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 18:07:43,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:43,621 INFO L82 PathProgramCache]: Analyzing trace with hash -129088173, now seen corresponding path program 1 times [2019-12-07 18:07:43,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:43,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593917670] [2019-12-07 18:07:43,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:43,672 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 18:07:43,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593917670] [2019-12-07 18:07:43,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:43,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:07:43,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067845833] [2019-12-07 18:07:43,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:07:43,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:43,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:07:43,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:07:43,674 INFO L87 Difference]: Start difference. First operand 24072 states and 93462 transitions. Second operand 5 states. [2019-12-07 18:07:43,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:43,831 INFO L93 Difference]: Finished difference Result 12278 states and 40771 transitions. [2019-12-07 18:07:43,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:07:43,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-07 18:07:43,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:43,845 INFO L225 Difference]: With dead ends: 12278 [2019-12-07 18:07:43,846 INFO L226 Difference]: Without dead ends: 10729 [2019-12-07 18:07:43,846 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 18:07:43,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10729 states. [2019-12-07 18:07:43,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10729 to 10729. [2019-12-07 18:07:43,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10729 states. [2019-12-07 18:07:43,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10729 states to 10729 states and 35320 transitions. [2019-12-07 18:07:43,995 INFO L78 Accepts]: Start accepts. Automaton has 10729 states and 35320 transitions. Word has length 21 [2019-12-07 18:07:43,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:43,995 INFO L462 AbstractCegarLoop]: Abstraction has 10729 states and 35320 transitions. [2019-12-07 18:07:43,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:07:43,995 INFO L276 IsEmpty]: Start isEmpty. Operand 10729 states and 35320 transitions. [2019-12-07 18:07:43,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:07:43,997 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:43,998 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 18:07:43,998 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 18:07:43,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:43,998 INFO L82 PathProgramCache]: Analyzing trace with hash -2097022487, now seen corresponding path program 1 times [2019-12-07 18:07:43,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:43,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543575349] [2019-12-07 18:07:43,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:44,047 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 18:07:44,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543575349] [2019-12-07 18:07:44,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:44,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:07:44,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567829586] [2019-12-07 18:07:44,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:07:44,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:44,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:07:44,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:07:44,048 INFO L87 Difference]: Start difference. First operand 10729 states and 35320 transitions. Second operand 6 states. [2019-12-07 18:07:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:44,111 INFO L93 Difference]: Finished difference Result 3597 states and 11011 transitions. [2019-12-07 18:07:44,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:07:44,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 18:07:44,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:44,114 INFO L225 Difference]: With dead ends: 3597 [2019-12-07 18:07:44,115 INFO L226 Difference]: Without dead ends: 2935 [2019-12-07 18:07:44,115 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 18:07:44,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2019-12-07 18:07:44,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 2935. [2019-12-07 18:07:44,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2935 states. [2019-12-07 18:07:44,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2935 states to 2935 states and 8921 transitions. [2019-12-07 18:07:44,144 INFO L78 Accepts]: Start accepts. Automaton has 2935 states and 8921 transitions. Word has length 22 [2019-12-07 18:07:44,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:44,144 INFO L462 AbstractCegarLoop]: Abstraction has 2935 states and 8921 transitions. [2019-12-07 18:07:44,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:07:44,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2935 states and 8921 transitions. [2019-12-07 18:07:44,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 18:07:44,147 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:44,147 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 18:07:44,148 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 18:07:44,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:44,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1619810495, now seen corresponding path program 1 times [2019-12-07 18:07:44,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:44,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653484070] [2019-12-07 18:07:44,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:44,179 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 18:07:44,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653484070] [2019-12-07 18:07:44,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:44,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:07:44,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092802935] [2019-12-07 18:07:44,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:07:44,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:44,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:07:44,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:07:44,180 INFO L87 Difference]: Start difference. First operand 2935 states and 8921 transitions. Second operand 3 states. [2019-12-07 18:07:44,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:44,220 INFO L93 Difference]: Finished difference Result 4560 states and 13775 transitions. [2019-12-07 18:07:44,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:07:44,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 18:07:44,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:44,228 INFO L225 Difference]: With dead ends: 4560 [2019-12-07 18:07:44,228 INFO L226 Difference]: Without dead ends: 4560 [2019-12-07 18:07:44,228 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 18:07:44,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4560 states. [2019-12-07 18:07:44,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4560 to 3427. [2019-12-07 18:07:44,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3427 states. [2019-12-07 18:07:44,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3427 states to 3427 states and 10544 transitions. [2019-12-07 18:07:44,273 INFO L78 Accepts]: Start accepts. Automaton has 3427 states and 10544 transitions. Word has length 32 [2019-12-07 18:07:44,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:44,274 INFO L462 AbstractCegarLoop]: Abstraction has 3427 states and 10544 transitions. [2019-12-07 18:07:44,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:07:44,274 INFO L276 IsEmpty]: Start isEmpty. Operand 3427 states and 10544 transitions. [2019-12-07 18:07:44,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 18:07:44,277 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:44,278 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 18:07:44,278 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 18:07:44,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:44,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1082300219, now seen corresponding path program 1 times [2019-12-07 18:07:44,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:44,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842988253] [2019-12-07 18:07:44,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:44,341 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 18:07:44,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842988253] [2019-12-07 18:07:44,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:44,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:07:44,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943092593] [2019-12-07 18:07:44,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:07:44,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:44,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:07:44,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:07:44,343 INFO L87 Difference]: Start difference. First operand 3427 states and 10544 transitions. Second operand 6 states. [2019-12-07 18:07:44,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:44,646 INFO L93 Difference]: Finished difference Result 6998 states and 20488 transitions. [2019-12-07 18:07:44,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:07:44,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-07 18:07:44,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:44,655 INFO L225 Difference]: With dead ends: 6998 [2019-12-07 18:07:44,655 INFO L226 Difference]: Without dead ends: 6994 [2019-12-07 18:07:44,655 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 18:07:44,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6994 states. [2019-12-07 18:07:44,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6994 to 3703. [2019-12-07 18:07:44,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3703 states. [2019-12-07 18:07:44,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3703 states to 3703 states and 11319 transitions. [2019-12-07 18:07:44,710 INFO L78 Accepts]: Start accepts. Automaton has 3703 states and 11319 transitions. Word has length 32 [2019-12-07 18:07:44,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:44,711 INFO L462 AbstractCegarLoop]: Abstraction has 3703 states and 11319 transitions. [2019-12-07 18:07:44,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:07:44,711 INFO L276 IsEmpty]: Start isEmpty. Operand 3703 states and 11319 transitions. [2019-12-07 18:07:44,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 18:07:44,715 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:44,715 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 18:07:44,715 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 18:07:44,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:44,715 INFO L82 PathProgramCache]: Analyzing trace with hash -108792096, now seen corresponding path program 1 times [2019-12-07 18:07:44,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:44,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901322066] [2019-12-07 18:07:44,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:44,753 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 18:07:44,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901322066] [2019-12-07 18:07:44,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:44,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:07:44,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143834816] [2019-12-07 18:07:44,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:07:44,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:44,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:07:44,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:07:44,754 INFO L87 Difference]: Start difference. First operand 3703 states and 11319 transitions. Second operand 3 states. [2019-12-07 18:07:44,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:44,772 INFO L93 Difference]: Finished difference Result 3703 states and 11258 transitions. [2019-12-07 18:07:44,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:07:44,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 18:07:44,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:44,776 INFO L225 Difference]: With dead ends: 3703 [2019-12-07 18:07:44,776 INFO L226 Difference]: Without dead ends: 3703 [2019-12-07 18:07:44,776 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 18:07:44,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3703 states. [2019-12-07 18:07:44,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3703 to 3476. [2019-12-07 18:07:44,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3476 states. [2019-12-07 18:07:44,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 10586 transitions. [2019-12-07 18:07:44,815 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 10586 transitions. Word has length 32 [2019-12-07 18:07:44,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:44,815 INFO L462 AbstractCegarLoop]: Abstraction has 3476 states and 10586 transitions. [2019-12-07 18:07:44,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:07:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 10586 transitions. [2019-12-07 18:07:44,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 18:07:44,819 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:44,819 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 18:07:44,819 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 18:07:44,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:44,819 INFO L82 PathProgramCache]: Analyzing trace with hash -345264620, now seen corresponding path program 1 times [2019-12-07 18:07:44,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:44,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951569237] [2019-12-07 18:07:44,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:44,872 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 18:07:44,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951569237] [2019-12-07 18:07:44,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:44,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:07:44,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673978644] [2019-12-07 18:07:44,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:07:44,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:44,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:07:44,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:07:44,873 INFO L87 Difference]: Start difference. First operand 3476 states and 10586 transitions. Second operand 6 states. [2019-12-07 18:07:45,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:45,125 INFO L93 Difference]: Finished difference Result 6621 states and 19118 transitions. [2019-12-07 18:07:45,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:07:45,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 18:07:45,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:45,131 INFO L225 Difference]: With dead ends: 6621 [2019-12-07 18:07:45,131 INFO L226 Difference]: Without dead ends: 6619 [2019-12-07 18:07:45,132 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 18:07:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6619 states. [2019-12-07 18:07:45,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6619 to 3328. [2019-12-07 18:07:45,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3328 states. [2019-12-07 18:07:45,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3328 states to 3328 states and 10212 transitions. [2019-12-07 18:07:45,178 INFO L78 Accepts]: Start accepts. Automaton has 3328 states and 10212 transitions. Word has length 33 [2019-12-07 18:07:45,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:45,178 INFO L462 AbstractCegarLoop]: Abstraction has 3328 states and 10212 transitions. [2019-12-07 18:07:45,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:07:45,179 INFO L276 IsEmpty]: Start isEmpty. Operand 3328 states and 10212 transitions. [2019-12-07 18:07:45,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 18:07:45,182 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:45,182 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 18:07:45,183 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 18:07:45,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:45,183 INFO L82 PathProgramCache]: Analyzing trace with hash 452387979, now seen corresponding path program 1 times [2019-12-07 18:07:45,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:45,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623642789] [2019-12-07 18:07:45,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:45,242 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 18:07:45,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623642789] [2019-12-07 18:07:45,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:45,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:07:45,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894008573] [2019-12-07 18:07:45,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:07:45,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:45,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:07:45,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:07:45,243 INFO L87 Difference]: Start difference. First operand 3328 states and 10212 transitions. Second operand 7 states. [2019-12-07 18:07:45,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:45,349 INFO L93 Difference]: Finished difference Result 2519 states and 8206 transitions. [2019-12-07 18:07:45,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:07:45,350 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 18:07:45,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:45,352 INFO L225 Difference]: With dead ends: 2519 [2019-12-07 18:07:45,352 INFO L226 Difference]: Without dead ends: 2442 [2019-12-07 18:07:45,353 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 18:07:45,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2019-12-07 18:07:45,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2370. [2019-12-07 18:07:45,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2370 states. [2019-12-07 18:07:45,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 7792 transitions. [2019-12-07 18:07:45,378 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 7792 transitions. Word has length 33 [2019-12-07 18:07:45,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:45,378 INFO L462 AbstractCegarLoop]: Abstraction has 2370 states and 7792 transitions. [2019-12-07 18:07:45,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:07:45,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 7792 transitions. [2019-12-07 18:07:45,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:07:45,381 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:45,381 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 18:07:45,381 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 18:07:45,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:45,381 INFO L82 PathProgramCache]: Analyzing trace with hash -754041251, now seen corresponding path program 1 times [2019-12-07 18:07:45,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:45,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356531805] [2019-12-07 18:07:45,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:45,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:45,448 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 18:07:45,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356531805] [2019-12-07 18:07:45,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:45,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:07:45,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077531403] [2019-12-07 18:07:45,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:07:45,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:45,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:07:45,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:07:45,449 INFO L87 Difference]: Start difference. First operand 2370 states and 7792 transitions. Second operand 6 states. [2019-12-07 18:07:45,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:45,665 INFO L93 Difference]: Finished difference Result 9526 states and 29591 transitions. [2019-12-07 18:07:45,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:07:45,665 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-12-07 18:07:45,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:45,674 INFO L225 Difference]: With dead ends: 9526 [2019-12-07 18:07:45,674 INFO L226 Difference]: Without dead ends: 7666 [2019-12-07 18:07:45,674 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 18:07:45,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7666 states. [2019-12-07 18:07:45,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7666 to 3194. [2019-12-07 18:07:45,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3194 states. [2019-12-07 18:07:45,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 10217 transitions. [2019-12-07 18:07:45,731 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 10217 transitions. Word has length 48 [2019-12-07 18:07:45,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:45,732 INFO L462 AbstractCegarLoop]: Abstraction has 3194 states and 10217 transitions. [2019-12-07 18:07:45,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:07:45,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 10217 transitions. [2019-12-07 18:07:45,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:07:45,736 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:45,736 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 18:07:45,736 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 18:07:45,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:45,736 INFO L82 PathProgramCache]: Analyzing trace with hash -231356835, now seen corresponding path program 2 times [2019-12-07 18:07:45,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:45,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580322664] [2019-12-07 18:07:45,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:45,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:07:45,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580322664] [2019-12-07 18:07:45,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:45,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:07:45,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350176799] [2019-12-07 18:07:45,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:07:45,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:45,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:07:45,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:07:45,805 INFO L87 Difference]: Start difference. First operand 3194 states and 10217 transitions. Second operand 5 states. [2019-12-07 18:07:45,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:45,846 INFO L93 Difference]: Finished difference Result 5235 states and 15549 transitions. [2019-12-07 18:07:45,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:07:45,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-07 18:07:45,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:45,850 INFO L225 Difference]: With dead ends: 5235 [2019-12-07 18:07:45,851 INFO L226 Difference]: Without dead ends: 3428 [2019-12-07 18:07:45,851 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 18:07:45,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3428 states. [2019-12-07 18:07:45,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3428 to 2898. [2019-12-07 18:07:45,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2898 states. [2019-12-07 18:07:45,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 9136 transitions. [2019-12-07 18:07:45,883 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 9136 transitions. Word has length 48 [2019-12-07 18:07:45,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:45,883 INFO L462 AbstractCegarLoop]: Abstraction has 2898 states and 9136 transitions. [2019-12-07 18:07:45,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:07:45,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 9136 transitions. [2019-12-07 18:07:45,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:07:45,887 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:45,887 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 18:07:45,887 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 18:07:45,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:45,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1878148035, now seen corresponding path program 3 times [2019-12-07 18:07:45,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:45,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821658717] [2019-12-07 18:07:45,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:45,932 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 18:07:45,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821658717] [2019-12-07 18:07:45,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:45,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:07:45,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367924540] [2019-12-07 18:07:45,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:07:45,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:45,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:07:45,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:07:45,933 INFO L87 Difference]: Start difference. First operand 2898 states and 9136 transitions. Second operand 3 states. [2019-12-07 18:07:45,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:45,945 INFO L93 Difference]: Finished difference Result 3450 states and 10403 transitions. [2019-12-07 18:07:45,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:07:45,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-12-07 18:07:45,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:45,949 INFO L225 Difference]: With dead ends: 3450 [2019-12-07 18:07:45,949 INFO L226 Difference]: Without dead ends: 2299 [2019-12-07 18:07:45,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:07:45,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2019-12-07 18:07:45,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 2299. [2019-12-07 18:07:45,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2299 states. [2019-12-07 18:07:45,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 6689 transitions. [2019-12-07 18:07:45,980 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 6689 transitions. Word has length 48 [2019-12-07 18:07:45,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:45,980 INFO L462 AbstractCegarLoop]: Abstraction has 2299 states and 6689 transitions. [2019-12-07 18:07:45,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:07:45,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 6689 transitions. [2019-12-07 18:07:45,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:07:45,983 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:45,983 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 18:07:45,983 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 18:07:45,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:45,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1908529501, now seen corresponding path program 4 times [2019-12-07 18:07:45,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:45,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170480534] [2019-12-07 18:07:45,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:46,045 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 18:07:46,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170480534] [2019-12-07 18:07:46,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:46,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:07:46,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957439793] [2019-12-07 18:07:46,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:07:46,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:46,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:07:46,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:07:46,046 INFO L87 Difference]: Start difference. First operand 2299 states and 6689 transitions. Second operand 4 states. [2019-12-07 18:07:46,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:46,075 INFO L93 Difference]: Finished difference Result 2803 states and 7859 transitions. [2019-12-07 18:07:46,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:07:46,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 18:07:46,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:46,077 INFO L225 Difference]: With dead ends: 2803 [2019-12-07 18:07:46,077 INFO L226 Difference]: Without dead ends: 2025 [2019-12-07 18:07:46,078 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 18:07:46,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2025 states. [2019-12-07 18:07:46,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2025 to 1639. [2019-12-07 18:07:46,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1639 states. [2019-12-07 18:07:46,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 4715 transitions. [2019-12-07 18:07:46,097 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 4715 transitions. Word has length 48 [2019-12-07 18:07:46,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:46,097 INFO L462 AbstractCegarLoop]: Abstraction has 1639 states and 4715 transitions. [2019-12-07 18:07:46,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:07:46,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 4715 transitions. [2019-12-07 18:07:46,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:07:46,099 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:46,099 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 18:07:46,099 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 18:07:46,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:46,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1923718495, now seen corresponding path program 5 times [2019-12-07 18:07:46,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:46,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921782464] [2019-12-07 18:07:46,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:46,312 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 18:07:46,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921782464] [2019-12-07 18:07:46,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:46,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:07:46,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335758458] [2019-12-07 18:07:46,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:07:46,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:46,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:07:46,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:07:46,313 INFO L87 Difference]: Start difference. First operand 1639 states and 4715 transitions. Second operand 12 states. [2019-12-07 18:07:47,406 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-12-07 18:07:47,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:47,773 INFO L93 Difference]: Finished difference Result 3325 states and 9273 transitions. [2019-12-07 18:07:47,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 18:07:47,773 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-07 18:07:47,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:47,776 INFO L225 Difference]: With dead ends: 3325 [2019-12-07 18:07:47,777 INFO L226 Difference]: Without dead ends: 3256 [2019-12-07 18:07:47,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=259, Invalid=863, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 18:07:47,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3256 states. [2019-12-07 18:07:47,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3256 to 1670. [2019-12-07 18:07:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1670 states. [2019-12-07 18:07:47,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 4816 transitions. [2019-12-07 18:07:47,798 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 4816 transitions. Word has length 48 [2019-12-07 18:07:47,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:47,799 INFO L462 AbstractCegarLoop]: Abstraction has 1670 states and 4816 transitions. [2019-12-07 18:07:47,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:07:47,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 4816 transitions. [2019-12-07 18:07:47,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:07:47,801 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:47,801 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 18:07:47,801 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 18:07:47,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:47,801 INFO L82 PathProgramCache]: Analyzing trace with hash -507128511, now seen corresponding path program 6 times [2019-12-07 18:07:47,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:47,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598689081] [2019-12-07 18:07:47,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:48,021 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 18:07:48,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598689081] [2019-12-07 18:07:48,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:48,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 18:07:48,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075410288] [2019-12-07 18:07:48,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 18:07:48,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:48,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:07:48,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:07:48,022 INFO L87 Difference]: Start difference. First operand 1670 states and 4816 transitions. Second operand 13 states. [2019-12-07 18:07:49,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:49,502 INFO L93 Difference]: Finished difference Result 3535 states and 9739 transitions. [2019-12-07 18:07:49,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 18:07:49,503 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2019-12-07 18:07:49,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:49,506 INFO L225 Difference]: With dead ends: 3535 [2019-12-07 18:07:49,506 INFO L226 Difference]: Without dead ends: 3452 [2019-12-07 18:07:49,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=326, Invalid=1080, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 18:07:49,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3452 states. [2019-12-07 18:07:49,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3452 to 1666. [2019-12-07 18:07:49,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1666 states. [2019-12-07 18:07:49,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 4806 transitions. [2019-12-07 18:07:49,532 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 4806 transitions. Word has length 48 [2019-12-07 18:07:49,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:49,533 INFO L462 AbstractCegarLoop]: Abstraction has 1666 states and 4806 transitions. [2019-12-07 18:07:49,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 18:07:49,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 4806 transitions. [2019-12-07 18:07:49,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:07:49,535 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:49,535 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 18:07:49,535 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 18:07:49,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:49,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1598211397, now seen corresponding path program 7 times [2019-12-07 18:07:49,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:49,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753449432] [2019-12-07 18:07:49,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:49,736 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 18:07:49,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753449432] [2019-12-07 18:07:49,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:49,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:07:49,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879475907] [2019-12-07 18:07:49,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:07:49,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:49,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:07:49,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:07:49,737 INFO L87 Difference]: Start difference. First operand 1666 states and 4806 transitions. Second operand 12 states. [2019-12-07 18:07:50,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:50,557 INFO L93 Difference]: Finished difference Result 3294 states and 9214 transitions. [2019-12-07 18:07:50,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 18:07:50,558 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-07 18:07:50,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:50,561 INFO L225 Difference]: With dead ends: 3294 [2019-12-07 18:07:50,561 INFO L226 Difference]: Without dead ends: 3225 [2019-12-07 18:07:50,561 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2019-12-07 18:07:50,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3225 states. [2019-12-07 18:07:50,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3225 to 1671. [2019-12-07 18:07:50,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1671 states. [2019-12-07 18:07:50,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 4823 transitions. [2019-12-07 18:07:50,582 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 4823 transitions. Word has length 48 [2019-12-07 18:07:50,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:50,583 INFO L462 AbstractCegarLoop]: Abstraction has 1671 states and 4823 transitions. [2019-12-07 18:07:50,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:07:50,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 4823 transitions. [2019-12-07 18:07:50,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:07:50,585 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:50,585 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 18:07:50,585 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 18:07:50,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:50,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1597405893, now seen corresponding path program 8 times [2019-12-07 18:07:50,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:50,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765587721] [2019-12-07 18:07:50,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:50,687 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 18:07:50,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765587721] [2019-12-07 18:07:50,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:50,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:07:50,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203293514] [2019-12-07 18:07:50,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:07:50,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:50,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:07:50,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:07:50,689 INFO L87 Difference]: Start difference. First operand 1671 states and 4823 transitions. Second operand 9 states. [2019-12-07 18:07:51,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:51,709 INFO L93 Difference]: Finished difference Result 6181 states and 17022 transitions. [2019-12-07 18:07:51,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 18:07:51,710 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2019-12-07 18:07:51,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:51,715 INFO L225 Difference]: With dead ends: 6181 [2019-12-07 18:07:51,715 INFO L226 Difference]: Without dead ends: 5779 [2019-12-07 18:07:51,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=396, Invalid=1244, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 18:07:51,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5779 states. [2019-12-07 18:07:51,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5779 to 1748. [2019-12-07 18:07:51,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1748 states. [2019-12-07 18:07:51,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 5079 transitions. [2019-12-07 18:07:51,749 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 5079 transitions. Word has length 48 [2019-12-07 18:07:51,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:51,750 INFO L462 AbstractCegarLoop]: Abstraction has 1748 states and 5079 transitions. [2019-12-07 18:07:51,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:07:51,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 5079 transitions. [2019-12-07 18:07:51,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:07:51,752 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:07:51,752 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:07:51,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:51,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1653554951, now seen corresponding path program 1 times [2019-12-07 18:07:51,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:51,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218569043] [2019-12-07 18:07:51,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:51,769 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 18:07:51,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218569043] [2019-12-07 18:07:51,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:51,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:07:51,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161251456] [2019-12-07 18:07:51,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:07:51,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:51,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:07:51,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:07:51,771 INFO L87 Difference]: Start difference. First operand 1748 states and 5079 transitions. Second operand 3 states. [2019-12-07 18:07:51,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:51,797 INFO L93 Difference]: Finished difference Result 1969 states and 5402 transitions. [2019-12-07 18:07:51,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:07:51,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-12-07 18:07:51,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:51,799 INFO L225 Difference]: With dead ends: 1969 [2019-12-07 18:07:51,799 INFO L226 Difference]: Without dead ends: 1921 [2019-12-07 18:07:51,800 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 18:07:51,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2019-12-07 18:07:51,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1669. [2019-12-07 18:07:51,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2019-12-07 18:07:51,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 4741 transitions. [2019-12-07 18:07:51,816 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 4741 transitions. Word has length 48 [2019-12-07 18:07:51,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:51,816 INFO L462 AbstractCegarLoop]: Abstraction has 1669 states and 4741 transitions. [2019-12-07 18:07:51,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:07:51,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 4741 transitions. [2019-12-07 18:07:51,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:07:51,818 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:51,819 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 18:07:51,819 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:07:51,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:51,819 INFO L82 PathProgramCache]: Analyzing trace with hash -296837363, now seen corresponding path program 9 times [2019-12-07 18:07:51,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:51,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342315645] [2019-12-07 18:07:51,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:07:51,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342315645] [2019-12-07 18:07:51,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:51,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:07:51,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532666307] [2019-12-07 18:07:51,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:07:51,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:51,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:07:51,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:07:51,872 INFO L87 Difference]: Start difference. First operand 1669 states and 4741 transitions. Second operand 5 states. [2019-12-07 18:07:51,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:51,907 INFO L93 Difference]: Finished difference Result 2102 states and 5703 transitions. [2019-12-07 18:07:51,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:07:51,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-07 18:07:51,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:51,908 INFO L225 Difference]: With dead ends: 2102 [2019-12-07 18:07:51,908 INFO L226 Difference]: Without dead ends: 481 [2019-12-07 18:07:51,908 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 18:07:51,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-12-07 18:07:51,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2019-12-07 18:07:51,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-12-07 18:07:51,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1047 transitions. [2019-12-07 18:07:51,912 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 1047 transitions. Word has length 48 [2019-12-07 18:07:51,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:51,912 INFO L462 AbstractCegarLoop]: Abstraction has 481 states and 1047 transitions. [2019-12-07 18:07:51,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:07:51,913 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 1047 transitions. [2019-12-07 18:07:51,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:07:51,913 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:51,913 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 18:07:51,913 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:07:51,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:51,914 INFO L82 PathProgramCache]: Analyzing trace with hash -126758993, now seen corresponding path program 10 times [2019-12-07 18:07:51,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:51,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608500161] [2019-12-07 18:07:51,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:51,972 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 18:07:51,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608500161] [2019-12-07 18:07:51,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:51,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:07:51,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780753281] [2019-12-07 18:07:51,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:07:51,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:51,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:07:51,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:07:51,973 INFO L87 Difference]: Start difference. First operand 481 states and 1047 transitions. Second operand 7 states. [2019-12-07 18:07:52,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:52,123 INFO L93 Difference]: Finished difference Result 849 states and 1817 transitions. [2019-12-07 18:07:52,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:07:52,123 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-07 18:07:52,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:52,124 INFO L225 Difference]: With dead ends: 849 [2019-12-07 18:07:52,124 INFO L226 Difference]: Without dead ends: 571 [2019-12-07 18:07:52,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:07:52,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-12-07 18:07:52,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 513. [2019-12-07 18:07:52,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2019-12-07 18:07:52,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 1107 transitions. [2019-12-07 18:07:52,128 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 1107 transitions. Word has length 48 [2019-12-07 18:07:52,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:52,128 INFO L462 AbstractCegarLoop]: Abstraction has 513 states and 1107 transitions. [2019-12-07 18:07:52,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:07:52,129 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 1107 transitions. [2019-12-07 18:07:52,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:07:52,129 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:52,129 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 18:07:52,129 INFO L410 AbstractCegarLoop]: === Iteration 23 === [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 18:07:52,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:52,130 INFO L82 PathProgramCache]: Analyzing trace with hash 24927743, now seen corresponding path program 11 times [2019-12-07 18:07:52,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:52,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556642077] [2019-12-07 18:07:52,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:07:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:07:52,191 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:07:52,191 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:07:52,194 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_ULTIMATE.start_main_~#t973~0.offset_37| 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= v_~y~0_19 0) (= v_~z$w_buff0~0_183 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t973~0.base_59|) (= 0 v_~z$r_buff1_thd1~0_59) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t973~0.base_59| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t973~0.base_59|) |v_ULTIMATE.start_main_~#t973~0.offset_37| 0)) |v_#memory_int_27|) (= 0 v_~z$r_buff0_thd4~0_166) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t973~0.base_59|)) (= 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_#valid_105| (store .cse0 |v_ULTIMATE.start_main_~#t973~0.base_59| 1)) (= 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) (= 0 v_~weak$$choice2~0_95) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t973~0.base_59| 4) |v_#length_31|) (= 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_~__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|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t974~0.base=|v_ULTIMATE.start_main_~#t974~0.base_56|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ULTIMATE.start_main_~#t974~0.offset=|v_ULTIMATE.start_main_~#t974~0.offset_35|, ~__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|, ~__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|, ULTIMATE.start_main_~#t976~0.offset=|v_ULTIMATE.start_main_~#t976~0.offset_22|, ~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, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_71, ~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|, ULTIMATE.start_main_~#t975~0.offset=|v_ULTIMATE.start_main_~#t975~0.offset_23|, ULTIMATE.start_main_~#t973~0.base=|v_ULTIMATE.start_main_~#t973~0.base_59|, ~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, ULTIMATE.start_main_~#t976~0.base=|v_ULTIMATE.start_main_~#t976~0.base_32|, ~y~0=v_~y~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ULTIMATE.start_main_~#t973~0.offset=|v_ULTIMATE.start_main_~#t973~0.offset_37|, ULTIMATE.start_main_~#t975~0.base=|v_ULTIMATE.start_main_~#t975~0.base_32|, ~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_#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|, ~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, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t974~0.base, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t974~0.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t976~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ULTIMATE.start_main_~#t975~0.offset, ULTIMATE.start_main_~#t973~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t976~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t973~0.offset, ULTIMATE.start_main_~#t975~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:07:52,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t974~0.base_11|) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t974~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t974~0.base_11| 0)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t974~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t974~0.offset_10|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t974~0.base_11| 4)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t974~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t974~0.base_11|) |v_ULTIMATE.start_main_~#t974~0.offset_10| 1)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t974~0.offset=|v_ULTIMATE.start_main_~#t974~0.offset_10|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t974~0.base=|v_ULTIMATE.start_main_~#t974~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t974~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t974~0.base] because there is no mapped edge [2019-12-07 18:07:52,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t975~0.base_12| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t975~0.base_12|)) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t975~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t975~0.offset_11|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t975~0.base_12| 1)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t975~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t975~0.base_12|) |v_ULTIMATE.start_main_~#t975~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t975~0.base_12|)) 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_~#t975~0.base=|v_ULTIMATE.start_main_~#t975~0.base_12|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t975~0.offset=|v_ULTIMATE.start_main_~#t975~0.offset_11|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t975~0.base, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t975~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 18:07:52,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t976~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t976~0.base_12|) |v_ULTIMATE.start_main_~#t976~0.offset_10| 3)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t976~0.base_12| 0)) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t976~0.base_12| 1)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t976~0.base_12|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t976~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t976~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t976~0.base_12|)) 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_~#t976~0.offset=|v_ULTIMATE.start_main_~#t976~0.offset_10|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t976~0.base=|v_ULTIMATE.start_main_~#t976~0.base_12|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t976~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t976~0.base, #length] because there is no mapped edge [2019-12-07 18:07:52,196 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 18:07:52,196 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 18:07:52,196 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 18:07:52,198 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 18:07:52,198 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 18:07:52,199 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 18:07:52,200 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 18:07:52,200 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 18:07:52,200 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 18:07:52,201 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 18:07:52,201 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 18:07:52,202 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 18:07:52,202 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 18:07:52,202 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 18:07:52,202 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 18:07:52,202 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 18:07:52,203 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 18:07:52,203 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 18:07:52,204 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 18:07:52,204 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 18:07:52,204 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 18:07:52,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:07:52 BasicIcfg [2019-12-07 18:07:52,255 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:07:52,255 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:07:52,255 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:07:52,255 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:07:52,256 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:07:34" (3/4) ... [2019-12-07 18:07:52,257 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:07:52,257 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_ULTIMATE.start_main_~#t973~0.offset_37| 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= v_~y~0_19 0) (= v_~z$w_buff0~0_183 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t973~0.base_59|) (= 0 v_~z$r_buff1_thd1~0_59) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t973~0.base_59| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t973~0.base_59|) |v_ULTIMATE.start_main_~#t973~0.offset_37| 0)) |v_#memory_int_27|) (= 0 v_~z$r_buff0_thd4~0_166) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t973~0.base_59|)) (= 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_#valid_105| (store .cse0 |v_ULTIMATE.start_main_~#t973~0.base_59| 1)) (= 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) (= 0 v_~weak$$choice2~0_95) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t973~0.base_59| 4) |v_#length_31|) (= 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_~__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|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t974~0.base=|v_ULTIMATE.start_main_~#t974~0.base_56|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ULTIMATE.start_main_~#t974~0.offset=|v_ULTIMATE.start_main_~#t974~0.offset_35|, ~__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|, ~__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|, ULTIMATE.start_main_~#t976~0.offset=|v_ULTIMATE.start_main_~#t976~0.offset_22|, ~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, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_71, ~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|, ULTIMATE.start_main_~#t975~0.offset=|v_ULTIMATE.start_main_~#t975~0.offset_23|, ULTIMATE.start_main_~#t973~0.base=|v_ULTIMATE.start_main_~#t973~0.base_59|, ~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, ULTIMATE.start_main_~#t976~0.base=|v_ULTIMATE.start_main_~#t976~0.base_32|, ~y~0=v_~y~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ULTIMATE.start_main_~#t973~0.offset=|v_ULTIMATE.start_main_~#t973~0.offset_37|, ULTIMATE.start_main_~#t975~0.base=|v_ULTIMATE.start_main_~#t975~0.base_32|, ~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_#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|, ~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, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t974~0.base, ~a~0, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t974~0.offset, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t976~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ULTIMATE.start_main_~#t975~0.offset, ULTIMATE.start_main_~#t973~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t976~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t973~0.offset, ULTIMATE.start_main_~#t975~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:07:52,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t974~0.base_11|) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t974~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t974~0.base_11| 0)) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t974~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t974~0.offset_10|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t974~0.base_11| 4)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t974~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t974~0.base_11|) |v_ULTIMATE.start_main_~#t974~0.offset_10| 1)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t974~0.offset=|v_ULTIMATE.start_main_~#t974~0.offset_10|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t974~0.base=|v_ULTIMATE.start_main_~#t974~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t974~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t974~0.base] because there is no mapped edge [2019-12-07 18:07:52,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t975~0.base_12| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t975~0.base_12|)) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t975~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t975~0.offset_11|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t975~0.base_12| 1)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t975~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t975~0.base_12|) |v_ULTIMATE.start_main_~#t975~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t975~0.base_12|)) 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_~#t975~0.base=|v_ULTIMATE.start_main_~#t975~0.base_12|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t975~0.offset=|v_ULTIMATE.start_main_~#t975~0.offset_11|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t975~0.base, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t975~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 18:07:52,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t976~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t976~0.base_12|) |v_ULTIMATE.start_main_~#t976~0.offset_10| 3)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t976~0.base_12| 0)) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t976~0.base_12| 1)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t976~0.base_12|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t976~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t976~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t976~0.base_12|)) 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_~#t976~0.offset=|v_ULTIMATE.start_main_~#t976~0.offset_10|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t976~0.base=|v_ULTIMATE.start_main_~#t976~0.base_12|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t976~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t976~0.base, #length] because there is no mapped edge [2019-12-07 18:07:52,259 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 18:07:52,259 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 18:07:52,260 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 18:07:52,261 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 18:07:52,261 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 18:07:52,262 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 18:07:52,263 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 18:07:52,263 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 18:07:52,264 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 18:07:52,264 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 18:07:52,264 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 18:07:52,265 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 18:07:52,265 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 18:07:52,265 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 18:07:52,266 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 18:07:52,266 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 18:07:52,266 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 18:07:52,267 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 18:07:52,267 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 18:07:52,267 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 18:07:52,268 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 18:07:52,316 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ff6bf84f-91b5-451f-bc64-80e5f26f6eb1/bin/uautomizer/witness.graphml [2019-12-07 18:07:52,317 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:07:52,318 INFO L168 Benchmark]: Toolchain (without parser) took 18274.45 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 935.3 MB in the beginning and 1.8 GB in the end (delta: -841.7 MB). Peak memory consumption was 387.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:07:52,318 INFO L168 Benchmark]: CDTParser took 0.18 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 18:07:52,318 INFO L168 Benchmark]: CACSL2BoogieTranslator took 395.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -120.0 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:07:52,319 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.78 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:07:52,319 INFO L168 Benchmark]: Boogie Preprocessor took 25.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:07:52,319 INFO L168 Benchmark]: RCFGBuilder took 390.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 994.4 MB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:07:52,319 INFO L168 Benchmark]: TraceAbstraction took 17360.70 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 994.4 MB in the beginning and 1.8 GB in the end (delta: -815.5 MB). Peak memory consumption was 326.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:07:52,320 INFO L168 Benchmark]: Witness Printer took 61.59 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:07:52,321 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.18 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 395.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -120.0 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.78 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 390.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 994.4 MB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17360.70 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.1 GB). Free memory was 994.4 MB in the beginning and 1.8 GB in the end (delta: -815.5 MB). Peak memory consumption was 326.3 MB. Max. memory is 11.5 GB. * Witness Printer took 61.59 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 170 ProgramPointsBefore, 74 ProgramPointsAfterwards, 192 TransitionsBefore, 78 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 23 ChoiceCompositions, 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(&t973, ((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(&t974, ((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(&t975, ((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(&t976, ((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: 17.2s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2888 SDtfs, 5679 SDslu, 7645 SDs, 0 SdLazy, 3820 SolverSat, 632 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1279 ImplicationChecksByTransitivity, 3.7s 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, 22 MinimizatonAttempts, 30169 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 843 NumberOfCodeBlocks, 843 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 773 ConstructedInterpolants, 0 QuantifiedInterpolants, 262050 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...