./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe024_rmo.oepc.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_10f7f24c-bbf8-4dd4-964b-34359c7321d9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_10f7f24c-bbf8-4dd4-964b-34359c7321d9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_10f7f24c-bbf8-4dd4-964b-34359c7321d9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_10f7f24c-bbf8-4dd4-964b-34359c7321d9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe024_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_10f7f24c-bbf8-4dd4-964b-34359c7321d9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_10f7f24c-bbf8-4dd4-964b-34359c7321d9/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 a90235dcc8a5b69a4a45037bda62e61eb2c94ba0 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:55:16,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:55:16,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:55:16,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:55:16,690 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:55:16,691 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:55:16,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:55:16,693 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:55:16,695 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:55:16,695 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:55:16,696 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:55:16,697 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:55:16,697 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:55:16,698 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:55:16,698 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:55:16,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:55:16,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:55:16,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:55:16,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:55:16,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:55:16,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:55:16,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:55:16,706 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:55:16,706 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:55:16,708 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:55:16,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:55:16,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:55:16,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:55:16,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:55:16,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:55:16,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:55:16,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:55:16,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:55:16,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:55:16,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:55:16,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:55:16,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:55:16,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:55:16,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:55:16,713 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:55:16,714 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:55:16,714 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_10f7f24c-bbf8-4dd4-964b-34359c7321d9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:55:16,724 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:55:16,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:55:16,725 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:55:16,725 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:55:16,725 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:55:16,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:55:16,726 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:55:16,726 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:55:16,726 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:55:16,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:55:16,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:55:16,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:55:16,726 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:55:16,727 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:55:16,727 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:55:16,727 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:55:16,727 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:55:16,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:55:16,727 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:55:16,727 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:55:16,727 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:55:16,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:55:16,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:55:16,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:55:16,728 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:55:16,728 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:55:16,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:55:16,728 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:55:16,728 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:55:16,728 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_10f7f24c-bbf8-4dd4-964b-34359c7321d9/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 -> a90235dcc8a5b69a4a45037bda62e61eb2c94ba0 [2019-12-07 11:55:16,830 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:55:16,839 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:55:16,842 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:55:16,843 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:55:16,844 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:55:16,844 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_10f7f24c-bbf8-4dd4-964b-34359c7321d9/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe024_rmo.oepc.i [2019-12-07 11:55:16,891 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_10f7f24c-bbf8-4dd4-964b-34359c7321d9/bin/uautomizer/data/d75876a50/37ee301dfef64634b7ab5236d7d595db/FLAG96a648fc8 [2019-12-07 11:55:17,364 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:55:17,364 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_10f7f24c-bbf8-4dd4-964b-34359c7321d9/sv-benchmarks/c/pthread-wmm/safe024_rmo.oepc.i [2019-12-07 11:55:17,375 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_10f7f24c-bbf8-4dd4-964b-34359c7321d9/bin/uautomizer/data/d75876a50/37ee301dfef64634b7ab5236d7d595db/FLAG96a648fc8 [2019-12-07 11:55:17,384 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_10f7f24c-bbf8-4dd4-964b-34359c7321d9/bin/uautomizer/data/d75876a50/37ee301dfef64634b7ab5236d7d595db [2019-12-07 11:55:17,386 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:55:17,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:55:17,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:55:17,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:55:17,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:55:17,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:55:17" (1/1) ... [2019-12-07 11:55:17,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@650fc3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:17, skipping insertion in model container [2019-12-07 11:55:17,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:55:17" (1/1) ... [2019-12-07 11:55:17,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:55:17,425 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:55:17,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:55:17,684 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:55:17,726 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:55:17,771 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:55:17,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:17 WrapperNode [2019-12-07 11:55:17,772 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:55:17,772 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:55:17,772 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:55:17,773 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:55:17,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:17" (1/1) ... [2019-12-07 11:55:17,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:17" (1/1) ... [2019-12-07 11:55:17,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:55:17,810 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:55:17,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:55:17,810 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:55:17,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:17" (1/1) ... [2019-12-07 11:55:17,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:17" (1/1) ... [2019-12-07 11:55:17,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:17" (1/1) ... [2019-12-07 11:55:17,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:17" (1/1) ... [2019-12-07 11:55:17,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:17" (1/1) ... [2019-12-07 11:55:17,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:17" (1/1) ... [2019-12-07 11:55:17,832 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:17" (1/1) ... [2019-12-07 11:55:17,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:55:17,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:55:17,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:55:17,836 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:55:17,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_10f7f24c-bbf8-4dd4-964b-34359c7321d9/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:55:17,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:55:17,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:55:17,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:55:17,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:55:17,878 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:55:17,878 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:55:17,878 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:55:17,878 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:55:17,878 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 11:55:17,878 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 11:55:17,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:55:17,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:55:17,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:55:17,879 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 11:55:18,225 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:55:18,225 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:55:18,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:55:18 BoogieIcfgContainer [2019-12-07 11:55:18,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:55:18,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:55:18,226 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:55:18,229 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:55:18,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:55:17" (1/3) ... [2019-12-07 11:55:18,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b50e12d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:55:18, skipping insertion in model container [2019-12-07 11:55:18,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:55:17" (2/3) ... [2019-12-07 11:55:18,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b50e12d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:55:18, skipping insertion in model container [2019-12-07 11:55:18,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:55:18" (3/3) ... [2019-12-07 11:55:18,232 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_rmo.oepc.i [2019-12-07 11:55:18,238 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:55:18,238 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:55:18,243 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:55:18,243 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:55:18,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,267 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,267 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,278 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,278 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,278 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,279 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,279 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,282 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,282 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:55:18,299 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 11:55:18,316 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:55:18,316 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:55:18,316 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:55:18,316 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:55:18,316 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:55:18,317 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:55:18,317 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:55:18,317 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:55:18,328 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-07 11:55:18,329 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-07 11:55:18,379 INFO L134 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-07 11:55:18,380 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:55:18,389 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 726 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 11:55:18,405 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-07 11:55:18,430 INFO L134 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-07 11:55:18,431 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:55:18,436 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 726 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 11:55:18,450 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 11:55:18,450 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:55:21,553 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-07 11:55:21,639 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66430 [2019-12-07 11:55:21,639 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-07 11:55:21,641 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 89 transitions [2019-12-07 11:55:31,191 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-07 11:55:31,193 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-07 11:55:31,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 11:55:31,197 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:55:31,197 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 11:55:31,198 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 11:55:31,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:31,201 INFO L82 PathProgramCache]: Analyzing trace with hash 797474656, now seen corresponding path program 1 times [2019-12-07 11:55:31,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:31,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124112652] [2019-12-07 11:55:31,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:31,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:31,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124112652] [2019-12-07 11:55:31,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:55:31,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:55:31,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297525801] [2019-12-07 11:55:31,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:55:31,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:31,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:55:31,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:55:31,369 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-07 11:55:32,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:32,076 INFO L93 Difference]: Finished difference Result 87834 states and 374974 transitions. [2019-12-07 11:55:32,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:55:32,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 11:55:32,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:55:32,449 INFO L225 Difference]: With dead ends: 87834 [2019-12-07 11:55:32,449 INFO L226 Difference]: Without dead ends: 82738 [2019-12-07 11:55:32,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:55:35,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82738 states. [2019-12-07 11:55:36,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82738 to 82738. [2019-12-07 11:55:36,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82738 states. [2019-12-07 11:55:37,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82738 states to 82738 states and 352742 transitions. [2019-12-07 11:55:37,189 INFO L78 Accepts]: Start accepts. Automaton has 82738 states and 352742 transitions. Word has length 5 [2019-12-07 11:55:37,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:55:37,189 INFO L462 AbstractCegarLoop]: Abstraction has 82738 states and 352742 transitions. [2019-12-07 11:55:37,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:55:37,189 INFO L276 IsEmpty]: Start isEmpty. Operand 82738 states and 352742 transitions. [2019-12-07 11:55:37,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:55:37,198 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:55:37,198 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:55:37,199 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 11:55:37,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:37,199 INFO L82 PathProgramCache]: Analyzing trace with hash 334215788, now seen corresponding path program 1 times [2019-12-07 11:55:37,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:37,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998436807] [2019-12-07 11:55:37,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:37,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:37,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998436807] [2019-12-07 11:55:37,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:55:37,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:55:37,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311649430] [2019-12-07 11:55:37,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:55:37,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:37,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:55:37,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:55:37,277 INFO L87 Difference]: Start difference. First operand 82738 states and 352742 transitions. Second operand 4 states. [2019-12-07 11:55:39,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:39,180 INFO L93 Difference]: Finished difference Result 127286 states and 521114 transitions. [2019-12-07 11:55:39,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:55:39,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 11:55:39,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:55:39,515 INFO L225 Difference]: With dead ends: 127286 [2019-12-07 11:55:39,515 INFO L226 Difference]: Without dead ends: 127202 [2019-12-07 11:55:39,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:55:43,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127202 states. [2019-12-07 11:55:45,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127202 to 115962. [2019-12-07 11:55:45,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115962 states. [2019-12-07 11:55:45,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115962 states to 115962 states and 480151 transitions. [2019-12-07 11:55:45,319 INFO L78 Accepts]: Start accepts. Automaton has 115962 states and 480151 transitions. Word has length 13 [2019-12-07 11:55:45,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:55:45,320 INFO L462 AbstractCegarLoop]: Abstraction has 115962 states and 480151 transitions. [2019-12-07 11:55:45,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:55:45,320 INFO L276 IsEmpty]: Start isEmpty. Operand 115962 states and 480151 transitions. [2019-12-07 11:55:45,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:55:45,322 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:55:45,323 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:55:45,323 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 11:55:45,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:45,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985610, now seen corresponding path program 1 times [2019-12-07 11:55:45,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:45,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874640124] [2019-12-07 11:55:45,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:45,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:45,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874640124] [2019-12-07 11:55:45,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:55:45,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:55:45,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6254302] [2019-12-07 11:55:45,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:55:45,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:45,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:55:45,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:55:45,358 INFO L87 Difference]: Start difference. First operand 115962 states and 480151 transitions. Second operand 3 states. [2019-12-07 11:55:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:45,450 INFO L93 Difference]: Finished difference Result 28492 states and 95363 transitions. [2019-12-07 11:55:45,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:55:45,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 11:55:45,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:55:45,492 INFO L225 Difference]: With dead ends: 28492 [2019-12-07 11:55:45,493 INFO L226 Difference]: Without dead ends: 28492 [2019-12-07 11:55:45,493 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 11:55:45,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28492 states. [2019-12-07 11:55:46,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28492 to 28492. [2019-12-07 11:55:46,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28492 states. [2019-12-07 11:55:46,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28492 states to 28492 states and 95363 transitions. [2019-12-07 11:55:46,218 INFO L78 Accepts]: Start accepts. Automaton has 28492 states and 95363 transitions. Word has length 13 [2019-12-07 11:55:46,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:55:46,219 INFO L462 AbstractCegarLoop]: Abstraction has 28492 states and 95363 transitions. [2019-12-07 11:55:46,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:55:46,219 INFO L276 IsEmpty]: Start isEmpty. Operand 28492 states and 95363 transitions. [2019-12-07 11:55:46,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:55:46,220 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:55:46,220 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:55:46,220 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 11:55:46,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:46,220 INFO L82 PathProgramCache]: Analyzing trace with hash 319138254, now seen corresponding path program 1 times [2019-12-07 11:55:46,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:46,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457373046] [2019-12-07 11:55:46,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:46,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457373046] [2019-12-07 11:55:46,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:55:46,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:55:46,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649253000] [2019-12-07 11:55:46,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:55:46,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:46,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:55:46,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:55:46,284 INFO L87 Difference]: Start difference. First operand 28492 states and 95363 transitions. Second operand 5 states. [2019-12-07 11:55:46,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:46,579 INFO L93 Difference]: Finished difference Result 41156 states and 135447 transitions. [2019-12-07 11:55:46,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:55:46,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 11:55:46,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:55:46,636 INFO L225 Difference]: With dead ends: 41156 [2019-12-07 11:55:46,637 INFO L226 Difference]: Without dead ends: 41141 [2019-12-07 11:55:46,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:55:46,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41141 states. [2019-12-07 11:55:47,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41141 to 31619. [2019-12-07 11:55:47,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31619 states. [2019-12-07 11:55:47,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31619 states to 31619 states and 105299 transitions. [2019-12-07 11:55:47,222 INFO L78 Accepts]: Start accepts. Automaton has 31619 states and 105299 transitions. Word has length 14 [2019-12-07 11:55:47,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:55:47,223 INFO L462 AbstractCegarLoop]: Abstraction has 31619 states and 105299 transitions. [2019-12-07 11:55:47,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:55:47,223 INFO L276 IsEmpty]: Start isEmpty. Operand 31619 states and 105299 transitions. [2019-12-07 11:55:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:55:47,230 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:55:47,230 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:55:47,230 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 11:55:47,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:47,230 INFO L82 PathProgramCache]: Analyzing trace with hash 436639450, now seen corresponding path program 1 times [2019-12-07 11:55:47,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:47,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568170264] [2019-12-07 11:55:47,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:47,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:47,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568170264] [2019-12-07 11:55:47,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:55:47,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:55:47,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433493164] [2019-12-07 11:55:47,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:55:47,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:47,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:55:47,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:55:47,299 INFO L87 Difference]: Start difference. First operand 31619 states and 105299 transitions. Second operand 6 states. [2019-12-07 11:55:47,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:47,832 INFO L93 Difference]: Finished difference Result 48363 states and 157775 transitions. [2019-12-07 11:55:47,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:55:47,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 11:55:47,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:55:47,899 INFO L225 Difference]: With dead ends: 48363 [2019-12-07 11:55:47,899 INFO L226 Difference]: Without dead ends: 48336 [2019-12-07 11:55:47,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:55:48,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48336 states. [2019-12-07 11:55:48,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48336 to 33272. [2019-12-07 11:55:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33272 states. [2019-12-07 11:55:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33272 states to 33272 states and 109841 transitions. [2019-12-07 11:55:48,550 INFO L78 Accepts]: Start accepts. Automaton has 33272 states and 109841 transitions. Word has length 22 [2019-12-07 11:55:48,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:55:48,550 INFO L462 AbstractCegarLoop]: Abstraction has 33272 states and 109841 transitions. [2019-12-07 11:55:48,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:55:48,550 INFO L276 IsEmpty]: Start isEmpty. Operand 33272 states and 109841 transitions. [2019-12-07 11:55:48,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:55:48,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:55:48,565 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 11:55:48,565 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 11:55:48,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:48,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050687, now seen corresponding path program 1 times [2019-12-07 11:55:48,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:48,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147631494] [2019-12-07 11:55:48,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:48,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:48,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147631494] [2019-12-07 11:55:48,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:55:48,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:55:48,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925766054] [2019-12-07 11:55:48,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:55:48,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:48,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:55:48,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:55:48,617 INFO L87 Difference]: Start difference. First operand 33272 states and 109841 transitions. Second operand 4 states. [2019-12-07 11:55:48,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:48,672 INFO L93 Difference]: Finished difference Result 12861 states and 39176 transitions. [2019-12-07 11:55:48,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:55:48,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 11:55:48,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:55:48,690 INFO L225 Difference]: With dead ends: 12861 [2019-12-07 11:55:48,690 INFO L226 Difference]: Without dead ends: 12861 [2019-12-07 11:55:48,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:55:48,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-12-07 11:55:49,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 12721. [2019-12-07 11:55:49,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12721 states. [2019-12-07 11:55:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12721 states to 12721 states and 38766 transitions. [2019-12-07 11:55:49,049 INFO L78 Accepts]: Start accepts. Automaton has 12721 states and 38766 transitions. Word has length 25 [2019-12-07 11:55:49,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:55:49,049 INFO L462 AbstractCegarLoop]: Abstraction has 12721 states and 38766 transitions. [2019-12-07 11:55:49,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:55:49,049 INFO L276 IsEmpty]: Start isEmpty. Operand 12721 states and 38766 transitions. [2019-12-07 11:55:49,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 11:55:49,063 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:55:49,063 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 11:55:49,063 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 11:55:49,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:49,064 INFO L82 PathProgramCache]: Analyzing trace with hash 207279171, now seen corresponding path program 1 times [2019-12-07 11:55:49,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:49,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712918677] [2019-12-07 11:55:49,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:49,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:49,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712918677] [2019-12-07 11:55:49,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:55:49,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:55:49,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409010715] [2019-12-07 11:55:49,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:55:49,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:49,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:55:49,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:55:49,112 INFO L87 Difference]: Start difference. First operand 12721 states and 38766 transitions. Second operand 5 states. [2019-12-07 11:55:49,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:49,154 INFO L93 Difference]: Finished difference Result 11425 states and 35436 transitions. [2019-12-07 11:55:49,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:55:49,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 11:55:49,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:55:49,166 INFO L225 Difference]: With dead ends: 11425 [2019-12-07 11:55:49,167 INFO L226 Difference]: Without dead ends: 11425 [2019-12-07 11:55:49,167 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 11:55:49,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11425 states. [2019-12-07 11:55:49,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11425 to 10977. [2019-12-07 11:55:49,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10977 states. [2019-12-07 11:55:49,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10977 states to 10977 states and 34172 transitions. [2019-12-07 11:55:49,324 INFO L78 Accepts]: Start accepts. Automaton has 10977 states and 34172 transitions. Word has length 39 [2019-12-07 11:55:49,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:55:49,324 INFO L462 AbstractCegarLoop]: Abstraction has 10977 states and 34172 transitions. [2019-12-07 11:55:49,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:55:49,324 INFO L276 IsEmpty]: Start isEmpty. Operand 10977 states and 34172 transitions. [2019-12-07 11:55:49,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 11:55:49,338 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:55:49,338 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] [2019-12-07 11:55:49,338 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 11:55:49,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:49,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1179829373, now seen corresponding path program 1 times [2019-12-07 11:55:49,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:49,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994541510] [2019-12-07 11:55:49,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:49,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:49,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994541510] [2019-12-07 11:55:49,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:55:49,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:55:49,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498673556] [2019-12-07 11:55:49,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:55:49,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:49,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:55:49,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:55:49,405 INFO L87 Difference]: Start difference. First operand 10977 states and 34172 transitions. Second operand 5 states. [2019-12-07 11:55:49,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:49,727 INFO L93 Difference]: Finished difference Result 15852 states and 48728 transitions. [2019-12-07 11:55:49,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:55:49,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-07 11:55:49,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:55:49,747 INFO L225 Difference]: With dead ends: 15852 [2019-12-07 11:55:49,747 INFO L226 Difference]: Without dead ends: 15852 [2019-12-07 11:55:49,747 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 11:55:49,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15852 states. [2019-12-07 11:55:49,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15852 to 14457. [2019-12-07 11:55:49,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14457 states. [2019-12-07 11:55:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14457 states to 14457 states and 44700 transitions. [2019-12-07 11:55:49,963 INFO L78 Accepts]: Start accepts. Automaton has 14457 states and 44700 transitions. Word has length 53 [2019-12-07 11:55:49,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:55:49,963 INFO L462 AbstractCegarLoop]: Abstraction has 14457 states and 44700 transitions. [2019-12-07 11:55:49,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:55:49,963 INFO L276 IsEmpty]: Start isEmpty. Operand 14457 states and 44700 transitions. [2019-12-07 11:55:49,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 11:55:49,982 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:55:49,982 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] [2019-12-07 11:55:49,982 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 11:55:49,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:49,983 INFO L82 PathProgramCache]: Analyzing trace with hash 194850767, now seen corresponding path program 2 times [2019-12-07 11:55:49,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:49,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694429122] [2019-12-07 11:55:49,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:50,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:50,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694429122] [2019-12-07 11:55:50,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:55:50,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:55:50,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923143481] [2019-12-07 11:55:50,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:55:50,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:50,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:55:50,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:55:50,044 INFO L87 Difference]: Start difference. First operand 14457 states and 44700 transitions. Second operand 6 states. [2019-12-07 11:55:50,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:50,429 INFO L93 Difference]: Finished difference Result 25137 states and 77688 transitions. [2019-12-07 11:55:50,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:55:50,429 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-07 11:55:50,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:55:50,458 INFO L225 Difference]: With dead ends: 25137 [2019-12-07 11:55:50,459 INFO L226 Difference]: Without dead ends: 25137 [2019-12-07 11:55:50,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:55:50,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25137 states. [2019-12-07 11:55:50,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25137 to 16137. [2019-12-07 11:55:50,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16137 states. [2019-12-07 11:55:50,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16137 states to 16137 states and 49947 transitions. [2019-12-07 11:55:50,741 INFO L78 Accepts]: Start accepts. Automaton has 16137 states and 49947 transitions. Word has length 53 [2019-12-07 11:55:50,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:55:50,741 INFO L462 AbstractCegarLoop]: Abstraction has 16137 states and 49947 transitions. [2019-12-07 11:55:50,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:55:50,741 INFO L276 IsEmpty]: Start isEmpty. Operand 16137 states and 49947 transitions. [2019-12-07 11:55:50,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 11:55:50,759 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:55:50,760 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] [2019-12-07 11:55:50,760 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 11:55:50,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:50,760 INFO L82 PathProgramCache]: Analyzing trace with hash 690646521, now seen corresponding path program 3 times [2019-12-07 11:55:50,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:50,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990622410] [2019-12-07 11:55:50,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:50,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990622410] [2019-12-07 11:55:50,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:55:50,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:55:50,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734243449] [2019-12-07 11:55:50,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:55:50,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:50,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:55:50,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:55:50,845 INFO L87 Difference]: Start difference. First operand 16137 states and 49947 transitions. Second operand 3 states. [2019-12-07 11:55:50,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:50,891 INFO L93 Difference]: Finished difference Result 16135 states and 49942 transitions. [2019-12-07 11:55:50,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:55:50,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 11:55:50,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:55:50,909 INFO L225 Difference]: With dead ends: 16135 [2019-12-07 11:55:50,909 INFO L226 Difference]: Without dead ends: 16135 [2019-12-07 11:55:50,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:55:50,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16135 states. [2019-12-07 11:55:51,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16135 to 14837. [2019-12-07 11:55:51,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14837 states. [2019-12-07 11:55:51,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14837 states to 14837 states and 46243 transitions. [2019-12-07 11:55:51,129 INFO L78 Accepts]: Start accepts. Automaton has 14837 states and 46243 transitions. Word has length 53 [2019-12-07 11:55:51,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:55:51,129 INFO L462 AbstractCegarLoop]: Abstraction has 14837 states and 46243 transitions. [2019-12-07 11:55:51,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:55:51,129 INFO L276 IsEmpty]: Start isEmpty. Operand 14837 states and 46243 transitions. [2019-12-07 11:55:51,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 11:55:51,142 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:55:51,142 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] [2019-12-07 11:55:51,142 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 11:55:51,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:51,143 INFO L82 PathProgramCache]: Analyzing trace with hash 95954180, now seen corresponding path program 1 times [2019-12-07 11:55:51,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:51,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685318452] [2019-12-07 11:55:51,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:51,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:51,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685318452] [2019-12-07 11:55:51,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:55:51,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:55:51,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263869047] [2019-12-07 11:55:51,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:55:51,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:51,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:55:51,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:55:51,184 INFO L87 Difference]: Start difference. First operand 14837 states and 46243 transitions. Second operand 3 states. [2019-12-07 11:55:51,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:51,218 INFO L93 Difference]: Finished difference Result 12626 states and 38826 transitions. [2019-12-07 11:55:51,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:55:51,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-07 11:55:51,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:55:51,231 INFO L225 Difference]: With dead ends: 12626 [2019-12-07 11:55:51,231 INFO L226 Difference]: Without dead ends: 12626 [2019-12-07 11:55:51,232 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:55:51,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12626 states. [2019-12-07 11:55:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12626 to 12098. [2019-12-07 11:55:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12098 states. [2019-12-07 11:55:51,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12098 states to 12098 states and 37286 transitions. [2019-12-07 11:55:51,399 INFO L78 Accepts]: Start accepts. Automaton has 12098 states and 37286 transitions. Word has length 54 [2019-12-07 11:55:51,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:55:51,399 INFO L462 AbstractCegarLoop]: Abstraction has 12098 states and 37286 transitions. [2019-12-07 11:55:51,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:55:51,399 INFO L276 IsEmpty]: Start isEmpty. Operand 12098 states and 37286 transitions. [2019-12-07 11:55:51,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 11:55:51,410 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:55:51,410 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 11:55:51,411 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 11:55:51,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:51,411 INFO L82 PathProgramCache]: Analyzing trace with hash -2064257105, now seen corresponding path program 1 times [2019-12-07 11:55:51,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:51,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800630508] [2019-12-07 11:55:51,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:51,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:51,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800630508] [2019-12-07 11:55:51,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:55:51,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:55:51,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657434689] [2019-12-07 11:55:51,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:55:51,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:51,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:55:51,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:55:51,467 INFO L87 Difference]: Start difference. First operand 12098 states and 37286 transitions. Second operand 4 states. [2019-12-07 11:55:51,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:51,525 INFO L93 Difference]: Finished difference Result 21898 states and 67402 transitions. [2019-12-07 11:55:51,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:55:51,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-07 11:55:51,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:55:51,577 INFO L225 Difference]: With dead ends: 21898 [2019-12-07 11:55:51,577 INFO L226 Difference]: Without dead ends: 20900 [2019-12-07 11:55:51,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:55:51,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20900 states. [2019-12-07 11:55:51,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20900 to 11898. [2019-12-07 11:55:51,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11898 states. [2019-12-07 11:55:51,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11898 states to 11898 states and 36644 transitions. [2019-12-07 11:55:51,781 INFO L78 Accepts]: Start accepts. Automaton has 11898 states and 36644 transitions. Word has length 55 [2019-12-07 11:55:51,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:55:51,781 INFO L462 AbstractCegarLoop]: Abstraction has 11898 states and 36644 transitions. [2019-12-07 11:55:51,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:55:51,781 INFO L276 IsEmpty]: Start isEmpty. Operand 11898 states and 36644 transitions. [2019-12-07 11:55:51,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 11:55:51,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:55:51,791 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 11:55:51,791 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 11:55:51,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:51,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1492343505, now seen corresponding path program 2 times [2019-12-07 11:55:51,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:51,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157980429] [2019-12-07 11:55:51,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:51,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:51,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157980429] [2019-12-07 11:55:51,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:55:51,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:55:51,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987684910] [2019-12-07 11:55:51,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:55:51,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:51,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:55:51,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:55:51,851 INFO L87 Difference]: Start difference. First operand 11898 states and 36644 transitions. Second operand 5 states. [2019-12-07 11:55:51,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:51,917 INFO L93 Difference]: Finished difference Result 21706 states and 66784 transitions. [2019-12-07 11:55:51,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:55:51,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-07 11:55:51,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:55:51,927 INFO L225 Difference]: With dead ends: 21706 [2019-12-07 11:55:51,928 INFO L226 Difference]: Without dead ends: 10270 [2019-12-07 11:55:51,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:55:51,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10270 states. [2019-12-07 11:55:52,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10270 to 10270. [2019-12-07 11:55:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10270 states. [2019-12-07 11:55:52,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10270 states to 10270 states and 31389 transitions. [2019-12-07 11:55:52,065 INFO L78 Accepts]: Start accepts. Automaton has 10270 states and 31389 transitions. Word has length 55 [2019-12-07 11:55:52,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:55:52,066 INFO L462 AbstractCegarLoop]: Abstraction has 10270 states and 31389 transitions. [2019-12-07 11:55:52,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:55:52,066 INFO L276 IsEmpty]: Start isEmpty. Operand 10270 states and 31389 transitions. [2019-12-07 11:55:52,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 11:55:52,076 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:55:52,076 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 11:55:52,076 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 11:55:52,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:52,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1024706095, now seen corresponding path program 3 times [2019-12-07 11:55:52,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:52,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317257987] [2019-12-07 11:55:52,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:52,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:52,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317257987] [2019-12-07 11:55:52,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:55:52,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 11:55:52,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438601754] [2019-12-07 11:55:52,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:55:52,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:52,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:55:52,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:55:52,263 INFO L87 Difference]: Start difference. First operand 10270 states and 31389 transitions. Second operand 11 states. [2019-12-07 11:55:53,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:53,031 INFO L93 Difference]: Finished difference Result 25522 states and 78530 transitions. [2019-12-07 11:55:53,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 11:55:53,031 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-07 11:55:53,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:55:53,056 INFO L225 Difference]: With dead ends: 25522 [2019-12-07 11:55:53,056 INFO L226 Difference]: Without dead ends: 24188 [2019-12-07 11:55:53,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=271, Invalid=1135, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 11:55:53,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24188 states. [2019-12-07 11:55:53,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24188 to 15828. [2019-12-07 11:55:53,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15828 states. [2019-12-07 11:55:53,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15828 states to 15828 states and 48896 transitions. [2019-12-07 11:55:53,350 INFO L78 Accepts]: Start accepts. Automaton has 15828 states and 48896 transitions. Word has length 55 [2019-12-07 11:55:53,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:55:53,351 INFO L462 AbstractCegarLoop]: Abstraction has 15828 states and 48896 transitions. [2019-12-07 11:55:53,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:55:53,351 INFO L276 IsEmpty]: Start isEmpty. Operand 15828 states and 48896 transitions. [2019-12-07 11:55:53,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 11:55:53,363 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:55:53,364 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 11:55:53,364 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 11:55:53,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:53,364 INFO L82 PathProgramCache]: Analyzing trace with hash 621327827, now seen corresponding path program 4 times [2019-12-07 11:55:53,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:53,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323614488] [2019-12-07 11:55:53,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:53,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:53,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323614488] [2019-12-07 11:55:53,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:55:53,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 11:55:53,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734205354] [2019-12-07 11:55:53,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 11:55:53,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:53,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 11:55:53,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:55:53,676 INFO L87 Difference]: Start difference. First operand 15828 states and 48896 transitions. Second operand 15 states. [2019-12-07 11:55:58,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:58,498 INFO L93 Difference]: Finished difference Result 36136 states and 109830 transitions. [2019-12-07 11:55:58,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-07 11:55:58,499 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-07 11:55:58,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:55:58,533 INFO L225 Difference]: With dead ends: 36136 [2019-12-07 11:55:58,533 INFO L226 Difference]: Without dead ends: 27566 [2019-12-07 11:55:58,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=549, Invalid=2757, Unknown=0, NotChecked=0, Total=3306 [2019-12-07 11:55:58,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27566 states. [2019-12-07 11:55:58,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27566 to 16380. [2019-12-07 11:55:58,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16380 states. [2019-12-07 11:55:58,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16380 states to 16380 states and 50141 transitions. [2019-12-07 11:55:58,897 INFO L78 Accepts]: Start accepts. Automaton has 16380 states and 50141 transitions. Word has length 55 [2019-12-07 11:55:58,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:55:58,897 INFO L462 AbstractCegarLoop]: Abstraction has 16380 states and 50141 transitions. [2019-12-07 11:55:58,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 11:55:58,897 INFO L276 IsEmpty]: Start isEmpty. Operand 16380 states and 50141 transitions. [2019-12-07 11:55:58,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 11:55:58,911 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:55:58,911 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 11:55:58,911 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 11:55:58,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:58,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1698448247, now seen corresponding path program 5 times [2019-12-07 11:55:58,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:58,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169102789] [2019-12-07 11:55:58,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:59,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:59,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169102789] [2019-12-07 11:55:59,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:55:59,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 11:55:59,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428536864] [2019-12-07 11:55:59,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 11:55:59,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:59,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 11:55:59,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:55:59,238 INFO L87 Difference]: Start difference. First operand 16380 states and 50141 transitions. Second operand 15 states. [2019-12-07 11:56:02,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:02,893 INFO L93 Difference]: Finished difference Result 30822 states and 93417 transitions. [2019-12-07 11:56:02,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-07 11:56:02,894 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-12-07 11:56:02,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:02,924 INFO L225 Difference]: With dead ends: 30822 [2019-12-07 11:56:02,924 INFO L226 Difference]: Without dead ends: 26647 [2019-12-07 11:56:02,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1470 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=742, Invalid=3950, Unknown=0, NotChecked=0, Total=4692 [2019-12-07 11:56:03,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26647 states. [2019-12-07 11:56:03,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26647 to 15608. [2019-12-07 11:56:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15608 states. [2019-12-07 11:56:03,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15608 states to 15608 states and 47778 transitions. [2019-12-07 11:56:03,219 INFO L78 Accepts]: Start accepts. Automaton has 15608 states and 47778 transitions. Word has length 55 [2019-12-07 11:56:03,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:03,219 INFO L462 AbstractCegarLoop]: Abstraction has 15608 states and 47778 transitions. [2019-12-07 11:56:03,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 11:56:03,219 INFO L276 IsEmpty]: Start isEmpty. Operand 15608 states and 47778 transitions. [2019-12-07 11:56:03,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 11:56:03,231 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:03,232 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 11:56:03,232 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 11:56:03,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:03,232 INFO L82 PathProgramCache]: Analyzing trace with hash -2043347127, now seen corresponding path program 6 times [2019-12-07 11:56:03,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:03,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992192994] [2019-12-07 11:56:03,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:03,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:03,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992192994] [2019-12-07 11:56:03,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:03,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 11:56:03,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266529732] [2019-12-07 11:56:03,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:56:03,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:03,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:56:03,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:56:03,351 INFO L87 Difference]: Start difference. First operand 15608 states and 47778 transitions. Second operand 12 states. [2019-12-07 11:56:03,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:03,993 INFO L93 Difference]: Finished difference Result 24217 states and 73330 transitions. [2019-12-07 11:56:03,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 11:56:03,993 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-07 11:56:03,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:04,011 INFO L225 Difference]: With dead ends: 24217 [2019-12-07 11:56:04,011 INFO L226 Difference]: Without dead ends: 17760 [2019-12-07 11:56:04,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2019-12-07 11:56:04,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17760 states. [2019-12-07 11:56:04,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17760 to 11562. [2019-12-07 11:56:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11562 states. [2019-12-07 11:56:04,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11562 states to 11562 states and 34966 transitions. [2019-12-07 11:56:04,206 INFO L78 Accepts]: Start accepts. Automaton has 11562 states and 34966 transitions. Word has length 55 [2019-12-07 11:56:04,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:04,206 INFO L462 AbstractCegarLoop]: Abstraction has 11562 states and 34966 transitions. [2019-12-07 11:56:04,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:56:04,206 INFO L276 IsEmpty]: Start isEmpty. Operand 11562 states and 34966 transitions. [2019-12-07 11:56:04,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 11:56:04,215 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:04,215 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 11:56:04,215 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:04,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:04,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1678920401, now seen corresponding path program 7 times [2019-12-07 11:56:04,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:04,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050067577] [2019-12-07 11:56:04,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:04,280 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:56:04,280 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:56:04,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_531) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= (select .cse0 |v_ULTIMATE.start_main_~#t2357~0.base_24|) 0) (= 0 v_~x$r_buff1_thd3~0_123) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2357~0.base_24|) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2357~0.base_24| 1)) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= |v_ULTIMATE.start_main_~#t2357~0.offset_18| 0) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2357~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2357~0.base_24|) |v_ULTIMATE.start_main_~#t2357~0.offset_18| 0)) |v_#memory_int_23|) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2357~0.base_24| 4) |v_#length_23|) (= 0 v_~x$w_buff0_used~0_899) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_~#t2357~0.base=|v_ULTIMATE.start_main_~#t2357~0.base_24|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ULTIMATE.start_main_~#t2358~0.offset=|v_ULTIMATE.start_main_~#t2358~0.offset_19|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ULTIMATE.start_main_~#t2359~0.base=|v_ULTIMATE.start_main_~#t2359~0.base_26|, ULTIMATE.start_main_~#t2359~0.offset=|v_ULTIMATE.start_main_~#t2359~0.offset_19|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_~#t2358~0.base=|v_ULTIMATE.start_main_~#t2358~0.base_26|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ~y~0=v_~y~0_70, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ULTIMATE.start_main_~#t2357~0.offset=|v_ULTIMATE.start_main_~#t2357~0.offset_18|, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t2357~0.base, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t2358~0.offset, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2359~0.base, ULTIMATE.start_main_~#t2359~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2358~0.base, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ULTIMATE.start_main_~#t2357~0.offset, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 11:56:04,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2358~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2358~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t2358~0.offset_11| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2358~0.base_13| 4) |v_#length_15|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2358~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2358~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2358~0.base_13|) |v_ULTIMATE.start_main_~#t2358~0.offset_11| 1)) |v_#memory_int_15|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2358~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2358~0.offset=|v_ULTIMATE.start_main_~#t2358~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2358~0.base=|v_ULTIMATE.start_main_~#t2358~0.base_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2358~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t2358~0.base, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 11:56:04,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= |v_ULTIMATE.start_main_~#t2359~0.offset_11| 0) (not (= |v_ULTIMATE.start_main_~#t2359~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2359~0.base_13|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2359~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2359~0.base_13|) |v_ULTIMATE.start_main_~#t2359~0.offset_11| 2))) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2359~0.base_13| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2359~0.base_13| 4)) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2359~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2359~0.offset=|v_ULTIMATE.start_main_~#t2359~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2359~0.base=|v_ULTIMATE.start_main_~#t2359~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2359~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2359~0.base] because there is no mapped edge [2019-12-07 11:56:04,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= 1 ~x$w_buff0_used~0_Out1834601594) (= |P1Thread1of1ForFork0_#in~arg.base_In1834601594| P1Thread1of1ForFork0_~arg.base_Out1834601594) (= ~x$w_buff0_used~0_In1834601594 ~x$w_buff1_used~0_Out1834601594) (= ~x$w_buff0~0_In1834601594 ~x$w_buff1~0_Out1834601594) (not (= 0 P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out1834601594)) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1834601594| (ite (not (and (not (= 0 (mod ~x$w_buff1_used~0_Out1834601594 256))) (not (= 0 (mod ~x$w_buff0_used~0_Out1834601594 256))))) 1 0)) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1834601594| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out1834601594) (= P1Thread1of1ForFork0_~arg.offset_Out1834601594 |P1Thread1of1ForFork0_#in~arg.offset_In1834601594|) (= 1 ~x$w_buff0~0_Out1834601594)) InVars {~x$w_buff0~0=~x$w_buff0~0_In1834601594, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In1834601594|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In1834601594|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1834601594} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out1834601594, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out1834601594, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out1834601594, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out1834601594, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1834601594|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In1834601594|, ~x$w_buff1~0=~x$w_buff1~0_Out1834601594, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In1834601594|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1834601594, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1834601594} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 11:56:04,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In331982283 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In331982283 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In331982283 |P2Thread1of1ForFork1_#t~ite32_Out331982283|)) (and (not .cse1) (= ~x$w_buff1~0_In331982283 |P2Thread1of1ForFork1_#t~ite32_Out331982283|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In331982283, ~x$w_buff1_used~0=~x$w_buff1_used~0_In331982283, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In331982283, ~x~0=~x~0_In331982283} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out331982283|, ~x$w_buff1~0=~x$w_buff1~0_In331982283, ~x$w_buff1_used~0=~x$w_buff1_used~0_In331982283, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In331982283, ~x~0=~x~0_In331982283} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 11:56:04,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |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_27|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 11:56:04,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-1799684848 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1799684848 256) 0))) (or (and (= ~x$w_buff0_used~0_In-1799684848 |P2Thread1of1ForFork1_#t~ite34_Out-1799684848|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-1799684848|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1799684848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1799684848} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1799684848|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1799684848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1799684848} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 11:56:04,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1454794374 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1454794374 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1454794374| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1454794374| ~x$w_buff0_used~0_In-1454794374)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1454794374, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1454794374} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1454794374, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1454794374|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1454794374} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 11:56:04,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-944071822 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-944071822 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-944071822 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-944071822 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out-944071822| ~x$w_buff1_used~0_In-944071822)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out-944071822| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-944071822, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-944071822, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-944071822, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-944071822} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-944071822, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-944071822, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-944071822, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-944071822|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-944071822} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 11:56:04,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In803019040 256) 0)) (.cse2 (= ~x$r_buff0_thd2~0_Out803019040 ~x$r_buff0_thd2~0_In803019040)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In803019040 256)))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out803019040 0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In803019040, ~x$w_buff0_used~0=~x$w_buff0_used~0_In803019040} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out803019040|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out803019040, ~x$w_buff0_used~0=~x$w_buff0_used~0_In803019040} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 11:56:04,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1880219743 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1880219743 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1880219743 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1880219743 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out1880219743| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite31_Out1880219743| ~x$r_buff1_thd2~0_In1880219743)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1880219743, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1880219743, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1880219743, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1880219743} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1880219743|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1880219743, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1880219743, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1880219743, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1880219743} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 11:56:04,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_36|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, 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 11:56:04,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2115857346 256)))) (or (and (= ~x$w_buff1~0_In-2115857346 |P0Thread1of1ForFork2_#t~ite11_Out-2115857346|) .cse0 (= |P0Thread1of1ForFork2_#t~ite12_Out-2115857346| |P0Thread1of1ForFork2_#t~ite11_Out-2115857346|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-2115857346 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-2115857346 256))) (and .cse1 (= (mod ~x$w_buff1_used~0_In-2115857346 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-2115857346 256))))) (and (= ~x$w_buff1~0_In-2115857346 |P0Thread1of1ForFork2_#t~ite12_Out-2115857346|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite11_In-2115857346| |P0Thread1of1ForFork2_#t~ite11_Out-2115857346|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2115857346, ~x$w_buff1~0=~x$w_buff1~0_In-2115857346, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2115857346, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2115857346, ~weak$$choice2~0=~weak$$choice2~0_In-2115857346, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-2115857346|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2115857346} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2115857346, ~x$w_buff1~0=~x$w_buff1~0_In-2115857346, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2115857346, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2115857346, ~weak$$choice2~0=~weak$$choice2~0_In-2115857346, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-2115857346|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-2115857346|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2115857346} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 11:56:04,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In838641943 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In838641943 256)))) (or (= (mod ~x$w_buff0_used~0_In838641943 256) 0) (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In838641943 256))) (and .cse0 (= (mod ~x$w_buff1_used~0_In838641943 256) 0)))) .cse1 (= |P0Thread1of1ForFork2_#t~ite14_Out838641943| ~x$w_buff0_used~0_In838641943) (= |P0Thread1of1ForFork2_#t~ite15_Out838641943| |P0Thread1of1ForFork2_#t~ite14_Out838641943|)) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite14_In838641943| |P0Thread1of1ForFork2_#t~ite14_Out838641943|) (= |P0Thread1of1ForFork2_#t~ite15_Out838641943| ~x$w_buff0_used~0_In838641943)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In838641943, ~x$w_buff1_used~0=~x$w_buff1_used~0_In838641943, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In838641943, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In838641943|, ~weak$$choice2~0=~weak$$choice2~0_In838641943, ~x$w_buff0_used~0=~x$w_buff0_used~0_In838641943} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In838641943, ~x$w_buff1_used~0=~x$w_buff1_used~0_In838641943, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out838641943|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In838641943, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out838641943|, ~weak$$choice2~0=~weak$$choice2~0_In838641943, ~x$w_buff0_used~0=~x$w_buff0_used~0_In838641943} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 11:56:04,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1687211289 256) 0))) (or (and (not .cse0) (= ~x$w_buff1_used~0_In-1687211289 |P0Thread1of1ForFork2_#t~ite18_Out-1687211289|) (= |P0Thread1of1ForFork2_#t~ite17_In-1687211289| |P0Thread1of1ForFork2_#t~ite17_Out-1687211289|)) (and .cse0 (= ~x$w_buff1_used~0_In-1687211289 |P0Thread1of1ForFork2_#t~ite17_Out-1687211289|) (= |P0Thread1of1ForFork2_#t~ite18_Out-1687211289| |P0Thread1of1ForFork2_#t~ite17_Out-1687211289|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1687211289 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-1687211289 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1687211289 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1687211289 256)))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1687211289, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-1687211289|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1687211289, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1687211289, ~weak$$choice2~0=~weak$$choice2~0_In-1687211289, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1687211289} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1687211289, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-1687211289|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-1687211289|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1687211289, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1687211289, ~weak$$choice2~0=~weak$$choice2~0_In-1687211289, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1687211289} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 11:56:04,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_33|) (= |v_P0Thread1of1ForFork2_#t~ite22_34| |v_P0Thread1of1ForFork2_#t~ite22_33|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (= |v_P0Thread1of1ForFork2_#t~ite23_38| |v_P0Thread1of1ForFork2_#t~ite23_37|) (not (= 0 (mod v_~weak$$choice2~0_142 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_38|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_34|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_25|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_33|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_37|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_33|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_13|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 11:56:04,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 11:56:04,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1860557242 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In1860557242 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1860557242 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1860557242 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out1860557242|)) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1860557242 |P2Thread1of1ForFork1_#t~ite35_Out1860557242|) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1860557242, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1860557242, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1860557242, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1860557242} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1860557242|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1860557242, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1860557242, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1860557242, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1860557242} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 11:56:04,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-2122899675 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-2122899675 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-2122899675|)) (and (= ~x$r_buff0_thd3~0_In-2122899675 |P2Thread1of1ForFork1_#t~ite36_Out-2122899675|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2122899675, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2122899675} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-2122899675|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2122899675, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2122899675} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 11:56:04,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1080715696 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In1080715696 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In1080715696 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1080715696 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out1080715696|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite37_Out1080715696| ~x$r_buff1_thd3~0_In1080715696)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1080715696, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1080715696, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1080715696, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1080715696} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1080715696|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1080715696, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1080715696, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1080715696, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1080715696} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 11:56:04,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_38|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, 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 11:56:04,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_39) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:56:04,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1583950760 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1583950760 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1583950760| ~x$w_buff1~0_In1583950760) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out1583950760| ~x~0_In1583950760)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1583950760, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1583950760, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1583950760, ~x~0=~x~0_In1583950760} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1583950760|, ~x$w_buff1~0=~x$w_buff1~0_In1583950760, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1583950760, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1583950760, ~x~0=~x~0_In1583950760} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 11:56:04,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 11:56:04,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In735230836 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In735230836 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out735230836| ~x$w_buff0_used~0_In735230836)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out735230836|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In735230836, ~x$w_buff0_used~0=~x$w_buff0_used~0_In735230836} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In735230836, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out735230836|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In735230836} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 11:56:04,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In-641926461 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-641926461 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-641926461 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-641926461 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-641926461| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-641926461 |ULTIMATE.start_main_#t~ite44_Out-641926461|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-641926461, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-641926461, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-641926461, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-641926461} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-641926461, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-641926461, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-641926461, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-641926461|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-641926461} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 11:56:04,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In406734977 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In406734977 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In406734977 |ULTIMATE.start_main_#t~ite45_Out406734977|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out406734977|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In406734977, ~x$w_buff0_used~0=~x$w_buff0_used~0_In406734977} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In406734977, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out406734977|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In406734977} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 11:56:04,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In860921842 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In860921842 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In860921842 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In860921842 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out860921842| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite46_Out860921842| ~x$r_buff1_thd0~0_In860921842)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In860921842, ~x$w_buff1_used~0=~x$w_buff1_used~0_In860921842, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In860921842, ~x$w_buff0_used~0=~x$w_buff0_used~0_In860921842} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In860921842, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out860921842|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In860921842, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In860921842, ~x$w_buff0_used~0=~x$w_buff0_used~0_In860921842} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 11:56:04,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} 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 11:56:04,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:56:04 BasicIcfg [2019-12-07 11:56:04,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:56:04,347 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:56:04,347 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:56:04,347 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:56:04,348 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:55:18" (3/4) ... [2019-12-07 11:56:04,350 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:56:04,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_531) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= (select .cse0 |v_ULTIMATE.start_main_~#t2357~0.base_24|) 0) (= 0 v_~x$r_buff1_thd3~0_123) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2357~0.base_24|) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2357~0.base_24| 1)) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= |v_ULTIMATE.start_main_~#t2357~0.offset_18| 0) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2357~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2357~0.base_24|) |v_ULTIMATE.start_main_~#t2357~0.offset_18| 0)) |v_#memory_int_23|) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2357~0.base_24| 4) |v_#length_23|) (= 0 v_~x$w_buff0_used~0_899) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_~#t2357~0.base=|v_ULTIMATE.start_main_~#t2357~0.base_24|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ULTIMATE.start_main_~#t2358~0.offset=|v_ULTIMATE.start_main_~#t2358~0.offset_19|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ULTIMATE.start_main_~#t2359~0.base=|v_ULTIMATE.start_main_~#t2359~0.base_26|, ULTIMATE.start_main_~#t2359~0.offset=|v_ULTIMATE.start_main_~#t2359~0.offset_19|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_~#t2358~0.base=|v_ULTIMATE.start_main_~#t2358~0.base_26|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ~y~0=v_~y~0_70, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ULTIMATE.start_main_~#t2357~0.offset=|v_ULTIMATE.start_main_~#t2357~0.offset_18|, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t2357~0.base, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t2358~0.offset, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2359~0.base, ULTIMATE.start_main_~#t2359~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2358~0.base, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ULTIMATE.start_main_~#t2357~0.offset, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 11:56:04,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2358~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2358~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t2358~0.offset_11| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2358~0.base_13| 4) |v_#length_15|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2358~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2358~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2358~0.base_13|) |v_ULTIMATE.start_main_~#t2358~0.offset_11| 1)) |v_#memory_int_15|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2358~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2358~0.offset=|v_ULTIMATE.start_main_~#t2358~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2358~0.base=|v_ULTIMATE.start_main_~#t2358~0.base_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2358~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t2358~0.base, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 11:56:04,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= |v_ULTIMATE.start_main_~#t2359~0.offset_11| 0) (not (= |v_ULTIMATE.start_main_~#t2359~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2359~0.base_13|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2359~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2359~0.base_13|) |v_ULTIMATE.start_main_~#t2359~0.offset_11| 2))) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2359~0.base_13| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2359~0.base_13| 4)) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2359~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2359~0.offset=|v_ULTIMATE.start_main_~#t2359~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2359~0.base=|v_ULTIMATE.start_main_~#t2359~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2359~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2359~0.base] because there is no mapped edge [2019-12-07 11:56:04,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= 1 ~x$w_buff0_used~0_Out1834601594) (= |P1Thread1of1ForFork0_#in~arg.base_In1834601594| P1Thread1of1ForFork0_~arg.base_Out1834601594) (= ~x$w_buff0_used~0_In1834601594 ~x$w_buff1_used~0_Out1834601594) (= ~x$w_buff0~0_In1834601594 ~x$w_buff1~0_Out1834601594) (not (= 0 P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out1834601594)) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1834601594| (ite (not (and (not (= 0 (mod ~x$w_buff1_used~0_Out1834601594 256))) (not (= 0 (mod ~x$w_buff0_used~0_Out1834601594 256))))) 1 0)) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1834601594| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out1834601594) (= P1Thread1of1ForFork0_~arg.offset_Out1834601594 |P1Thread1of1ForFork0_#in~arg.offset_In1834601594|) (= 1 ~x$w_buff0~0_Out1834601594)) InVars {~x$w_buff0~0=~x$w_buff0~0_In1834601594, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In1834601594|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In1834601594|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1834601594} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out1834601594, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out1834601594, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out1834601594, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out1834601594, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1834601594|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In1834601594|, ~x$w_buff1~0=~x$w_buff1~0_Out1834601594, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In1834601594|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1834601594, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1834601594} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 11:56:04,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In331982283 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In331982283 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In331982283 |P2Thread1of1ForFork1_#t~ite32_Out331982283|)) (and (not .cse1) (= ~x$w_buff1~0_In331982283 |P2Thread1of1ForFork1_#t~ite32_Out331982283|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In331982283, ~x$w_buff1_used~0=~x$w_buff1_used~0_In331982283, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In331982283, ~x~0=~x~0_In331982283} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out331982283|, ~x$w_buff1~0=~x$w_buff1~0_In331982283, ~x$w_buff1_used~0=~x$w_buff1_used~0_In331982283, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In331982283, ~x~0=~x~0_In331982283} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 11:56:04,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |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_27|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 11:56:04,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-1799684848 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1799684848 256) 0))) (or (and (= ~x$w_buff0_used~0_In-1799684848 |P2Thread1of1ForFork1_#t~ite34_Out-1799684848|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-1799684848|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1799684848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1799684848} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1799684848|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1799684848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1799684848} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 11:56:04,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1454794374 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1454794374 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1454794374| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1454794374| ~x$w_buff0_used~0_In-1454794374)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1454794374, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1454794374} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1454794374, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1454794374|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1454794374} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 11:56:04,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-944071822 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-944071822 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-944071822 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-944071822 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out-944071822| ~x$w_buff1_used~0_In-944071822)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out-944071822| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-944071822, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-944071822, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-944071822, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-944071822} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-944071822, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-944071822, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-944071822, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-944071822|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-944071822} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 11:56:04,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In803019040 256) 0)) (.cse2 (= ~x$r_buff0_thd2~0_Out803019040 ~x$r_buff0_thd2~0_In803019040)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In803019040 256)))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out803019040 0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In803019040, ~x$w_buff0_used~0=~x$w_buff0_used~0_In803019040} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out803019040|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out803019040, ~x$w_buff0_used~0=~x$w_buff0_used~0_In803019040} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 11:56:04,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1880219743 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1880219743 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1880219743 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1880219743 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out1880219743| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite31_Out1880219743| ~x$r_buff1_thd2~0_In1880219743)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1880219743, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1880219743, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1880219743, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1880219743} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1880219743|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1880219743, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1880219743, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1880219743, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1880219743} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 11:56:04,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_36|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, 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 11:56:04,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2115857346 256)))) (or (and (= ~x$w_buff1~0_In-2115857346 |P0Thread1of1ForFork2_#t~ite11_Out-2115857346|) .cse0 (= |P0Thread1of1ForFork2_#t~ite12_Out-2115857346| |P0Thread1of1ForFork2_#t~ite11_Out-2115857346|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-2115857346 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-2115857346 256))) (and .cse1 (= (mod ~x$w_buff1_used~0_In-2115857346 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-2115857346 256))))) (and (= ~x$w_buff1~0_In-2115857346 |P0Thread1of1ForFork2_#t~ite12_Out-2115857346|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite11_In-2115857346| |P0Thread1of1ForFork2_#t~ite11_Out-2115857346|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2115857346, ~x$w_buff1~0=~x$w_buff1~0_In-2115857346, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2115857346, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2115857346, ~weak$$choice2~0=~weak$$choice2~0_In-2115857346, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-2115857346|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2115857346} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2115857346, ~x$w_buff1~0=~x$w_buff1~0_In-2115857346, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2115857346, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2115857346, ~weak$$choice2~0=~weak$$choice2~0_In-2115857346, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-2115857346|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-2115857346|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2115857346} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 11:56:04,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In838641943 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In838641943 256)))) (or (= (mod ~x$w_buff0_used~0_In838641943 256) 0) (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In838641943 256))) (and .cse0 (= (mod ~x$w_buff1_used~0_In838641943 256) 0)))) .cse1 (= |P0Thread1of1ForFork2_#t~ite14_Out838641943| ~x$w_buff0_used~0_In838641943) (= |P0Thread1of1ForFork2_#t~ite15_Out838641943| |P0Thread1of1ForFork2_#t~ite14_Out838641943|)) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite14_In838641943| |P0Thread1of1ForFork2_#t~ite14_Out838641943|) (= |P0Thread1of1ForFork2_#t~ite15_Out838641943| ~x$w_buff0_used~0_In838641943)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In838641943, ~x$w_buff1_used~0=~x$w_buff1_used~0_In838641943, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In838641943, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In838641943|, ~weak$$choice2~0=~weak$$choice2~0_In838641943, ~x$w_buff0_used~0=~x$w_buff0_used~0_In838641943} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In838641943, ~x$w_buff1_used~0=~x$w_buff1_used~0_In838641943, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out838641943|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In838641943, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out838641943|, ~weak$$choice2~0=~weak$$choice2~0_In838641943, ~x$w_buff0_used~0=~x$w_buff0_used~0_In838641943} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 11:56:04,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1687211289 256) 0))) (or (and (not .cse0) (= ~x$w_buff1_used~0_In-1687211289 |P0Thread1of1ForFork2_#t~ite18_Out-1687211289|) (= |P0Thread1of1ForFork2_#t~ite17_In-1687211289| |P0Thread1of1ForFork2_#t~ite17_Out-1687211289|)) (and .cse0 (= ~x$w_buff1_used~0_In-1687211289 |P0Thread1of1ForFork2_#t~ite17_Out-1687211289|) (= |P0Thread1of1ForFork2_#t~ite18_Out-1687211289| |P0Thread1of1ForFork2_#t~ite17_Out-1687211289|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1687211289 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-1687211289 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1687211289 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1687211289 256)))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1687211289, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-1687211289|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1687211289, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1687211289, ~weak$$choice2~0=~weak$$choice2~0_In-1687211289, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1687211289} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1687211289, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-1687211289|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-1687211289|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1687211289, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1687211289, ~weak$$choice2~0=~weak$$choice2~0_In-1687211289, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1687211289} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 11:56:04,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_33|) (= |v_P0Thread1of1ForFork2_#t~ite22_34| |v_P0Thread1of1ForFork2_#t~ite22_33|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (= |v_P0Thread1of1ForFork2_#t~ite23_38| |v_P0Thread1of1ForFork2_#t~ite23_37|) (not (= 0 (mod v_~weak$$choice2~0_142 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_38|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_34|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_25|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_33|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_37|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_33|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_13|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 11:56:04,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 11:56:04,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1860557242 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In1860557242 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1860557242 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1860557242 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out1860557242|)) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1860557242 |P2Thread1of1ForFork1_#t~ite35_Out1860557242|) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1860557242, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1860557242, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1860557242, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1860557242} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1860557242|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1860557242, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1860557242, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1860557242, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1860557242} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 11:56:04,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-2122899675 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-2122899675 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-2122899675|)) (and (= ~x$r_buff0_thd3~0_In-2122899675 |P2Thread1of1ForFork1_#t~ite36_Out-2122899675|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2122899675, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2122899675} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-2122899675|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2122899675, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2122899675} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 11:56:04,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1080715696 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In1080715696 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In1080715696 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1080715696 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out1080715696|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite37_Out1080715696| ~x$r_buff1_thd3~0_In1080715696)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1080715696, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1080715696, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1080715696, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1080715696} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1080715696|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1080715696, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1080715696, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1080715696, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1080715696} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 11:56:04,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_38|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, 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 11:56:04,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_39) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:56:04,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1583950760 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1583950760 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1583950760| ~x$w_buff1~0_In1583950760) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out1583950760| ~x~0_In1583950760)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1583950760, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1583950760, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1583950760, ~x~0=~x~0_In1583950760} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1583950760|, ~x$w_buff1~0=~x$w_buff1~0_In1583950760, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1583950760, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1583950760, ~x~0=~x~0_In1583950760} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 11:56:04,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 11:56:04,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In735230836 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In735230836 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out735230836| ~x$w_buff0_used~0_In735230836)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out735230836|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In735230836, ~x$w_buff0_used~0=~x$w_buff0_used~0_In735230836} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In735230836, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out735230836|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In735230836} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 11:56:04,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In-641926461 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-641926461 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-641926461 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-641926461 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-641926461| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-641926461 |ULTIMATE.start_main_#t~ite44_Out-641926461|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-641926461, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-641926461, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-641926461, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-641926461} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-641926461, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-641926461, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-641926461, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-641926461|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-641926461} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 11:56:04,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In406734977 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In406734977 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In406734977 |ULTIMATE.start_main_#t~ite45_Out406734977|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out406734977|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In406734977, ~x$w_buff0_used~0=~x$w_buff0_used~0_In406734977} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In406734977, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out406734977|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In406734977} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 11:56:04,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In860921842 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In860921842 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In860921842 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In860921842 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out860921842| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite46_Out860921842| ~x$r_buff1_thd0~0_In860921842)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In860921842, ~x$w_buff1_used~0=~x$w_buff1_used~0_In860921842, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In860921842, ~x$w_buff0_used~0=~x$w_buff0_used~0_In860921842} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In860921842, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out860921842|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In860921842, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In860921842, ~x$w_buff0_used~0=~x$w_buff0_used~0_In860921842} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 11:56:04,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} 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 11:56:04,420 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_10f7f24c-bbf8-4dd4-964b-34359c7321d9/bin/uautomizer/witness.graphml [2019-12-07 11:56:04,420 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:56:04,422 INFO L168 Benchmark]: Toolchain (without parser) took 47035.03 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.2 GB). Free memory was 934.0 MB in the beginning and 1.2 GB in the end (delta: -312.6 MB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-12-07 11:56:04,422 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 954.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:56:04,422 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -136.3 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:56:04,423 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.63 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:56:04,423 INFO L168 Benchmark]: Boogie Preprocessor took 25.67 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:56:04,423 INFO L168 Benchmark]: RCFGBuilder took 389.76 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: 57.2 MB). Peak memory consumption was 57.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:56:04,424 INFO L168 Benchmark]: TraceAbstraction took 46120.33 ms. Allocated memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -287.7 MB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-12-07 11:56:04,424 INFO L168 Benchmark]: Witness Printer took 73.47 ms. Allocated memory is still 4.2 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:56:04,426 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 954.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 384.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -136.3 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.63 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.67 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 389.76 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: 57.2 MB). Peak memory consumption was 57.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46120.33 ms. Allocated memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -287.7 MB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. * Witness Printer took 73.47 ms. Allocated memory is still 4.2 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 29 ChoiceCompositions, 6837 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 66430 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2357, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z=0] [L822] FCALL, FORK 0 pthread_create(&t2358, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z=0] [L777] 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_p2_EAX=0, __unbuffered_p2_EBX=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, z=0] [L824] FCALL, FORK 0 pthread_create(&t2359, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L797] 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_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, z=1] [L741] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, z=1] [L777] 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) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 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 [L741] 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) [L742] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=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=1, z=1] [L742] 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)) [L743] 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)) [L744] 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)) [L745] 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)) [L747] 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)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 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 [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 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=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 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 [L833] 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, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 45.9s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3147 SDtfs, 5429 SDslu, 12253 SDs, 0 SdLazy, 8914 SolverSat, 309 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 18 SyntacticMatches, 17 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2961 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115962occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 94420 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 729 NumberOfCodeBlocks, 729 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 657 ConstructedInterpolants, 0 QuantifiedInterpolants, 194199 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...