./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe002_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b0c2c0f7-5b7c-46ae-aef1-50e73232336d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b0c2c0f7-5b7c-46ae-aef1-50e73232336d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b0c2c0f7-5b7c-46ae-aef1-50e73232336d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b0c2c0f7-5b7c-46ae-aef1-50e73232336d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe002_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b0c2c0f7-5b7c-46ae-aef1-50e73232336d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b0c2c0f7-5b7c-46ae-aef1-50e73232336d/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 3cbef3fe8ef2bfaae1304d9a0ba00ebf52855a5e .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 13:13:53,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:13:53,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:13:53,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:13:53,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:13:53,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:13:53,702 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:13:53,703 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:13:53,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:13:53,705 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:13:53,706 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:13:53,706 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:13:53,707 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:13:53,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:13:53,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:13:53,709 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:13:53,709 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:13:53,710 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:13:53,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:13:53,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:13:53,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:13:53,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:13:53,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:13:53,715 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:13:53,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:13:53,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:13:53,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:13:53,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:13:53,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:13:53,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:13:53,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:13:53,719 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:13:53,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:13:53,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:13:53,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:13:53,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:13:53,721 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:13:53,721 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:13:53,721 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:13:53,722 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:13:53,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:13:53,723 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b0c2c0f7-5b7c-46ae-aef1-50e73232336d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:13:53,732 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:13:53,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:13:53,733 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:13:53,733 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:13:53,733 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:13:53,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:13:53,734 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:13:53,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:13:53,734 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:13:53,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:13:53,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:13:53,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:13:53,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:13:53,734 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:13:53,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:13:53,735 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:13:53,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:13:53,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:13:53,735 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:13:53,735 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:13:53,735 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:13:53,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:13:53,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:13:53,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:13:53,736 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:13:53,736 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:13:53,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:13:53,736 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:13:53,736 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:13:53,736 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_b0c2c0f7-5b7c-46ae-aef1-50e73232336d/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 -> 3cbef3fe8ef2bfaae1304d9a0ba00ebf52855a5e [2019-12-07 13:13:53,835 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:13:53,845 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:13:53,848 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:13:53,849 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:13:53,849 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:13:53,850 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b0c2c0f7-5b7c-46ae-aef1-50e73232336d/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe002_rmo.opt.i [2019-12-07 13:13:53,895 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b0c2c0f7-5b7c-46ae-aef1-50e73232336d/bin/uautomizer/data/5bd696b30/cd35adcf85c04fc1b6d2c25e005b1f9c/FLAG26173a358 [2019-12-07 13:13:54,325 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:13:54,326 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b0c2c0f7-5b7c-46ae-aef1-50e73232336d/sv-benchmarks/c/pthread-wmm/safe002_rmo.opt.i [2019-12-07 13:13:54,336 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b0c2c0f7-5b7c-46ae-aef1-50e73232336d/bin/uautomizer/data/5bd696b30/cd35adcf85c04fc1b6d2c25e005b1f9c/FLAG26173a358 [2019-12-07 13:13:54,684 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b0c2c0f7-5b7c-46ae-aef1-50e73232336d/bin/uautomizer/data/5bd696b30/cd35adcf85c04fc1b6d2c25e005b1f9c [2019-12-07 13:13:54,687 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:13:54,688 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:13:54,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:13:54,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:13:54,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:13:54,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:13:54" (1/1) ... [2019-12-07 13:13:54,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46581b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:54, skipping insertion in model container [2019-12-07 13:13:54,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:13:54" (1/1) ... [2019-12-07 13:13:54,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:13:54,725 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:13:54,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:13:54,974 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:13:55,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:13:55,060 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:13:55,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:55 WrapperNode [2019-12-07 13:13:55,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:13:55,061 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:13:55,061 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:13:55,061 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:13:55,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:55" (1/1) ... [2019-12-07 13:13:55,079 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:55" (1/1) ... [2019-12-07 13:13:55,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:13:55,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:13:55,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:13:55,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:13:55,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:55" (1/1) ... [2019-12-07 13:13:55,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:55" (1/1) ... [2019-12-07 13:13:55,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:55" (1/1) ... [2019-12-07 13:13:55,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:55" (1/1) ... [2019-12-07 13:13:55,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:55" (1/1) ... [2019-12-07 13:13:55,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:55" (1/1) ... [2019-12-07 13:13:55,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:55" (1/1) ... [2019-12-07 13:13:55,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:13:55,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:13:55,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:13:55,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:13:55,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b0c2c0f7-5b7c-46ae-aef1-50e73232336d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:13:55,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:13:55,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:13:55,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:13:55,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:13:55,167 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:13:55,167 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:13:55,167 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:13:55,167 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:13:55,168 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 13:13:55,168 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 13:13:55,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:13:55,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:13:55,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:13:55,169 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 13:13:55,514 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:13:55,514 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:13:55,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:13:55 BoogieIcfgContainer [2019-12-07 13:13:55,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:13:55,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:13:55,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:13:55,518 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:13:55,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:13:54" (1/3) ... [2019-12-07 13:13:55,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6032ea81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:13:55, skipping insertion in model container [2019-12-07 13:13:55,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:13:55" (2/3) ... [2019-12-07 13:13:55,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6032ea81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:13:55, skipping insertion in model container [2019-12-07 13:13:55,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:13:55" (3/3) ... [2019-12-07 13:13:55,520 INFO L109 eAbstractionObserver]: Analyzing ICFG safe002_rmo.opt.i [2019-12-07 13:13:55,526 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:13:55,527 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:13:55,531 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:13:55,532 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:13:55,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,556 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,556 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,558 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,561 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,564 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,567 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,567 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,568 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,568 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,568 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,571 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,571 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:13:55,588 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 13:13:55,605 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:13:55,605 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:13:55,606 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:13:55,606 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:13:55,606 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:13:55,606 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:13:55,606 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:13:55,606 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:13:55,618 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-07 13:13:55,619 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-07 13:13:55,675 INFO L134 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-07 13:13:55,675 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:13:55,685 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 716 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 13:13:55,699 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-07 13:13:55,732 INFO L134 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-07 13:13:55,732 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:13:55,738 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 716 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 13:13:55,753 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 13:13:55,754 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:13:58,760 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 13:13:58,851 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64859 [2019-12-07 13:13:58,851 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-07 13:13:58,854 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-07 13:14:07,298 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80448 states. [2019-12-07 13:14:07,300 INFO L276 IsEmpty]: Start isEmpty. Operand 80448 states. [2019-12-07 13:14:07,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 13:14:07,303 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:07,304 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 13:14:07,304 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:07,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:07,308 INFO L82 PathProgramCache]: Analyzing trace with hash 798334706, now seen corresponding path program 1 times [2019-12-07 13:14:07,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:14:07,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76968005] [2019-12-07 13:14:07,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:14:07,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76968005] [2019-12-07 13:14:07,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:14:07,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:14:07,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600168242] [2019-12-07 13:14:07,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:14:07,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:14:07,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:14:07,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:14:07,471 INFO L87 Difference]: Start difference. First operand 80448 states. Second operand 3 states. [2019-12-07 13:14:08,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:08,068 INFO L93 Difference]: Finished difference Result 79498 states and 344058 transitions. [2019-12-07 13:14:08,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:14:08,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 13:14:08,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:08,654 INFO L225 Difference]: With dead ends: 79498 [2019-12-07 13:14:08,654 INFO L226 Difference]: Without dead ends: 74626 [2019-12-07 13:14:08,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:14:11,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74626 states. [2019-12-07 13:14:12,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74626 to 74626. [2019-12-07 13:14:12,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74626 states. [2019-12-07 13:14:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74626 states to 74626 states and 322484 transitions. [2019-12-07 13:14:12,752 INFO L78 Accepts]: Start accepts. Automaton has 74626 states and 322484 transitions. Word has length 5 [2019-12-07 13:14:12,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:12,753 INFO L462 AbstractCegarLoop]: Abstraction has 74626 states and 322484 transitions. [2019-12-07 13:14:12,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:14:12,753 INFO L276 IsEmpty]: Start isEmpty. Operand 74626 states and 322484 transitions. [2019-12-07 13:14:12,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:14:12,761 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:12,761 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:14:12,762 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:12,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:12,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1987891641, now seen corresponding path program 1 times [2019-12-07 13:14:12,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:14:12,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602934284] [2019-12-07 13:14:12,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:12,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:14:12,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602934284] [2019-12-07 13:14:12,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:14:12,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:14:12,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877441793] [2019-12-07 13:14:12,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:14:12,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:14:12,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:14:12,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:14:12,824 INFO L87 Difference]: Start difference. First operand 74626 states and 322484 transitions. Second operand 3 states. [2019-12-07 13:14:12,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:12,922 INFO L93 Difference]: Finished difference Result 19918 states and 69198 transitions. [2019-12-07 13:14:12,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:14:12,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 13:14:12,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:12,962 INFO L225 Difference]: With dead ends: 19918 [2019-12-07 13:14:12,962 INFO L226 Difference]: Without dead ends: 19918 [2019-12-07 13:14:12,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:14:13,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19918 states. [2019-12-07 13:14:13,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19918 to 19918. [2019-12-07 13:14:13,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19918 states. [2019-12-07 13:14:13,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19918 states to 19918 states and 69198 transitions. [2019-12-07 13:14:13,317 INFO L78 Accepts]: Start accepts. Automaton has 19918 states and 69198 transitions. Word has length 13 [2019-12-07 13:14:13,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:13,317 INFO L462 AbstractCegarLoop]: Abstraction has 19918 states and 69198 transitions. [2019-12-07 13:14:13,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:14:13,317 INFO L276 IsEmpty]: Start isEmpty. Operand 19918 states and 69198 transitions. [2019-12-07 13:14:13,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:14:13,319 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:13,319 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:14:13,319 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:13,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:13,319 INFO L82 PathProgramCache]: Analyzing trace with hash -225338063, now seen corresponding path program 1 times [2019-12-07 13:14:13,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:14:13,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347515949] [2019-12-07 13:14:13,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:13,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:14:13,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347515949] [2019-12-07 13:14:13,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:14:13,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:14:13,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237366297] [2019-12-07 13:14:13,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:14:13,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:14:13,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:14:13,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:14:13,382 INFO L87 Difference]: Start difference. First operand 19918 states and 69198 transitions. Second operand 4 states. [2019-12-07 13:14:13,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:13,615 INFO L93 Difference]: Finished difference Result 29603 states and 99212 transitions. [2019-12-07 13:14:13,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:14:13,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 13:14:13,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:13,667 INFO L225 Difference]: With dead ends: 29603 [2019-12-07 13:14:13,667 INFO L226 Difference]: Without dead ends: 29589 [2019-12-07 13:14:13,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:14:13,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29589 states. [2019-12-07 13:14:14,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29589 to 26899. [2019-12-07 13:14:14,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26899 states. [2019-12-07 13:14:14,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26899 states to 26899 states and 90919 transitions. [2019-12-07 13:14:14,978 INFO L78 Accepts]: Start accepts. Automaton has 26899 states and 90919 transitions. Word has length 13 [2019-12-07 13:14:14,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:14,979 INFO L462 AbstractCegarLoop]: Abstraction has 26899 states and 90919 transitions. [2019-12-07 13:14:14,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:14:14,979 INFO L276 IsEmpty]: Start isEmpty. Operand 26899 states and 90919 transitions. [2019-12-07 13:14:14,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 13:14:14,980 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:14,980 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:14:14,980 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:14,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:14,980 INFO L82 PathProgramCache]: Analyzing trace with hash -457982250, now seen corresponding path program 1 times [2019-12-07 13:14:14,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:14:14,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517652274] [2019-12-07 13:14:14,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:15,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:14:15,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517652274] [2019-12-07 13:14:15,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:14:15,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:14:15,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818500402] [2019-12-07 13:14:15,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:14:15,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:14:15,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:14:15,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:14:15,037 INFO L87 Difference]: Start difference. First operand 26899 states and 90919 transitions. Second operand 5 states. [2019-12-07 13:14:15,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:15,341 INFO L93 Difference]: Finished difference Result 40028 states and 132579 transitions. [2019-12-07 13:14:15,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:14:15,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 13:14:15,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:15,406 INFO L225 Difference]: With dead ends: 40028 [2019-12-07 13:14:15,406 INFO L226 Difference]: Without dead ends: 40010 [2019-12-07 13:14:15,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:14:15,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40010 states. [2019-12-07 13:14:15,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40010 to 31276. [2019-12-07 13:14:15,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31276 states. [2019-12-07 13:14:16,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31276 states to 31276 states and 104921 transitions. [2019-12-07 13:14:16,042 INFO L78 Accepts]: Start accepts. Automaton has 31276 states and 104921 transitions. Word has length 14 [2019-12-07 13:14:16,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:16,043 INFO L462 AbstractCegarLoop]: Abstraction has 31276 states and 104921 transitions. [2019-12-07 13:14:16,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:14:16,043 INFO L276 IsEmpty]: Start isEmpty. Operand 31276 states and 104921 transitions. [2019-12-07 13:14:16,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 13:14:16,050 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:16,050 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:14:16,050 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:16,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:16,051 INFO L82 PathProgramCache]: Analyzing trace with hash -620486811, now seen corresponding path program 1 times [2019-12-07 13:14:16,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:14:16,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890890631] [2019-12-07 13:14:16,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:16,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:14:16,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890890631] [2019-12-07 13:14:16,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:14:16,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:14:16,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240214125] [2019-12-07 13:14:16,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:14:16,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:14:16,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:14:16,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:14:16,136 INFO L87 Difference]: Start difference. First operand 31276 states and 104921 transitions. Second operand 6 states. [2019-12-07 13:14:16,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:16,732 INFO L93 Difference]: Finished difference Result 54414 states and 177321 transitions. [2019-12-07 13:14:16,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:14:16,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 13:14:16,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:16,819 INFO L225 Difference]: With dead ends: 54414 [2019-12-07 13:14:16,819 INFO L226 Difference]: Without dead ends: 54384 [2019-12-07 13:14:16,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:14:17,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54384 states. [2019-12-07 13:14:17,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54384 to 36377. [2019-12-07 13:14:17,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36377 states. [2019-12-07 13:14:17,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36377 states to 36377 states and 120495 transitions. [2019-12-07 13:14:17,663 INFO L78 Accepts]: Start accepts. Automaton has 36377 states and 120495 transitions. Word has length 22 [2019-12-07 13:14:17,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:17,663 INFO L462 AbstractCegarLoop]: Abstraction has 36377 states and 120495 transitions. [2019-12-07 13:14:17,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:14:17,663 INFO L276 IsEmpty]: Start isEmpty. Operand 36377 states and 120495 transitions. [2019-12-07 13:14:17,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 13:14:17,670 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:17,670 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:14:17,670 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:17,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:17,670 INFO L82 PathProgramCache]: Analyzing trace with hash -2022809675, now seen corresponding path program 2 times [2019-12-07 13:14:17,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:14:17,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139867787] [2019-12-07 13:14:17,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:17,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:14:17,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139867787] [2019-12-07 13:14:17,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:14:17,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:14:17,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903498931] [2019-12-07 13:14:17,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:14:17,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:14:17,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:14:17,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:14:17,756 INFO L87 Difference]: Start difference. First operand 36377 states and 120495 transitions. Second operand 7 states. [2019-12-07 13:14:18,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:18,727 INFO L93 Difference]: Finished difference Result 54885 states and 178707 transitions. [2019-12-07 13:14:18,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 13:14:18,728 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-07 13:14:18,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:18,815 INFO L225 Difference]: With dead ends: 54885 [2019-12-07 13:14:18,815 INFO L226 Difference]: Without dead ends: 54843 [2019-12-07 13:14:18,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:14:19,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54843 states. [2019-12-07 13:14:19,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54843 to 31795. [2019-12-07 13:14:19,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31795 states. [2019-12-07 13:14:19,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31795 states to 31795 states and 106002 transitions. [2019-12-07 13:14:19,533 INFO L78 Accepts]: Start accepts. Automaton has 31795 states and 106002 transitions. Word has length 22 [2019-12-07 13:14:19,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:19,534 INFO L462 AbstractCegarLoop]: Abstraction has 31795 states and 106002 transitions. [2019-12-07 13:14:19,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:14:19,534 INFO L276 IsEmpty]: Start isEmpty. Operand 31795 states and 106002 transitions. [2019-12-07 13:14:19,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 13:14:19,544 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:19,544 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] [2019-12-07 13:14:19,544 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:19,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:19,544 INFO L82 PathProgramCache]: Analyzing trace with hash -364842915, now seen corresponding path program 1 times [2019-12-07 13:14:19,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:14:19,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4122899] [2019-12-07 13:14:19,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:14:19,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4122899] [2019-12-07 13:14:19,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:14:19,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:14:19,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653134311] [2019-12-07 13:14:19,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:14:19,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:14:19,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:14:19,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:14:19,590 INFO L87 Difference]: Start difference. First operand 31795 states and 106002 transitions. Second operand 4 states. [2019-12-07 13:14:19,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:19,636 INFO L93 Difference]: Finished difference Result 12400 states and 38387 transitions. [2019-12-07 13:14:19,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:14:19,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 13:14:19,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:19,652 INFO L225 Difference]: With dead ends: 12400 [2019-12-07 13:14:19,652 INFO L226 Difference]: Without dead ends: 12400 [2019-12-07 13:14:19,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:14:19,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12400 states. [2019-12-07 13:14:19,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12400 to 12304. [2019-12-07 13:14:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12304 states. [2019-12-07 13:14:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12304 states to 12304 states and 38107 transitions. [2019-12-07 13:14:19,828 INFO L78 Accepts]: Start accepts. Automaton has 12304 states and 38107 transitions. Word has length 25 [2019-12-07 13:14:19,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:19,829 INFO L462 AbstractCegarLoop]: Abstraction has 12304 states and 38107 transitions. [2019-12-07 13:14:19,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:14:19,829 INFO L276 IsEmpty]: Start isEmpty. Operand 12304 states and 38107 transitions. [2019-12-07 13:14:19,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 13:14:19,845 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:19,845 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] [2019-12-07 13:14:19,845 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:19,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:19,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1598965693, now seen corresponding path program 1 times [2019-12-07 13:14:19,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:14:19,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121381981] [2019-12-07 13:14:19,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:19,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:14:19,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121381981] [2019-12-07 13:14:19,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:14:19,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:14:19,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426745235] [2019-12-07 13:14:19,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:14:19,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:14:19,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:14:19,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:14:19,900 INFO L87 Difference]: Start difference. First operand 12304 states and 38107 transitions. Second operand 5 states. [2019-12-07 13:14:20,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:20,277 INFO L93 Difference]: Finished difference Result 18172 states and 55690 transitions. [2019-12-07 13:14:20,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:14:20,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 13:14:20,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:20,297 INFO L225 Difference]: With dead ends: 18172 [2019-12-07 13:14:20,297 INFO L226 Difference]: Without dead ends: 18172 [2019-12-07 13:14:20,297 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:14:20,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18172 states. [2019-12-07 13:14:20,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18172 to 16609. [2019-12-07 13:14:20,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16609 states. [2019-12-07 13:14:20,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16609 states to 16609 states and 51273 transitions. [2019-12-07 13:14:20,538 INFO L78 Accepts]: Start accepts. Automaton has 16609 states and 51273 transitions. Word has length 39 [2019-12-07 13:14:20,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:20,538 INFO L462 AbstractCegarLoop]: Abstraction has 16609 states and 51273 transitions. [2019-12-07 13:14:20,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:14:20,538 INFO L276 IsEmpty]: Start isEmpty. Operand 16609 states and 51273 transitions. [2019-12-07 13:14:20,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 13:14:20,561 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:20,561 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] [2019-12-07 13:14:20,561 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:20,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:20,561 INFO L82 PathProgramCache]: Analyzing trace with hash -2135894693, now seen corresponding path program 2 times [2019-12-07 13:14:20,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:14:20,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083256612] [2019-12-07 13:14:20,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:20,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:14:20,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083256612] [2019-12-07 13:14:20,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:14:20,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:14:20,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648325548] [2019-12-07 13:14:20,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:14:20,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:14:20,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:14:20,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:14:20,618 INFO L87 Difference]: Start difference. First operand 16609 states and 51273 transitions. Second operand 3 states. [2019-12-07 13:14:20,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:20,665 INFO L93 Difference]: Finished difference Result 15813 states and 48264 transitions. [2019-12-07 13:14:20,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:14:20,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 13:14:20,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:20,684 INFO L225 Difference]: With dead ends: 15813 [2019-12-07 13:14:20,684 INFO L226 Difference]: Without dead ends: 15813 [2019-12-07 13:14:20,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:14:20,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15813 states. [2019-12-07 13:14:20,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15813 to 15725. [2019-12-07 13:14:20,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15725 states. [2019-12-07 13:14:20,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15725 states to 15725 states and 48020 transitions. [2019-12-07 13:14:20,898 INFO L78 Accepts]: Start accepts. Automaton has 15725 states and 48020 transitions. Word has length 39 [2019-12-07 13:14:20,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:20,898 INFO L462 AbstractCegarLoop]: Abstraction has 15725 states and 48020 transitions. [2019-12-07 13:14:20,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:14:20,899 INFO L276 IsEmpty]: Start isEmpty. Operand 15725 states and 48020 transitions. [2019-12-07 13:14:20,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 13:14:20,919 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:20,919 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:14:20,919 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:20,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:20,920 INFO L82 PathProgramCache]: Analyzing trace with hash 790151032, now seen corresponding path program 1 times [2019-12-07 13:14:20,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:14:20,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346539161] [2019-12-07 13:14:20,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:20,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:14:20,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346539161] [2019-12-07 13:14:20,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:14:20,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:14:20,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563962873] [2019-12-07 13:14:20,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:14:20,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:14:20,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:14:20,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:14:20,958 INFO L87 Difference]: Start difference. First operand 15725 states and 48020 transitions. Second operand 5 states. [2019-12-07 13:14:21,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:21,011 INFO L93 Difference]: Finished difference Result 14435 states and 44715 transitions. [2019-12-07 13:14:21,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:14:21,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 13:14:21,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:21,028 INFO L225 Difference]: With dead ends: 14435 [2019-12-07 13:14:21,028 INFO L226 Difference]: Without dead ends: 14435 [2019-12-07 13:14:21,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:14:21,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14435 states. [2019-12-07 13:14:21,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14435 to 13775. [2019-12-07 13:14:21,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13775 states. [2019-12-07 13:14:21,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13775 states to 13775 states and 42858 transitions. [2019-12-07 13:14:21,227 INFO L78 Accepts]: Start accepts. Automaton has 13775 states and 42858 transitions. Word has length 40 [2019-12-07 13:14:21,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:21,227 INFO L462 AbstractCegarLoop]: Abstraction has 13775 states and 42858 transitions. [2019-12-07 13:14:21,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:14:21,227 INFO L276 IsEmpty]: Start isEmpty. Operand 13775 states and 42858 transitions. [2019-12-07 13:14:21,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 13:14:21,244 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:21,244 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:14:21,244 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:21,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:21,244 INFO L82 PathProgramCache]: Analyzing trace with hash 875448344, now seen corresponding path program 1 times [2019-12-07 13:14:21,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:14:21,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138178313] [2019-12-07 13:14:21,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:21,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:14:21,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138178313] [2019-12-07 13:14:21,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:14:21,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:14:21,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608397902] [2019-12-07 13:14:21,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:14:21,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:14:21,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:14:21,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:14:21,290 INFO L87 Difference]: Start difference. First operand 13775 states and 42858 transitions. Second operand 3 states. [2019-12-07 13:14:21,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:21,353 INFO L93 Difference]: Finished difference Result 18601 states and 57951 transitions. [2019-12-07 13:14:21,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:14:21,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 13:14:21,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:21,375 INFO L225 Difference]: With dead ends: 18601 [2019-12-07 13:14:21,375 INFO L226 Difference]: Without dead ends: 18601 [2019-12-07 13:14:21,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:14:21,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18601 states. [2019-12-07 13:14:21,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18601 to 15607. [2019-12-07 13:14:21,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15607 states. [2019-12-07 13:14:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15607 states to 15607 states and 49073 transitions. [2019-12-07 13:14:21,626 INFO L78 Accepts]: Start accepts. Automaton has 15607 states and 49073 transitions. Word has length 55 [2019-12-07 13:14:21,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:21,626 INFO L462 AbstractCegarLoop]: Abstraction has 15607 states and 49073 transitions. [2019-12-07 13:14:21,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:14:21,627 INFO L276 IsEmpty]: Start isEmpty. Operand 15607 states and 49073 transitions. [2019-12-07 13:14:21,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 13:14:21,641 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:21,641 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:14:21,641 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:21,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:21,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1829960825, now seen corresponding path program 1 times [2019-12-07 13:14:21,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:14:21,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522705041] [2019-12-07 13:14:21,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:14:21,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522705041] [2019-12-07 13:14:21,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:14:21,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:14:21,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613820845] [2019-12-07 13:14:21,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:14:21,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:14:21,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:14:21,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:14:21,720 INFO L87 Difference]: Start difference. First operand 15607 states and 49073 transitions. Second operand 3 states. [2019-12-07 13:14:21,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:21,763 INFO L93 Difference]: Finished difference Result 15607 states and 49071 transitions. [2019-12-07 13:14:21,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:14:21,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 13:14:21,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:21,781 INFO L225 Difference]: With dead ends: 15607 [2019-12-07 13:14:21,782 INFO L226 Difference]: Without dead ends: 15607 [2019-12-07 13:14:21,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:14:21,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15607 states. [2019-12-07 13:14:21,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15607 to 14620. [2019-12-07 13:14:21,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14620 states. [2019-12-07 13:14:21,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14620 states to 14620 states and 46248 transitions. [2019-12-07 13:14:21,999 INFO L78 Accepts]: Start accepts. Automaton has 14620 states and 46248 transitions. Word has length 55 [2019-12-07 13:14:21,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:21,999 INFO L462 AbstractCegarLoop]: Abstraction has 14620 states and 46248 transitions. [2019-12-07 13:14:21,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:14:21,999 INFO L276 IsEmpty]: Start isEmpty. Operand 14620 states and 46248 transitions. [2019-12-07 13:14:22,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 13:14:22,014 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:22,014 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:14:22,014 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:22,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:22,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1826980617, now seen corresponding path program 1 times [2019-12-07 13:14:22,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:14:22,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689641515] [2019-12-07 13:14:22,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:22,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:14:22,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689641515] [2019-12-07 13:14:22,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:14:22,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:14:22,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734282473] [2019-12-07 13:14:22,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:14:22,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:14:22,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:14:22,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:14:22,095 INFO L87 Difference]: Start difference. First operand 14620 states and 46248 transitions. Second operand 5 states. [2019-12-07 13:14:22,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:22,195 INFO L93 Difference]: Finished difference Result 38006 states and 120382 transitions. [2019-12-07 13:14:22,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:14:22,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-07 13:14:22,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:22,224 INFO L225 Difference]: With dead ends: 38006 [2019-12-07 13:14:22,224 INFO L226 Difference]: Without dead ends: 23076 [2019-12-07 13:14:22,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:14:22,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23076 states. [2019-12-07 13:14:22,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23076 to 13804. [2019-12-07 13:14:22,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13804 states. [2019-12-07 13:14:22,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13804 states to 13804 states and 43687 transitions. [2019-12-07 13:14:22,511 INFO L78 Accepts]: Start accepts. Automaton has 13804 states and 43687 transitions. Word has length 56 [2019-12-07 13:14:22,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:22,511 INFO L462 AbstractCegarLoop]: Abstraction has 13804 states and 43687 transitions. [2019-12-07 13:14:22,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:14:22,511 INFO L276 IsEmpty]: Start isEmpty. Operand 13804 states and 43687 transitions. [2019-12-07 13:14:22,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 13:14:22,527 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:22,528 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:14:22,528 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:22,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:22,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1502708477, now seen corresponding path program 2 times [2019-12-07 13:14:22,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:14:22,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428075268] [2019-12-07 13:14:22,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:22,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:14:22,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428075268] [2019-12-07 13:14:22,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:14:22,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:14:22,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125109296] [2019-12-07 13:14:22,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:14:22,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:14:22,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:14:22,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:14:22,608 INFO L87 Difference]: Start difference. First operand 13804 states and 43687 transitions. Second operand 5 states. [2019-12-07 13:14:22,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:22,728 INFO L93 Difference]: Finished difference Result 38534 states and 122679 transitions. [2019-12-07 13:14:22,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:14:22,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-07 13:14:22,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:22,737 INFO L225 Difference]: With dead ends: 38534 [2019-12-07 13:14:22,737 INFO L226 Difference]: Without dead ends: 7630 [2019-12-07 13:14:22,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:14:22,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7630 states. [2019-12-07 13:14:22,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7630 to 7630. [2019-12-07 13:14:22,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7630 states. [2019-12-07 13:14:22,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7630 states to 7630 states and 24403 transitions. [2019-12-07 13:14:22,871 INFO L78 Accepts]: Start accepts. Automaton has 7630 states and 24403 transitions. Word has length 56 [2019-12-07 13:14:22,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:22,872 INFO L462 AbstractCegarLoop]: Abstraction has 7630 states and 24403 transitions. [2019-12-07 13:14:22,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:14:22,872 INFO L276 IsEmpty]: Start isEmpty. Operand 7630 states and 24403 transitions. [2019-12-07 13:14:22,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 13:14:22,879 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:22,879 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:14:22,879 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:22,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:22,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1692402453, now seen corresponding path program 3 times [2019-12-07 13:14:22,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:14:22,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694225314] [2019-12-07 13:14:22,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:23,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:14:23,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694225314] [2019-12-07 13:14:23,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:14:23,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 13:14:23,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724737267] [2019-12-07 13:14:23,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 13:14:23,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:14:23,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 13:14:23,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:14:23,096 INFO L87 Difference]: Start difference. First operand 7630 states and 24403 transitions. Second operand 12 states. [2019-12-07 13:14:24,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:24,393 INFO L93 Difference]: Finished difference Result 18646 states and 57989 transitions. [2019-12-07 13:14:24,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 13:14:24,393 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-07 13:14:24,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:24,404 INFO L225 Difference]: With dead ends: 18646 [2019-12-07 13:14:24,404 INFO L226 Difference]: Without dead ends: 10756 [2019-12-07 13:14:24,405 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=287, Invalid=1273, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 13:14:24,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10756 states. [2019-12-07 13:14:24,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10756 to 9151. [2019-12-07 13:14:24,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9151 states. [2019-12-07 13:14:24,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9151 states to 9151 states and 28487 transitions. [2019-12-07 13:14:24,543 INFO L78 Accepts]: Start accepts. Automaton has 9151 states and 28487 transitions. Word has length 56 [2019-12-07 13:14:24,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:24,544 INFO L462 AbstractCegarLoop]: Abstraction has 9151 states and 28487 transitions. [2019-12-07 13:14:24,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 13:14:24,544 INFO L276 IsEmpty]: Start isEmpty. Operand 9151 states and 28487 transitions. [2019-12-07 13:14:24,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 13:14:24,552 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:24,552 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:14:24,552 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:24,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:24,552 INFO L82 PathProgramCache]: Analyzing trace with hash -207244209, now seen corresponding path program 4 times [2019-12-07 13:14:24,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:14:24,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534630170] [2019-12-07 13:14:24,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:14:25,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:14:25,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534630170] [2019-12-07 13:14:25,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:14:25,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 13:14:25,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320632718] [2019-12-07 13:14:25,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 13:14:25,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:14:25,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 13:14:25,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:14:25,119 INFO L87 Difference]: Start difference. First operand 9151 states and 28487 transitions. Second operand 15 states. [2019-12-07 13:14:26,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:14:26,490 INFO L93 Difference]: Finished difference Result 15454 states and 46483 transitions. [2019-12-07 13:14:26,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 13:14:26,490 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-07 13:14:26,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:14:26,504 INFO L225 Difference]: With dead ends: 15454 [2019-12-07 13:14:26,504 INFO L226 Difference]: Without dead ends: 12320 [2019-12-07 13:14:26,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=237, Invalid=1323, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 13:14:26,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12320 states. [2019-12-07 13:14:26,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12320 to 10053. [2019-12-07 13:14:26,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10053 states. [2019-12-07 13:14:26,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10053 states to 10053 states and 31128 transitions. [2019-12-07 13:14:26,657 INFO L78 Accepts]: Start accepts. Automaton has 10053 states and 31128 transitions. Word has length 56 [2019-12-07 13:14:26,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:14:26,657 INFO L462 AbstractCegarLoop]: Abstraction has 10053 states and 31128 transitions. [2019-12-07 13:14:26,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 13:14:26,657 INFO L276 IsEmpty]: Start isEmpty. Operand 10053 states and 31128 transitions. [2019-12-07 13:14:26,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 13:14:26,666 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:14:26,666 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:14:26,666 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:14:26,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:14:26,667 INFO L82 PathProgramCache]: Analyzing trace with hash -374963123, now seen corresponding path program 5 times [2019-12-07 13:14:26,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:14:26,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74436935] [2019-12-07 13:14:26,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:14:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:14:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:14:26,734 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:14:26,734 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:14:26,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_310 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff0_thd1~0_312 0) (= v_~x$flush_delayed~0_79 0) (= v_~main$tmp_guard0~0_19 0) (= v_~x$r_buff1_thd0~0_282 0) (= 0 v_~__unbuffered_p0_EAX~0_82) (= |v_#NULL.offset_3| 0) (= 0 v_~x$w_buff1_used~0_528) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1840~0.base_39| 4)) (= 0 v_~x$r_buff0_thd2~0_267) (= 0 v_~x$r_buff1_thd2~0_231) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1840~0.base_39|)) (= v_~main$tmp_guard1~0_61 0) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t1840~0.base_39| 1)) (= 0 |v_ULTIMATE.start_main_~#t1840~0.offset_25|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1840~0.base_39|) (= v_~y~0_262 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~weak$$choice2~0_142 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p2_EAX~0_70) (= 0 v_~x$w_buff1~0_255) (= v_~x$mem_tmp~0_46 0) (= v_~__unbuffered_cnt~0_141 0) (= 0 |v_#NULL.base_3|) (= 0 v_~x~0_186) (= 0 v_~x$r_buff1_thd3~0_228) (= 0 v_~weak$$choice0~0_40) (= 0 v_~x$w_buff0~0_335) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1840~0.base_39| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1840~0.base_39|) |v_ULTIMATE.start_main_~#t1840~0.offset_25| 0))) (= v_~__unbuffered_p0_EBX~0_68 0) (= 0 v_~x$r_buff0_thd3~0_132) (= v_~x$r_buff0_thd0~0_156 0) (= 0 v_~x$w_buff0_used~0_798))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_335, ~x$flush_delayed~0=v_~x$flush_delayed~0_79, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_310, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_132, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, #length=|v_#length_23|, ULTIMATE.start_main_~#t1841~0.base=|v_ULTIMATE.start_main_~#t1841~0.base_37|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_70, ULTIMATE.start_main_~#t1840~0.offset=|v_ULTIMATE.start_main_~#t1840~0.offset_25|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_255, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_528, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_231, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ULTIMATE.start_main_~#t1840~0.base=|v_ULTIMATE.start_main_~#t1840~0.base_39|, ~x~0=v_~x~0_186, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_312, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_123|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_228, ULTIMATE.start_main_~#t1841~0.offset=|v_ULTIMATE.start_main_~#t1841~0.offset_25|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61, ~x$mem_tmp~0=v_~x$mem_tmp~0_46, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_230|, ~y~0=v_~y~0_262, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_282, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_267, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_798, ULTIMATE.start_main_~#t1842~0.base=|v_ULTIMATE.start_main_~#t1842~0.base_29|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ULTIMATE.start_main_~#t1842~0.offset=|v_ULTIMATE.start_main_~#t1842~0.offset_16|, ~weak$$choice2~0=v_~weak$$choice2~0_142, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ULTIMATE.start_main_~#t1841~0.offset, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ULTIMATE.start_main_~#t1841~0.base, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1840~0.offset, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1842~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1840~0.base, ULTIMATE.start_main_~#t1842~0.offset, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 13:14:26,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L816-1-->L818: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1841~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t1841~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1841~0.base_10|)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1841~0.base_10|)) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1841~0.base_10| 1) |v_#valid_37|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1841~0.base_10| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1841~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1841~0.base_10|) |v_ULTIMATE.start_main_~#t1841~0.offset_10| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t1841~0.base=|v_ULTIMATE.start_main_~#t1841~0.base_10|, ULTIMATE.start_main_~#t1841~0.offset=|v_ULTIMATE.start_main_~#t1841~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1841~0.base, ULTIMATE.start_main_~#t1841~0.offset, #length] because there is no mapped edge [2019-12-07 13:14:26,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-1-->L820: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1842~0.base_10| 0)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1842~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1842~0.base_10|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1842~0.base_10| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1842~0.base_10| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1842~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1842~0.base_10|) |v_ULTIMATE.start_main_~#t1842~0.offset_9| 2)) |v_#memory_int_11|) (= 0 |v_ULTIMATE.start_main_~#t1842~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1842~0.base=|v_ULTIMATE.start_main_~#t1842~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t1842~0.offset=|v_ULTIMATE.start_main_~#t1842~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1842~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1842~0.offset] because there is no mapped edge [2019-12-07 13:14:26,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L5-->L773: Formula: (and (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_39) (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_7) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4)) (= v_~x$r_buff1_thd3~0_10 v_~x$r_buff0_thd3~0_14) (= 1 v_~x$r_buff0_thd2~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_10, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~y~0=v_~y~0_7, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 13:14:26,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L793-2-->L793-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In99865692 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In99865692 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out99865692| ~x$w_buff1~0_In99865692) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In99865692 |P2Thread1of1ForFork1_#t~ite32_Out99865692|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In99865692, ~x$w_buff1_used~0=~x$w_buff1_used~0_In99865692, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In99865692, ~x~0=~x~0_In99865692} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out99865692|, ~x$w_buff1~0=~x$w_buff1~0_In99865692, ~x$w_buff1_used~0=~x$w_buff1_used~0_In99865692, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In99865692, ~x~0=~x~0_In99865692} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 13:14:26,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-513368619 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-513368619 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-513368619| ~x$w_buff0_used~0_In-513368619)) (and (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-513368619| 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-513368619, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-513368619} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-513368619, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-513368619|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-513368619} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 13:14:26,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L793-4-->L794: Formula: (= v_~x~0_69 |v_P2Thread1of1ForFork1_#t~ite32_20|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_20|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_19|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_37|, ~x~0=v_~x~0_69} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 13:14:26,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In688885951 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In688885951 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In688885951 |P2Thread1of1ForFork1_#t~ite34_Out688885951|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out688885951|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In688885951, ~x$w_buff0_used~0=~x$w_buff0_used~0_In688885951} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out688885951|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In688885951, ~x$w_buff0_used~0=~x$w_buff0_used~0_In688885951} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 13:14:26,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L775-->L775-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In604246967 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In604246967 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In604246967 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In604246967 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out604246967| 0)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out604246967| ~x$w_buff1_used~0_In604246967) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In604246967, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In604246967, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In604246967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In604246967} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In604246967, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In604246967, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In604246967, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out604246967|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In604246967} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 13:14:26,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L776-->L777: Formula: (let ((.cse0 (= ~x$r_buff0_thd2~0_Out-2071928773 ~x$r_buff0_thd2~0_In-2071928773)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-2071928773 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-2071928773 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse2) (= ~x$r_buff0_thd2~0_Out-2071928773 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2071928773, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2071928773} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-2071928773|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-2071928773, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2071928773} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 13:14:26,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1294754579 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1294754579 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1294754579 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1294754579 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-1294754579 |P1Thread1of1ForFork0_#t~ite31_Out-1294754579|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1294754579|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1294754579, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1294754579, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1294754579, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1294754579} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1294754579|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1294754579, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1294754579, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1294754579, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1294754579} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 13:14:26,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L777-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_68 |v_P1Thread1of1ForFork0_#t~ite31_44|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_43|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 13:14:26,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L795-->L795-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd3~0_In1815968230 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1815968230 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In1815968230 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1815968230 256) 0))) (or (and (= ~x$w_buff1_used~0_In1815968230 |P2Thread1of1ForFork1_#t~ite35_Out1815968230|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out1815968230|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1815968230, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1815968230, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1815968230, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1815968230} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1815968230|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1815968230, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1815968230, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1815968230, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1815968230} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 13:14:26,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In730490111 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In730490111 256)))) (or (and (= ~x$r_buff0_thd3~0_In730490111 |P2Thread1of1ForFork1_#t~ite36_Out730490111|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork1_#t~ite36_Out730490111|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In730490111, ~x$w_buff0_used~0=~x$w_buff0_used~0_In730490111} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out730490111|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In730490111, ~x$w_buff0_used~0=~x$w_buff0_used~0_In730490111} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 13:14:26,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L739-->L739-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In37467814 256)))) (or (and (= ~x$w_buff1~0_In37467814 |P0Thread1of1ForFork2_#t~ite11_Out37467814|) (= |P0Thread1of1ForFork2_#t~ite12_Out37467814| |P0Thread1of1ForFork2_#t~ite11_Out37467814|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In37467814 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In37467814 256)) (and (= (mod ~x$w_buff1_used~0_In37467814 256) 0) .cse0) (and (= (mod ~x$r_buff1_thd1~0_In37467814 256) 0) .cse0))) .cse1) (and (not .cse1) (= ~x$w_buff1~0_In37467814 |P0Thread1of1ForFork2_#t~ite12_Out37467814|) (= |P0Thread1of1ForFork2_#t~ite11_In37467814| |P0Thread1of1ForFork2_#t~ite11_Out37467814|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In37467814, ~x$w_buff1~0=~x$w_buff1~0_In37467814, ~x$w_buff1_used~0=~x$w_buff1_used~0_In37467814, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In37467814, ~weak$$choice2~0=~weak$$choice2~0_In37467814, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In37467814|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In37467814} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In37467814, ~x$w_buff1~0=~x$w_buff1~0_In37467814, ~x$w_buff1_used~0=~x$w_buff1_used~0_In37467814, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In37467814, ~weak$$choice2~0=~weak$$choice2~0_In37467814, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out37467814|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out37467814|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In37467814} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 13:14:26,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-751804769 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite15_Out-751804769| ~x$w_buff0_used~0_In-751804769) (= |P0Thread1of1ForFork2_#t~ite14_In-751804769| |P0Thread1of1ForFork2_#t~ite14_Out-751804769|)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-751804769 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-751804769 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-751804769 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-751804769 256))))) (= |P0Thread1of1ForFork2_#t~ite14_Out-751804769| |P0Thread1of1ForFork2_#t~ite15_Out-751804769|) (= |P0Thread1of1ForFork2_#t~ite14_Out-751804769| ~x$w_buff0_used~0_In-751804769) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-751804769, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-751804769, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-751804769, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-751804769|, ~weak$$choice2~0=~weak$$choice2~0_In-751804769, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-751804769} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-751804769, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-751804769, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-751804769|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-751804769, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-751804769|, ~weak$$choice2~0=~weak$$choice2~0_In-751804769, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-751804769} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 13:14:26,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_98 v_~x$r_buff0_thd1~0_97) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_97, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_11|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_6|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 13:14:26,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1669602931 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite24_Out-1669602931| ~x$r_buff1_thd1~0_In-1669602931) (= |P0Thread1of1ForFork2_#t~ite23_In-1669602931| |P0Thread1of1ForFork2_#t~ite23_Out-1669602931|)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1669602931 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-1669602931 256)) .cse1) (and (= (mod ~x$r_buff1_thd1~0_In-1669602931 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In-1669602931 256) 0))) (= |P0Thread1of1ForFork2_#t~ite23_Out-1669602931| ~x$r_buff1_thd1~0_In-1669602931) .cse0 (= |P0Thread1of1ForFork2_#t~ite24_Out-1669602931| |P0Thread1of1ForFork2_#t~ite23_Out-1669602931|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1669602931, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1669602931, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1669602931, ~weak$$choice2~0=~weak$$choice2~0_In-1669602931, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-1669602931|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1669602931} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1669602931, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1669602931, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1669602931, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-1669602931|, ~weak$$choice2~0=~weak$$choice2~0_In-1669602931, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-1669602931|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1669602931} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 13:14:26,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_4 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_9|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 13:14:26,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1636480310 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1636480310 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd3~0_In1636480310 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1636480310 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out1636480310| ~x$r_buff1_thd3~0_In1636480310) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out1636480310| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1636480310, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1636480310, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1636480310, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1636480310} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1636480310|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1636480310, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1636480310, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1636480310, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1636480310} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:14:26,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L797-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_cnt~0_64 (+ v_~__unbuffered_cnt~0_65 1)) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_30|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 13:14:26,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L820-1-->L826: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_35) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 13:14:26,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L826-2-->L826-5: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-734814481 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-734814481 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite42_Out-734814481| |ULTIMATE.start_main_#t~ite41_Out-734814481|))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite41_Out-734814481| ~x~0_In-734814481)) (and (not .cse0) (not .cse1) .cse2 (= ~x$w_buff1~0_In-734814481 |ULTIMATE.start_main_#t~ite41_Out-734814481|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-734814481, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-734814481, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-734814481, ~x~0=~x~0_In-734814481} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-734814481|, ~x$w_buff1~0=~x$w_buff1~0_In-734814481, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-734814481, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-734814481, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-734814481|, ~x~0=~x~0_In-734814481} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 13:14:26,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-681213934 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-681213934 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-681213934| ~x$w_buff0_used~0_In-681213934) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-681213934| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-681213934, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-681213934} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-681213934, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-681213934|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-681213934} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 13:14:26,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-502074584 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-502074584 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-502074584 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-502074584 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out-502074584| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite44_Out-502074584| ~x$w_buff1_used~0_In-502074584)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-502074584, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-502074584, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-502074584, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-502074584} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-502074584, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-502074584, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-502074584, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-502074584|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-502074584} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 13:14:26,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-613038746 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-613038746 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-613038746|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-613038746| ~x$r_buff0_thd0~0_In-613038746)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-613038746, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-613038746} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-613038746, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-613038746|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-613038746} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 13:14:26,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1065375475 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1065375475 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1065375475 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1065375475 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out1065375475|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In1065375475 |ULTIMATE.start_main_#t~ite46_Out1065375475|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1065375475, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1065375475, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1065375475, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1065375475} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1065375475, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1065375475|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1065375475, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1065375475, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1065375475} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 13:14:26,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_31) (= v_~__unbuffered_p0_EBX~0_30 0) (= v_~y~0_138 2) (= 2 v_~__unbuffered_p0_EAX~0_46))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_24) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_24 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite46_51|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_51|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_50|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:14:26,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:14:26 BasicIcfg [2019-12-07 13:14:26,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:14:26,796 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:14:26,796 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:14:26,796 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:14:26,796 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:13:55" (3/4) ... [2019-12-07 13:14:26,798 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:14:26,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_310 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff0_thd1~0_312 0) (= v_~x$flush_delayed~0_79 0) (= v_~main$tmp_guard0~0_19 0) (= v_~x$r_buff1_thd0~0_282 0) (= 0 v_~__unbuffered_p0_EAX~0_82) (= |v_#NULL.offset_3| 0) (= 0 v_~x$w_buff1_used~0_528) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1840~0.base_39| 4)) (= 0 v_~x$r_buff0_thd2~0_267) (= 0 v_~x$r_buff1_thd2~0_231) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1840~0.base_39|)) (= v_~main$tmp_guard1~0_61 0) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t1840~0.base_39| 1)) (= 0 |v_ULTIMATE.start_main_~#t1840~0.offset_25|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1840~0.base_39|) (= v_~y~0_262 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~weak$$choice2~0_142 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p2_EAX~0_70) (= 0 v_~x$w_buff1~0_255) (= v_~x$mem_tmp~0_46 0) (= v_~__unbuffered_cnt~0_141 0) (= 0 |v_#NULL.base_3|) (= 0 v_~x~0_186) (= 0 v_~x$r_buff1_thd3~0_228) (= 0 v_~weak$$choice0~0_40) (= 0 v_~x$w_buff0~0_335) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1840~0.base_39| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1840~0.base_39|) |v_ULTIMATE.start_main_~#t1840~0.offset_25| 0))) (= v_~__unbuffered_p0_EBX~0_68 0) (= 0 v_~x$r_buff0_thd3~0_132) (= v_~x$r_buff0_thd0~0_156 0) (= 0 v_~x$w_buff0_used~0_798))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_335, ~x$flush_delayed~0=v_~x$flush_delayed~0_79, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_310, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_132, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, #length=|v_#length_23|, ULTIMATE.start_main_~#t1841~0.base=|v_ULTIMATE.start_main_~#t1841~0.base_37|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_70, ULTIMATE.start_main_~#t1840~0.offset=|v_ULTIMATE.start_main_~#t1840~0.offset_25|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_255, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_528, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_231, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ULTIMATE.start_main_~#t1840~0.base=|v_ULTIMATE.start_main_~#t1840~0.base_39|, ~x~0=v_~x~0_186, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_312, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_123|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_228, ULTIMATE.start_main_~#t1841~0.offset=|v_ULTIMATE.start_main_~#t1841~0.offset_25|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61, ~x$mem_tmp~0=v_~x$mem_tmp~0_46, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_230|, ~y~0=v_~y~0_262, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_282, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_267, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_798, ULTIMATE.start_main_~#t1842~0.base=|v_ULTIMATE.start_main_~#t1842~0.base_29|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ULTIMATE.start_main_~#t1842~0.offset=|v_ULTIMATE.start_main_~#t1842~0.offset_16|, ~weak$$choice2~0=v_~weak$$choice2~0_142, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ULTIMATE.start_main_~#t1841~0.offset, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ULTIMATE.start_main_~#t1841~0.base, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1840~0.offset, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1842~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1840~0.base, ULTIMATE.start_main_~#t1842~0.offset, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 13:14:26,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L816-1-->L818: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1841~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t1841~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1841~0.base_10|)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1841~0.base_10|)) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1841~0.base_10| 1) |v_#valid_37|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1841~0.base_10| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1841~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1841~0.base_10|) |v_ULTIMATE.start_main_~#t1841~0.offset_10| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, ULTIMATE.start_main_~#t1841~0.base=|v_ULTIMATE.start_main_~#t1841~0.base_10|, ULTIMATE.start_main_~#t1841~0.offset=|v_ULTIMATE.start_main_~#t1841~0.offset_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1841~0.base, ULTIMATE.start_main_~#t1841~0.offset, #length] because there is no mapped edge [2019-12-07 13:14:26,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-1-->L820: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1842~0.base_10| 0)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1842~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1842~0.base_10|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1842~0.base_10| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1842~0.base_10| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1842~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1842~0.base_10|) |v_ULTIMATE.start_main_~#t1842~0.offset_9| 2)) |v_#memory_int_11|) (= 0 |v_ULTIMATE.start_main_~#t1842~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1842~0.base=|v_ULTIMATE.start_main_~#t1842~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t1842~0.offset=|v_ULTIMATE.start_main_~#t1842~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1842~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1842~0.offset] because there is no mapped edge [2019-12-07 13:14:26,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L5-->L773: Formula: (and (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_39) (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_7) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4)) (= v_~x$r_buff1_thd3~0_10 v_~x$r_buff0_thd3~0_14) (= 1 v_~x$r_buff0_thd2~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_10, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~y~0=v_~y~0_7, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 13:14:26,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L793-2-->L793-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In99865692 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In99865692 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out99865692| ~x$w_buff1~0_In99865692) (not .cse1)) (and (or .cse0 .cse1) (= ~x~0_In99865692 |P2Thread1of1ForFork1_#t~ite32_Out99865692|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In99865692, ~x$w_buff1_used~0=~x$w_buff1_used~0_In99865692, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In99865692, ~x~0=~x~0_In99865692} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out99865692|, ~x$w_buff1~0=~x$w_buff1~0_In99865692, ~x$w_buff1_used~0=~x$w_buff1_used~0_In99865692, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In99865692, ~x~0=~x~0_In99865692} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 13:14:26,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-513368619 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-513368619 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-513368619| ~x$w_buff0_used~0_In-513368619)) (and (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-513368619| 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-513368619, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-513368619} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-513368619, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-513368619|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-513368619} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 13:14:26,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L793-4-->L794: Formula: (= v_~x~0_69 |v_P2Thread1of1ForFork1_#t~ite32_20|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_20|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_19|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_37|, ~x~0=v_~x~0_69} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 13:14:26,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In688885951 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In688885951 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In688885951 |P2Thread1of1ForFork1_#t~ite34_Out688885951|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out688885951|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In688885951, ~x$w_buff0_used~0=~x$w_buff0_used~0_In688885951} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out688885951|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In688885951, ~x$w_buff0_used~0=~x$w_buff0_used~0_In688885951} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 13:14:26,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L775-->L775-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In604246967 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In604246967 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In604246967 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In604246967 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out604246967| 0)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out604246967| ~x$w_buff1_used~0_In604246967) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In604246967, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In604246967, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In604246967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In604246967} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In604246967, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In604246967, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In604246967, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out604246967|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In604246967} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 13:14:26,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L776-->L777: Formula: (let ((.cse0 (= ~x$r_buff0_thd2~0_Out-2071928773 ~x$r_buff0_thd2~0_In-2071928773)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-2071928773 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-2071928773 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse2) (= ~x$r_buff0_thd2~0_Out-2071928773 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2071928773, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2071928773} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-2071928773|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-2071928773, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2071928773} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 13:14:26,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-1294754579 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1294754579 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-1294754579 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1294754579 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-1294754579 |P1Thread1of1ForFork0_#t~ite31_Out-1294754579|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1294754579|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1294754579, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1294754579, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1294754579, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1294754579} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1294754579|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1294754579, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1294754579, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1294754579, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1294754579} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 13:14:26,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L777-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_68 |v_P1Thread1of1ForFork0_#t~ite31_44|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_43|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 13:14:26,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L795-->L795-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd3~0_In1815968230 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1815968230 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In1815968230 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1815968230 256) 0))) (or (and (= ~x$w_buff1_used~0_In1815968230 |P2Thread1of1ForFork1_#t~ite35_Out1815968230|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out1815968230|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1815968230, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1815968230, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1815968230, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1815968230} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1815968230|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1815968230, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1815968230, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1815968230, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1815968230} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 13:14:26,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In730490111 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In730490111 256)))) (or (and (= ~x$r_buff0_thd3~0_In730490111 |P2Thread1of1ForFork1_#t~ite36_Out730490111|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork1_#t~ite36_Out730490111|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In730490111, ~x$w_buff0_used~0=~x$w_buff0_used~0_In730490111} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out730490111|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In730490111, ~x$w_buff0_used~0=~x$w_buff0_used~0_In730490111} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 13:14:26,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L739-->L739-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In37467814 256)))) (or (and (= ~x$w_buff1~0_In37467814 |P0Thread1of1ForFork2_#t~ite11_Out37467814|) (= |P0Thread1of1ForFork2_#t~ite12_Out37467814| |P0Thread1of1ForFork2_#t~ite11_Out37467814|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In37467814 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In37467814 256)) (and (= (mod ~x$w_buff1_used~0_In37467814 256) 0) .cse0) (and (= (mod ~x$r_buff1_thd1~0_In37467814 256) 0) .cse0))) .cse1) (and (not .cse1) (= ~x$w_buff1~0_In37467814 |P0Thread1of1ForFork2_#t~ite12_Out37467814|) (= |P0Thread1of1ForFork2_#t~ite11_In37467814| |P0Thread1of1ForFork2_#t~ite11_Out37467814|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In37467814, ~x$w_buff1~0=~x$w_buff1~0_In37467814, ~x$w_buff1_used~0=~x$w_buff1_used~0_In37467814, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In37467814, ~weak$$choice2~0=~weak$$choice2~0_In37467814, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In37467814|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In37467814} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In37467814, ~x$w_buff1~0=~x$w_buff1~0_In37467814, ~x$w_buff1_used~0=~x$w_buff1_used~0_In37467814, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In37467814, ~weak$$choice2~0=~weak$$choice2~0_In37467814, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out37467814|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out37467814|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In37467814} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 13:14:26,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-751804769 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite15_Out-751804769| ~x$w_buff0_used~0_In-751804769) (= |P0Thread1of1ForFork2_#t~ite14_In-751804769| |P0Thread1of1ForFork2_#t~ite14_Out-751804769|)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-751804769 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-751804769 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-751804769 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-751804769 256))))) (= |P0Thread1of1ForFork2_#t~ite14_Out-751804769| |P0Thread1of1ForFork2_#t~ite15_Out-751804769|) (= |P0Thread1of1ForFork2_#t~ite14_Out-751804769| ~x$w_buff0_used~0_In-751804769) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-751804769, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-751804769, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-751804769, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-751804769|, ~weak$$choice2~0=~weak$$choice2~0_In-751804769, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-751804769} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-751804769, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-751804769, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-751804769|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-751804769, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-751804769|, ~weak$$choice2~0=~weak$$choice2~0_In-751804769, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-751804769} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 13:14:26,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_98 v_~x$r_buff0_thd1~0_97) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_97, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_11|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_6|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 13:14:26,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1669602931 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite24_Out-1669602931| ~x$r_buff1_thd1~0_In-1669602931) (= |P0Thread1of1ForFork2_#t~ite23_In-1669602931| |P0Thread1of1ForFork2_#t~ite23_Out-1669602931|)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1669602931 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-1669602931 256)) .cse1) (and (= (mod ~x$r_buff1_thd1~0_In-1669602931 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In-1669602931 256) 0))) (= |P0Thread1of1ForFork2_#t~ite23_Out-1669602931| ~x$r_buff1_thd1~0_In-1669602931) .cse0 (= |P0Thread1of1ForFork2_#t~ite24_Out-1669602931| |P0Thread1of1ForFork2_#t~ite23_Out-1669602931|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1669602931, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1669602931, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1669602931, ~weak$$choice2~0=~weak$$choice2~0_In-1669602931, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-1669602931|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1669602931} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1669602931, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1669602931, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1669602931, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-1669602931|, ~weak$$choice2~0=~weak$$choice2~0_In-1669602931, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-1669602931|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1669602931} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 13:14:26,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_4 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_9|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 13:14:26,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1636480310 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1636480310 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd3~0_In1636480310 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1636480310 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out1636480310| ~x$r_buff1_thd3~0_In1636480310) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out1636480310| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1636480310, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1636480310, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1636480310, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1636480310} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1636480310|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1636480310, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1636480310, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1636480310, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1636480310} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:14:26,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L797-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_cnt~0_64 (+ v_~__unbuffered_cnt~0_65 1)) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_30|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 13:14:26,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L820-1-->L826: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_35) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 13:14:26,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L826-2-->L826-5: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-734814481 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-734814481 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite42_Out-734814481| |ULTIMATE.start_main_#t~ite41_Out-734814481|))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite41_Out-734814481| ~x~0_In-734814481)) (and (not .cse0) (not .cse1) .cse2 (= ~x$w_buff1~0_In-734814481 |ULTIMATE.start_main_#t~ite41_Out-734814481|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-734814481, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-734814481, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-734814481, ~x~0=~x~0_In-734814481} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-734814481|, ~x$w_buff1~0=~x$w_buff1~0_In-734814481, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-734814481, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-734814481, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-734814481|, ~x~0=~x~0_In-734814481} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 13:14:26,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-681213934 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-681213934 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-681213934| ~x$w_buff0_used~0_In-681213934) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-681213934| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-681213934, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-681213934} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-681213934, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-681213934|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-681213934} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 13:14:26,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-502074584 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-502074584 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-502074584 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-502074584 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out-502074584| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite44_Out-502074584| ~x$w_buff1_used~0_In-502074584)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-502074584, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-502074584, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-502074584, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-502074584} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-502074584, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-502074584, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-502074584, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-502074584|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-502074584} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 13:14:26,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-613038746 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-613038746 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-613038746|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-613038746| ~x$r_buff0_thd0~0_In-613038746)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-613038746, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-613038746} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-613038746, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-613038746|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-613038746} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 13:14:26,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1065375475 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1065375475 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1065375475 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1065375475 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out1065375475|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In1065375475 |ULTIMATE.start_main_#t~ite46_Out1065375475|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1065375475, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1065375475, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1065375475, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1065375475} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1065375475, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1065375475|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1065375475, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1065375475, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1065375475} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 13:14:26,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_31) (= v_~__unbuffered_p0_EBX~0_30 0) (= v_~y~0_138 2) (= 2 v_~__unbuffered_p0_EAX~0_46))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_24) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_24 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite46_51|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_51|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_50|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:14:26,862 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b0c2c0f7-5b7c-46ae-aef1-50e73232336d/bin/uautomizer/witness.graphml [2019-12-07 13:14:26,862 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:14:26,863 INFO L168 Benchmark]: Toolchain (without parser) took 32174.98 ms. Allocated memory was 1.0 GB in the beginning and 3.6 GB in the end (delta: 2.5 GB). Free memory was 940.9 MB in the beginning and 1.8 GB in the end (delta: -854.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-12-07 13:14:26,863 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:14:26,864 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.1 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -120.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:14:26,864 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:14:26,864 INFO L168 Benchmark]: Boogie Preprocessor took 26.85 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:14:26,864 INFO L168 Benchmark]: RCFGBuilder took 389.58 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: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:14:26,865 INFO L168 Benchmark]: TraceAbstraction took 31279.56 ms. Allocated memory was 1.1 GB in the beginning and 3.6 GB in the end (delta: 2.4 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -839.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-12-07 13:14:26,865 INFO L168 Benchmark]: Witness Printer took 66.41 ms. Allocated memory is still 3.6 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:14:26,866 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 371.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.1 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -120.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.85 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 389.58 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: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31279.56 ms. Allocated memory was 1.1 GB in the beginning and 3.6 GB in the end (delta: 2.4 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -839.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 66.41 ms. Allocated memory is still 3.6 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 163 ProgramPointsBefore, 82 ProgramPointsAfterwards, 194 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 26 ChoiceCompositions, 6655 VarBasedMoverChecksPositive, 264 VarBasedMoverChecksNegative, 98 SemBasedMoverChecksPositive, 236 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 64859 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t1840, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] FCALL, FORK 0 pthread_create(&t1841, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L820] FCALL, FORK 0 pthread_create(&t1842, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 3 __unbuffered_p2_EAX = y [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L793] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 __unbuffered_p0_EAX = y [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L737] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L738] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L740] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 31.1s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2394 SDtfs, 3596 SDslu, 6676 SDs, 0 SdLazy, 4796 SolverSat, 237 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80448occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 72011 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 622 NumberOfCodeBlocks, 622 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 204699 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...