./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix039_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_07cc26c6-0ba8-4bb6-a285-53a5081cba5c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_07cc26c6-0ba8-4bb6-a285-53a5081cba5c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_07cc26c6-0ba8-4bb6-a285-53a5081cba5c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_07cc26c6-0ba8-4bb6-a285-53a5081cba5c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix039_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_07cc26c6-0ba8-4bb6-a285-53a5081cba5c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_07cc26c6-0ba8-4bb6-a285-53a5081cba5c/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 7172975871b065518ca613924da6374ef1c35dee ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 16:17:17,635 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:17:17,636 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:17:17,644 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:17:17,645 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:17:17,645 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:17:17,646 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:17:17,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:17:17,649 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:17:17,650 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:17:17,650 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:17:17,651 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:17:17,651 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:17:17,652 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:17:17,653 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:17:17,654 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:17:17,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:17:17,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:17:17,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:17:17,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:17:17,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:17:17,660 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:17:17,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:17:17,661 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:17:17,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:17:17,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:17:17,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:17:17,664 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:17:17,664 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:17:17,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:17:17,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:17:17,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:17:17,665 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:17:17,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:17:17,667 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:17:17,667 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:17:17,667 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:17:17,667 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:17:17,667 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:17:17,668 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:17:17,668 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:17:17,669 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_07cc26c6-0ba8-4bb6-a285-53a5081cba5c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 16:17:17,678 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:17:17,678 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:17:17,679 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:17:17,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:17:17,680 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:17:17,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:17:17,680 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:17:17,680 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:17:17,680 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:17:17,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:17:17,680 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:17:17,681 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:17:17,681 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:17:17,681 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:17:17,681 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:17:17,681 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:17:17,681 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:17:17,681 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:17:17,681 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:17:17,682 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:17:17,682 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:17:17,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:17:17,682 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:17:17,682 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:17:17,682 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:17:17,683 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:17:17,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:17:17,683 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:17:17,683 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:17:17,683 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_07cc26c6-0ba8-4bb6-a285-53a5081cba5c/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 -> 7172975871b065518ca613924da6374ef1c35dee [2019-12-07 16:17:17,794 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:17:17,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:17:17,804 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:17:17,805 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:17:17,805 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:17:17,806 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_07cc26c6-0ba8-4bb6-a285-53a5081cba5c/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix039_power.opt.i [2019-12-07 16:17:17,842 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_07cc26c6-0ba8-4bb6-a285-53a5081cba5c/bin/uautomizer/data/0e319ca5e/f934679558224c13bca388b107450093/FLAGa3bdf49c8 [2019-12-07 16:17:18,309 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:17:18,310 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_07cc26c6-0ba8-4bb6-a285-53a5081cba5c/sv-benchmarks/c/pthread-wmm/mix039_power.opt.i [2019-12-07 16:17:18,320 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_07cc26c6-0ba8-4bb6-a285-53a5081cba5c/bin/uautomizer/data/0e319ca5e/f934679558224c13bca388b107450093/FLAGa3bdf49c8 [2019-12-07 16:17:18,825 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_07cc26c6-0ba8-4bb6-a285-53a5081cba5c/bin/uautomizer/data/0e319ca5e/f934679558224c13bca388b107450093 [2019-12-07 16:17:18,826 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:17:18,827 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:17:18,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:17:18,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:17:18,830 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:17:18,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:17:18" (1/1) ... [2019-12-07 16:17:18,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9dd5335 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:17:18, skipping insertion in model container [2019-12-07 16:17:18,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:17:18" (1/1) ... [2019-12-07 16:17:18,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:17:18,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:17:19,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:17:19,114 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:17:19,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:17:19,205 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:17:19,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:17:19 WrapperNode [2019-12-07 16:17:19,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:17:19,206 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:17:19,206 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:17:19,206 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:17:19,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:17:19" (1/1) ... [2019-12-07 16:17:19,226 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:17:19" (1/1) ... [2019-12-07 16:17:19,245 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:17:19,245 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:17:19,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:17:19,246 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:17:19,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:17:19" (1/1) ... [2019-12-07 16:17:19,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:17:19" (1/1) ... [2019-12-07 16:17:19,256 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:17:19" (1/1) ... [2019-12-07 16:17:19,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:17:19" (1/1) ... [2019-12-07 16:17:19,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:17:19" (1/1) ... [2019-12-07 16:17:19,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:17:19" (1/1) ... [2019-12-07 16:17:19,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:17:19" (1/1) ... [2019-12-07 16:17:19,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:17:19,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:17:19,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:17:19,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:17:19,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:17:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_07cc26c6-0ba8-4bb6-a285-53a5081cba5c/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 16:17:19,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 16:17:19,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 16:17:19,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:17:19,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:17:19,314 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 16:17:19,314 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 16:17:19,314 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 16:17:19,314 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 16:17:19,314 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 16:17:19,314 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 16:17:19,314 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 16:17:19,315 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 16:17:19,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 16:17:19,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:17:19,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:17:19,316 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 16:17:19,653 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:17:19,653 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 16:17:19,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:17:19 BoogieIcfgContainer [2019-12-07 16:17:19,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:17:19,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:17:19,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:17:19,656 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:17:19,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:17:18" (1/3) ... [2019-12-07 16:17:19,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@177fd80f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:17:19, skipping insertion in model container [2019-12-07 16:17:19,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:17:19" (2/3) ... [2019-12-07 16:17:19,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@177fd80f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:17:19, skipping insertion in model container [2019-12-07 16:17:19,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:17:19" (3/3) ... [2019-12-07 16:17:19,659 INFO L109 eAbstractionObserver]: Analyzing ICFG mix039_power.opt.i [2019-12-07 16:17:19,665 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 16:17:19,665 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:17:19,670 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 16:17:19,670 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 16:17:19,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,694 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,694 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,695 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,695 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,696 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,697 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,707 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,707 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,707 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,707 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,707 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,707 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,708 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,708 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,708 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,708 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,708 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,708 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,708 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,708 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,709 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,709 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,709 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,709 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,709 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,709 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,709 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,709 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,709 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,709 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,710 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,710 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,710 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,710 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,710 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,710 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,710 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,710 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,710 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,710 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:17:19,722 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 16:17:19,734 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:17:19,735 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:17:19,735 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:17:19,735 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:17:19,735 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:17:19,735 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:17:19,735 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:17:19,735 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:17:19,746 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-07 16:17:19,747 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-07 16:17:19,799 INFO L134 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-07 16:17:19,799 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:17:19,807 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 575 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 16:17:19,820 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-07 16:17:19,846 INFO L134 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-07 16:17:19,846 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:17:19,850 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 575 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 16:17:19,861 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-07 16:17:19,862 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 16:17:22,698 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 16:17:22,948 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 16:17:23,049 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44168 [2019-12-07 16:17:23,049 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-07 16:17:23,052 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 78 transitions [2019-12-07 16:17:24,011 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 21398 states. [2019-12-07 16:17:24,013 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states. [2019-12-07 16:17:24,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 16:17:24,017 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:24,018 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:24,018 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:24,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:24,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1244651740, now seen corresponding path program 1 times [2019-12-07 16:17:24,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:24,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700483612] [2019-12-07 16:17:24,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:24,176 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 16:17:24,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700483612] [2019-12-07 16:17:24,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:24,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:17:24,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987394299] [2019-12-07 16:17:24,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:17:24,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:24,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:17:24,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:17:24,192 INFO L87 Difference]: Start difference. First operand 21398 states. Second operand 3 states. [2019-12-07 16:17:24,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:24,441 INFO L93 Difference]: Finished difference Result 20958 states and 90416 transitions. [2019-12-07 16:17:24,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:17:24,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 16:17:24,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:24,583 INFO L225 Difference]: With dead ends: 20958 [2019-12-07 16:17:24,583 INFO L226 Difference]: Without dead ends: 19662 [2019-12-07 16:17:24,584 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 16:17:24,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-07 16:17:25,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 19662. [2019-12-07 16:17:25,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-12-07 16:17:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 84692 transitions. [2019-12-07 16:17:25,291 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 84692 transitions. Word has length 9 [2019-12-07 16:17:25,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:25,292 INFO L462 AbstractCegarLoop]: Abstraction has 19662 states and 84692 transitions. [2019-12-07 16:17:25,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:17:25,292 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 84692 transitions. [2019-12-07 16:17:25,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 16:17:25,297 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:25,297 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:25,297 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:25,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:25,297 INFO L82 PathProgramCache]: Analyzing trace with hash -6792795, now seen corresponding path program 1 times [2019-12-07 16:17:25,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:25,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749226299] [2019-12-07 16:17:25,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:25,355 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 16:17:25,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749226299] [2019-12-07 16:17:25,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:25,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:17:25,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848046396] [2019-12-07 16:17:25,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:17:25,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:25,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:17:25,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:17:25,357 INFO L87 Difference]: Start difference. First operand 19662 states and 84692 transitions. Second operand 4 states. [2019-12-07 16:17:25,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:25,676 INFO L93 Difference]: Finished difference Result 30494 states and 126452 transitions. [2019-12-07 16:17:25,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:17:25,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 16:17:25,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:25,852 INFO L225 Difference]: With dead ends: 30494 [2019-12-07 16:17:25,852 INFO L226 Difference]: Without dead ends: 30438 [2019-12-07 16:17:25,853 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 16:17:25,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30438 states. [2019-12-07 16:17:26,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30438 to 27742. [2019-12-07 16:17:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-12-07 16:17:26,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 116300 transitions. [2019-12-07 16:17:26,470 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 116300 transitions. Word has length 15 [2019-12-07 16:17:26,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:26,470 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 116300 transitions. [2019-12-07 16:17:26,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:17:26,471 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 116300 transitions. [2019-12-07 16:17:26,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:17:26,475 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:26,475 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:26,476 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:26,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:26,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1479332799, now seen corresponding path program 1 times [2019-12-07 16:17:26,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:26,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583676842] [2019-12-07 16:17:26,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:26,530 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 16:17:26,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583676842] [2019-12-07 16:17:26,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:26,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:17:26,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358698690] [2019-12-07 16:17:26,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:17:26,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:26,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:17:26,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:17:26,532 INFO L87 Difference]: Start difference. First operand 27742 states and 116300 transitions. Second operand 4 states. [2019-12-07 16:17:26,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:26,891 INFO L93 Difference]: Finished difference Result 35230 states and 146308 transitions. [2019-12-07 16:17:26,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:17:26,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 16:17:26,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:26,961 INFO L225 Difference]: With dead ends: 35230 [2019-12-07 16:17:26,961 INFO L226 Difference]: Without dead ends: 35182 [2019-12-07 16:17:26,961 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 16:17:27,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-12-07 16:17:27,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 30378. [2019-12-07 16:17:27,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30378 states. [2019-12-07 16:17:27,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30378 states to 30378 states and 127172 transitions. [2019-12-07 16:17:27,714 INFO L78 Accepts]: Start accepts. Automaton has 30378 states and 127172 transitions. Word has length 18 [2019-12-07 16:17:27,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:27,714 INFO L462 AbstractCegarLoop]: Abstraction has 30378 states and 127172 transitions. [2019-12-07 16:17:27,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:17:27,715 INFO L276 IsEmpty]: Start isEmpty. Operand 30378 states and 127172 transitions. [2019-12-07 16:17:27,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 16:17:27,722 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:27,722 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:27,722 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:27,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:27,722 INFO L82 PathProgramCache]: Analyzing trace with hash -45820751, now seen corresponding path program 1 times [2019-12-07 16:17:27,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:27,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597840119] [2019-12-07 16:17:27,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:27,768 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 16:17:27,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597840119] [2019-12-07 16:17:27,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:27,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:17:27,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429324477] [2019-12-07 16:17:27,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:17:27,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:27,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:17:27,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:17:27,770 INFO L87 Difference]: Start difference. First operand 30378 states and 127172 transitions. Second operand 3 states. [2019-12-07 16:17:27,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:27,884 INFO L93 Difference]: Finished difference Result 30378 states and 125828 transitions. [2019-12-07 16:17:27,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:17:27,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 16:17:27,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:27,948 INFO L225 Difference]: With dead ends: 30378 [2019-12-07 16:17:27,948 INFO L226 Difference]: Without dead ends: 30378 [2019-12-07 16:17:27,948 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 16:17:28,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30378 states. [2019-12-07 16:17:28,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30378 to 29978. [2019-12-07 16:17:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29978 states. [2019-12-07 16:17:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29978 states to 29978 states and 124268 transitions. [2019-12-07 16:17:28,500 INFO L78 Accepts]: Start accepts. Automaton has 29978 states and 124268 transitions. Word has length 20 [2019-12-07 16:17:28,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:28,501 INFO L462 AbstractCegarLoop]: Abstraction has 29978 states and 124268 transitions. [2019-12-07 16:17:28,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:17:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 29978 states and 124268 transitions. [2019-12-07 16:17:28,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 16:17:28,506 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:28,506 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:28,506 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:28,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:28,507 INFO L82 PathProgramCache]: Analyzing trace with hash -405590648, now seen corresponding path program 1 times [2019-12-07 16:17:28,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:28,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865491010] [2019-12-07 16:17:28,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:28,572 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 16:17:28,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865491010] [2019-12-07 16:17:28,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:28,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:17:28,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755377651] [2019-12-07 16:17:28,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:17:28,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:28,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:17:28,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:17:28,573 INFO L87 Difference]: Start difference. First operand 29978 states and 124268 transitions. Second operand 3 states. [2019-12-07 16:17:28,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:28,851 INFO L93 Difference]: Finished difference Result 44992 states and 177703 transitions. [2019-12-07 16:17:28,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:17:28,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 16:17:28,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:28,938 INFO L225 Difference]: With dead ends: 44992 [2019-12-07 16:17:28,938 INFO L226 Difference]: Without dead ends: 44408 [2019-12-07 16:17:28,938 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 16:17:29,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44408 states. [2019-12-07 16:17:29,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44408 to 43003. [2019-12-07 16:17:29,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43003 states. [2019-12-07 16:17:29,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43003 states to 43003 states and 171628 transitions. [2019-12-07 16:17:29,869 INFO L78 Accepts]: Start accepts. Automaton has 43003 states and 171628 transitions. Word has length 20 [2019-12-07 16:17:29,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:29,870 INFO L462 AbstractCegarLoop]: Abstraction has 43003 states and 171628 transitions. [2019-12-07 16:17:29,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:17:29,870 INFO L276 IsEmpty]: Start isEmpty. Operand 43003 states and 171628 transitions. [2019-12-07 16:17:29,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 16:17:29,877 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:29,877 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:29,877 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:29,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:29,878 INFO L82 PathProgramCache]: Analyzing trace with hash -488858070, now seen corresponding path program 1 times [2019-12-07 16:17:29,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:29,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65519011] [2019-12-07 16:17:29,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:29,931 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 16:17:29,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65519011] [2019-12-07 16:17:29,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:29,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:17:29,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56909400] [2019-12-07 16:17:29,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:17:29,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:29,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:17:29,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:17:29,933 INFO L87 Difference]: Start difference. First operand 43003 states and 171628 transitions. Second operand 4 states. [2019-12-07 16:17:30,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:30,115 INFO L93 Difference]: Finished difference Result 44313 states and 175087 transitions. [2019-12-07 16:17:30,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:17:30,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 16:17:30,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:30,198 INFO L225 Difference]: With dead ends: 44313 [2019-12-07 16:17:30,198 INFO L226 Difference]: Without dead ends: 44313 [2019-12-07 16:17:30,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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 16:17:30,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44313 states. [2019-12-07 16:17:30,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44313 to 42956. [2019-12-07 16:17:30,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42956 states. [2019-12-07 16:17:31,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42956 states to 42956 states and 171420 transitions. [2019-12-07 16:17:31,231 INFO L78 Accepts]: Start accepts. Automaton has 42956 states and 171420 transitions. Word has length 21 [2019-12-07 16:17:31,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:31,232 INFO L462 AbstractCegarLoop]: Abstraction has 42956 states and 171420 transitions. [2019-12-07 16:17:31,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:17:31,232 INFO L276 IsEmpty]: Start isEmpty. Operand 42956 states and 171420 transitions. [2019-12-07 16:17:31,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 16:17:31,241 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:31,241 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:31,241 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:31,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:31,241 INFO L82 PathProgramCache]: Analyzing trace with hash 772105574, now seen corresponding path program 1 times [2019-12-07 16:17:31,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:31,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571424041] [2019-12-07 16:17:31,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:31,281 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 16:17:31,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571424041] [2019-12-07 16:17:31,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:31,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:17:31,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712283927] [2019-12-07 16:17:31,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:17:31,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:31,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:17:31,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:17:31,282 INFO L87 Difference]: Start difference. First operand 42956 states and 171420 transitions. Second operand 3 states. [2019-12-07 16:17:31,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:31,429 INFO L93 Difference]: Finished difference Result 42545 states and 169687 transitions. [2019-12-07 16:17:31,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:17:31,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 16:17:31,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:31,515 INFO L225 Difference]: With dead ends: 42545 [2019-12-07 16:17:31,515 INFO L226 Difference]: Without dead ends: 42545 [2019-12-07 16:17:31,516 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 16:17:31,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42545 states. [2019-12-07 16:17:32,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42545 to 40428. [2019-12-07 16:17:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40428 states. [2019-12-07 16:17:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40428 states to 40428 states and 162045 transitions. [2019-12-07 16:17:32,225 INFO L78 Accepts]: Start accepts. Automaton has 40428 states and 162045 transitions. Word has length 21 [2019-12-07 16:17:32,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:32,225 INFO L462 AbstractCegarLoop]: Abstraction has 40428 states and 162045 transitions. [2019-12-07 16:17:32,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:17:32,225 INFO L276 IsEmpty]: Start isEmpty. Operand 40428 states and 162045 transitions. [2019-12-07 16:17:32,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 16:17:32,237 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:32,237 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:32,237 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:32,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:32,238 INFO L82 PathProgramCache]: Analyzing trace with hash -9241093, now seen corresponding path program 1 times [2019-12-07 16:17:32,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:32,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372219321] [2019-12-07 16:17:32,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:32,273 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 16:17:32,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372219321] [2019-12-07 16:17:32,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:32,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:17:32,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759328745] [2019-12-07 16:17:32,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:17:32,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:32,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:17:32,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:17:32,275 INFO L87 Difference]: Start difference. First operand 40428 states and 162045 transitions. Second operand 3 states. [2019-12-07 16:17:32,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:32,582 INFO L93 Difference]: Finished difference Result 54626 states and 212950 transitions. [2019-12-07 16:17:32,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:17:32,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 16:17:32,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:32,642 INFO L225 Difference]: With dead ends: 54626 [2019-12-07 16:17:32,642 INFO L226 Difference]: Without dead ends: 31702 [2019-12-07 16:17:32,643 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 16:17:32,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31702 states. [2019-12-07 16:17:33,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31702 to 30036. [2019-12-07 16:17:33,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30036 states. [2019-12-07 16:17:33,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30036 states to 30036 states and 111391 transitions. [2019-12-07 16:17:33,163 INFO L78 Accepts]: Start accepts. Automaton has 30036 states and 111391 transitions. Word has length 23 [2019-12-07 16:17:33,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:33,164 INFO L462 AbstractCegarLoop]: Abstraction has 30036 states and 111391 transitions. [2019-12-07 16:17:33,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:17:33,164 INFO L276 IsEmpty]: Start isEmpty. Operand 30036 states and 111391 transitions. [2019-12-07 16:17:33,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 16:17:33,174 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:33,174 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:33,174 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:33,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:33,174 INFO L82 PathProgramCache]: Analyzing trace with hash -428330177, now seen corresponding path program 1 times [2019-12-07 16:17:33,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:33,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440185708] [2019-12-07 16:17:33,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:33,221 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 16:17:33,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440185708] [2019-12-07 16:17:33,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:33,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:17:33,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262915293] [2019-12-07 16:17:33,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:17:33,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:33,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:17:33,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:17:33,223 INFO L87 Difference]: Start difference. First operand 30036 states and 111391 transitions. Second operand 4 states. [2019-12-07 16:17:33,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:33,317 INFO L93 Difference]: Finished difference Result 25667 states and 89340 transitions. [2019-12-07 16:17:33,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:17:33,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-07 16:17:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:33,352 INFO L225 Difference]: With dead ends: 25667 [2019-12-07 16:17:33,353 INFO L226 Difference]: Without dead ends: 23877 [2019-12-07 16:17:33,353 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 16:17:33,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23877 states. [2019-12-07 16:17:33,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23877 to 23877. [2019-12-07 16:17:33,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23877 states. [2019-12-07 16:17:33,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23877 states to 23877 states and 83947 transitions. [2019-12-07 16:17:33,710 INFO L78 Accepts]: Start accepts. Automaton has 23877 states and 83947 transitions. Word has length 23 [2019-12-07 16:17:33,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:33,710 INFO L462 AbstractCegarLoop]: Abstraction has 23877 states and 83947 transitions. [2019-12-07 16:17:33,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:17:33,710 INFO L276 IsEmpty]: Start isEmpty. Operand 23877 states and 83947 transitions. [2019-12-07 16:17:33,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:17:33,718 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:33,718 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:33,718 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:33,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:33,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1442998109, now seen corresponding path program 1 times [2019-12-07 16:17:33,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:33,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307116533] [2019-12-07 16:17:33,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:33,763 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 16:17:33,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307116533] [2019-12-07 16:17:33,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:33,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:17:33,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641842563] [2019-12-07 16:17:33,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:17:33,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:33,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:17:33,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:17:33,764 INFO L87 Difference]: Start difference. First operand 23877 states and 83947 transitions. Second operand 4 states. [2019-12-07 16:17:33,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:33,902 INFO L93 Difference]: Finished difference Result 36552 states and 123353 transitions. [2019-12-07 16:17:33,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:17:33,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-07 16:17:33,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:33,957 INFO L225 Difference]: With dead ends: 36552 [2019-12-07 16:17:33,957 INFO L226 Difference]: Without dead ends: 35120 [2019-12-07 16:17:33,958 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 16:17:34,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35120 states. [2019-12-07 16:17:34,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35120 to 33384. [2019-12-07 16:17:34,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33384 states. [2019-12-07 16:17:34,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33384 states to 33384 states and 114074 transitions. [2019-12-07 16:17:34,495 INFO L78 Accepts]: Start accepts. Automaton has 33384 states and 114074 transitions. Word has length 24 [2019-12-07 16:17:34,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:34,495 INFO L462 AbstractCegarLoop]: Abstraction has 33384 states and 114074 transitions. [2019-12-07 16:17:34,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:17:34,496 INFO L276 IsEmpty]: Start isEmpty. Operand 33384 states and 114074 transitions. [2019-12-07 16:17:34,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:17:34,573 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:34,573 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:34,574 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:34,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:34,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1994611331, now seen corresponding path program 2 times [2019-12-07 16:17:34,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:34,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139874028] [2019-12-07 16:17:34,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:34,618 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 16:17:34,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139874028] [2019-12-07 16:17:34,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:34,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:17:34,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695132261] [2019-12-07 16:17:34,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:17:34,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:34,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:17:34,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:17:34,620 INFO L87 Difference]: Start difference. First operand 33384 states and 114074 transitions. Second operand 5 states. [2019-12-07 16:17:34,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:34,693 INFO L93 Difference]: Finished difference Result 17968 states and 55454 transitions. [2019-12-07 16:17:34,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:17:34,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 16:17:34,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:34,712 INFO L225 Difference]: With dead ends: 17968 [2019-12-07 16:17:34,712 INFO L226 Difference]: Without dead ends: 15934 [2019-12-07 16:17:34,712 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 16:17:34,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15934 states. [2019-12-07 16:17:34,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15934 to 15934. [2019-12-07 16:17:34,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15934 states. [2019-12-07 16:17:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15934 states to 15934 states and 49193 transitions. [2019-12-07 16:17:34,913 INFO L78 Accepts]: Start accepts. Automaton has 15934 states and 49193 transitions. Word has length 24 [2019-12-07 16:17:34,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:34,913 INFO L462 AbstractCegarLoop]: Abstraction has 15934 states and 49193 transitions. [2019-12-07 16:17:34,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:17:34,914 INFO L276 IsEmpty]: Start isEmpty. Operand 15934 states and 49193 transitions. [2019-12-07 16:17:34,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 16:17:34,919 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:34,919 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:34,919 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:34,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:34,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1872797991, now seen corresponding path program 1 times [2019-12-07 16:17:34,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:34,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475512514] [2019-12-07 16:17:34,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:34,969 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 16:17:34,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475512514] [2019-12-07 16:17:34,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:34,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:17:34,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113363918] [2019-12-07 16:17:34,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:17:34,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:34,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:17:34,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:17:34,971 INFO L87 Difference]: Start difference. First operand 15934 states and 49193 transitions. Second operand 6 states. [2019-12-07 16:17:35,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:35,036 INFO L93 Difference]: Finished difference Result 4632 states and 12543 transitions. [2019-12-07 16:17:35,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:17:35,037 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 16:17:35,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:35,041 INFO L225 Difference]: With dead ends: 4632 [2019-12-07 16:17:35,041 INFO L226 Difference]: Without dead ends: 3714 [2019-12-07 16:17:35,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:17:35,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3714 states. [2019-12-07 16:17:35,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3714 to 3394. [2019-12-07 16:17:35,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3394 states. [2019-12-07 16:17:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 3394 states and 8931 transitions. [2019-12-07 16:17:35,076 INFO L78 Accepts]: Start accepts. Automaton has 3394 states and 8931 transitions. Word has length 25 [2019-12-07 16:17:35,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:35,076 INFO L462 AbstractCegarLoop]: Abstraction has 3394 states and 8931 transitions. [2019-12-07 16:17:35,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:17:35,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3394 states and 8931 transitions. [2019-12-07 16:17:35,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 16:17:35,079 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:35,079 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:35,079 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:35,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:35,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1619810495, now seen corresponding path program 1 times [2019-12-07 16:17:35,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:35,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474695187] [2019-12-07 16:17:35,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:35,100 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 16:17:35,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474695187] [2019-12-07 16:17:35,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:35,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:17:35,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644656277] [2019-12-07 16:17:35,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:17:35,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:35,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:17:35,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:17:35,101 INFO L87 Difference]: Start difference. First operand 3394 states and 8931 transitions. Second operand 3 states. [2019-12-07 16:17:35,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:35,137 INFO L93 Difference]: Finished difference Result 5011 states and 13158 transitions. [2019-12-07 16:17:35,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:17:35,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 16:17:35,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:35,142 INFO L225 Difference]: With dead ends: 5011 [2019-12-07 16:17:35,142 INFO L226 Difference]: Without dead ends: 5011 [2019-12-07 16:17:35,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:17:35,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5011 states. [2019-12-07 16:17:35,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5011 to 4068. [2019-12-07 16:17:35,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4068 states. [2019-12-07 16:17:35,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4068 states to 4068 states and 10807 transitions. [2019-12-07 16:17:35,187 INFO L78 Accepts]: Start accepts. Automaton has 4068 states and 10807 transitions. Word has length 32 [2019-12-07 16:17:35,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:35,188 INFO L462 AbstractCegarLoop]: Abstraction has 4068 states and 10807 transitions. [2019-12-07 16:17:35,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:17:35,188 INFO L276 IsEmpty]: Start isEmpty. Operand 4068 states and 10807 transitions. [2019-12-07 16:17:35,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 16:17:35,191 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:35,191 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:35,191 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:35,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:35,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1082300219, now seen corresponding path program 1 times [2019-12-07 16:17:35,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:35,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375120163] [2019-12-07 16:17:35,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:35,241 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 16:17:35,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375120163] [2019-12-07 16:17:35,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:35,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:17:35,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315604455] [2019-12-07 16:17:35,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:17:35,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:35,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:17:35,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:17:35,243 INFO L87 Difference]: Start difference. First operand 4068 states and 10807 transitions. Second operand 6 states. [2019-12-07 16:17:35,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:35,529 INFO L93 Difference]: Finished difference Result 8090 states and 20627 transitions. [2019-12-07 16:17:35,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:17:35,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-07 16:17:35,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:35,536 INFO L225 Difference]: With dead ends: 8090 [2019-12-07 16:17:35,536 INFO L226 Difference]: Without dead ends: 7928 [2019-12-07 16:17:35,536 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:17:35,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7928 states. [2019-12-07 16:17:35,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7928 to 4227. [2019-12-07 16:17:35,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4227 states. [2019-12-07 16:17:35,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4227 states to 4227 states and 11144 transitions. [2019-12-07 16:17:35,589 INFO L78 Accepts]: Start accepts. Automaton has 4227 states and 11144 transitions. Word has length 32 [2019-12-07 16:17:35,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:35,589 INFO L462 AbstractCegarLoop]: Abstraction has 4227 states and 11144 transitions. [2019-12-07 16:17:35,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:17:35,589 INFO L276 IsEmpty]: Start isEmpty. Operand 4227 states and 11144 transitions. [2019-12-07 16:17:35,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 16:17:35,592 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:35,593 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:35,593 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:35,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:35,593 INFO L82 PathProgramCache]: Analyzing trace with hash -345264620, now seen corresponding path program 1 times [2019-12-07 16:17:35,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:35,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423626737] [2019-12-07 16:17:35,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:35,640 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 16:17:35,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423626737] [2019-12-07 16:17:35,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:35,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:17:35,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502971324] [2019-12-07 16:17:35,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:17:35,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:35,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:17:35,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:17:35,642 INFO L87 Difference]: Start difference. First operand 4227 states and 11144 transitions. Second operand 6 states. [2019-12-07 16:17:35,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:35,922 INFO L93 Difference]: Finished difference Result 7611 states and 19211 transitions. [2019-12-07 16:17:35,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:17:35,922 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 16:17:35,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:35,928 INFO L225 Difference]: With dead ends: 7611 [2019-12-07 16:17:35,928 INFO L226 Difference]: Without dead ends: 7467 [2019-12-07 16:17:35,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:17:35,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2019-12-07 16:17:35,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 4029. [2019-12-07 16:17:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4029 states. [2019-12-07 16:17:35,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4029 states to 4029 states and 10642 transitions. [2019-12-07 16:17:35,978 INFO L78 Accepts]: Start accepts. Automaton has 4029 states and 10642 transitions. Word has length 33 [2019-12-07 16:17:35,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:35,979 INFO L462 AbstractCegarLoop]: Abstraction has 4029 states and 10642 transitions. [2019-12-07 16:17:35,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:17:35,979 INFO L276 IsEmpty]: Start isEmpty. Operand 4029 states and 10642 transitions. [2019-12-07 16:17:35,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 16:17:35,982 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:35,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] [2019-12-07 16:17:35,983 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:35,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:35,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1438942525, now seen corresponding path program 1 times [2019-12-07 16:17:35,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:35,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284409567] [2019-12-07 16:17:35,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:36,044 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 16:17:36,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284409567] [2019-12-07 16:17:36,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:36,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:17:36,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636778773] [2019-12-07 16:17:36,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:17:36,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:36,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:17:36,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:17:36,045 INFO L87 Difference]: Start difference. First operand 4029 states and 10642 transitions. Second operand 5 states. [2019-12-07 16:17:36,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:36,086 INFO L93 Difference]: Finished difference Result 5648 states and 14486 transitions. [2019-12-07 16:17:36,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:17:36,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 16:17:36,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:36,089 INFO L225 Difference]: With dead ends: 5648 [2019-12-07 16:17:36,090 INFO L226 Difference]: Without dead ends: 3018 [2019-12-07 16:17:36,090 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 16:17:36,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2019-12-07 16:17:36,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 2983. [2019-12-07 16:17:36,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2983 states. [2019-12-07 16:17:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 7988 transitions. [2019-12-07 16:17:36,119 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 7988 transitions. Word has length 34 [2019-12-07 16:17:36,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:36,119 INFO L462 AbstractCegarLoop]: Abstraction has 2983 states and 7988 transitions. [2019-12-07 16:17:36,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:17:36,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 7988 transitions. [2019-12-07 16:17:36,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 16:17:36,122 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:36,122 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:36,122 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:36,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:36,122 INFO L82 PathProgramCache]: Analyzing trace with hash -734472007, now seen corresponding path program 2 times [2019-12-07 16:17:36,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:36,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763976045] [2019-12-07 16:17:36,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:36,149 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 16:17:36,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763976045] [2019-12-07 16:17:36,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:36,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:17:36,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521159614] [2019-12-07 16:17:36,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:17:36,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:36,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:17:36,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:17:36,150 INFO L87 Difference]: Start difference. First operand 2983 states and 7988 transitions. Second operand 4 states. [2019-12-07 16:17:36,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:36,169 INFO L93 Difference]: Finished difference Result 4067 states and 10590 transitions. [2019-12-07 16:17:36,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:17:36,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-07 16:17:36,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:36,172 INFO L225 Difference]: With dead ends: 4067 [2019-12-07 16:17:36,172 INFO L226 Difference]: Without dead ends: 2857 [2019-12-07 16:17:36,172 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 16:17:36,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2019-12-07 16:17:36,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2837. [2019-12-07 16:17:36,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2837 states. [2019-12-07 16:17:36,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2837 states to 2837 states and 7139 transitions. [2019-12-07 16:17:36,199 INFO L78 Accepts]: Start accepts. Automaton has 2837 states and 7139 transitions. Word has length 34 [2019-12-07 16:17:36,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:36,199 INFO L462 AbstractCegarLoop]: Abstraction has 2837 states and 7139 transitions. [2019-12-07 16:17:36,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:17:36,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2837 states and 7139 transitions. [2019-12-07 16:17:36,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 16:17:36,202 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:36,202 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] [2019-12-07 16:17:36,202 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:36,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:36,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1104473775, now seen corresponding path program 3 times [2019-12-07 16:17:36,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:36,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866882545] [2019-12-07 16:17:36,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:36,252 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 16:17:36,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866882545] [2019-12-07 16:17:36,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:36,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:17:36,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081415739] [2019-12-07 16:17:36,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:17:36,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:36,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:17:36,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:17:36,253 INFO L87 Difference]: Start difference. First operand 2837 states and 7139 transitions. Second operand 7 states. [2019-12-07 16:17:36,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:36,317 INFO L93 Difference]: Finished difference Result 2153 states and 5477 transitions. [2019-12-07 16:17:36,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:17:36,318 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-07 16:17:36,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:36,318 INFO L225 Difference]: With dead ends: 2153 [2019-12-07 16:17:36,318 INFO L226 Difference]: Without dead ends: 476 [2019-12-07 16:17:36,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:17:36,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-12-07 16:17:36,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 470. [2019-12-07 16:17:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-12-07 16:17:36,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1059 transitions. [2019-12-07 16:17:36,322 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1059 transitions. Word has length 34 [2019-12-07 16:17:36,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:36,323 INFO L462 AbstractCegarLoop]: Abstraction has 470 states and 1059 transitions. [2019-12-07 16:17:36,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:17:36,323 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1059 transitions. [2019-12-07 16:17:36,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 16:17:36,323 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:36,323 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:36,324 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:36,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:36,324 INFO L82 PathProgramCache]: Analyzing trace with hash -126758993, now seen corresponding path program 1 times [2019-12-07 16:17:36,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:36,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724383743] [2019-12-07 16:17:36,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:36,390 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 16:17:36,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724383743] [2019-12-07 16:17:36,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:36,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:17:36,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577846157] [2019-12-07 16:17:36,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:17:36,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:36,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:17:36,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:17:36,391 INFO L87 Difference]: Start difference. First operand 470 states and 1059 transitions. Second operand 7 states. [2019-12-07 16:17:36,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:36,536 INFO L93 Difference]: Finished difference Result 892 states and 1966 transitions. [2019-12-07 16:17:36,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 16:17:36,536 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-07 16:17:36,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:36,537 INFO L225 Difference]: With dead ends: 892 [2019-12-07 16:17:36,537 INFO L226 Difference]: Without dead ends: 594 [2019-12-07 16:17:36,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 16:17:36,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-12-07 16:17:36,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 536. [2019-12-07 16:17:36,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-07 16:17:36,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1171 transitions. [2019-12-07 16:17:36,542 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1171 transitions. Word has length 48 [2019-12-07 16:17:36,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:36,542 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1171 transitions. [2019-12-07 16:17:36,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:17:36,542 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1171 transitions. [2019-12-07 16:17:36,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 16:17:36,543 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:36,543 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:36,543 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:36,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:36,543 INFO L82 PathProgramCache]: Analyzing trace with hash 24927743, now seen corresponding path program 2 times [2019-12-07 16:17:36,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:36,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737480737] [2019-12-07 16:17:36,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:17:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:17:36,610 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:17:36,610 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:17:36,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_119| 0 0))) (and (= v_~z~0_122 0) (= v_~z$w_buff0_used~0_514 0) (= v_~z$mem_tmp~0_32 0) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_50 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~__unbuffered_p3_EBX~0_94) (= |v_#valid_117| (store .cse0 |v_ULTIMATE.start_main_~#t1029~0.base_71| 1)) (= 0 v_~__unbuffered_p3_EAX~0_93) (= 0 v_~weak$$choice0~0_26) (< 0 |v_#StackHeapBarrier_19|) (= 0 |v_ULTIMATE.start_main_~#t1029~0.offset_43|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= v_~z$w_buff0~0_183 0) (= 0 v_~z$r_buff1_thd3~0_197) (= 0 v_~z$flush_delayed~0_53) (= 0 v_~z$r_buff1_thd1~0_59) (= (select .cse0 |v_ULTIMATE.start_main_~#t1029~0.base_71|) 0) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd0~0_138 0) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1029~0.base_71|) (= v_~z$r_buff0_thd2~0_57 0) (= v_~z$read_delayed~0_7 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1029~0.base_71| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1029~0.base_71|) |v_ULTIMATE.start_main_~#t1029~0.offset_43| 0)) |v_#memory_int_27|) (= |v_#NULL.offset_5| 0) (= v_~weak$$choice2~0_111 0) (= 0 v_~z$r_buff0_thd3~0_266) (= v_~x~0_36 0) (= v_~y~0_68 0) (= v_~z$w_buff1_used~0_298 0) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~z$w_buff1~0_123 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1029~0.base_71| 4)) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0) (= 0 v_~__unbuffered_p2_EAX~0_55))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_119|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t1030~0.offset=|v_ULTIMATE.start_main_~#t1030~0.offset_41|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ULTIMATE.start_main_~#t1029~0.base=|v_ULTIMATE.start_main_~#t1029~0.base_71|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_~#t1032~0.base=|v_ULTIMATE.start_main_~#t1032~0.base_36|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_93, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ~z$mem_tmp~0=v_~z$mem_tmp~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_36, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_138, ~y~0=v_~y~0_68, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_197, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_94, ULTIMATE.start_main_~#t1032~0.offset=|v_ULTIMATE.start_main_~#t1032~0.offset_24|, ULTIMATE.start_main_~#t1030~0.base=|v_ULTIMATE.start_main_~#t1030~0.base_68|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t1031~0.offset=|v_ULTIMATE.start_main_~#t1031~0.offset_25|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_103|, ULTIMATE.start_main_~#t1031~0.base=|v_ULTIMATE.start_main_~#t1031~0.base_36|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_44|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_122, ULTIMATE.start_main_~#t1029~0.offset=|v_ULTIMATE.start_main_~#t1029~0.offset_43|, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1030~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1029~0.base, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1032~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t1032~0.offset, ULTIMATE.start_main_~#t1030~0.base, #NULL.base, ULTIMATE.start_main_~#t1031~0.offset, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1031~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t1029~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 16:17:36,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1030~0.base_11| 0)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1030~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1030~0.offset_10| 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1030~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1030~0.base_11|) |v_ULTIMATE.start_main_~#t1030~0.offset_10| 1)) |v_#memory_int_19|) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1030~0.base_11| 1) |v_#valid_48|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1030~0.base_11|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1030~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1030~0.offset=|v_ULTIMATE.start_main_~#t1030~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1030~0.base=|v_ULTIMATE.start_main_~#t1030~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1030~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1030~0.base] because there is no mapped edge [2019-12-07 16:17:36,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1031~0.base_12| 1)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1031~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t1031~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t1031~0.offset_11| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1031~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1031~0.base_12|) |v_ULTIMATE.start_main_~#t1031~0.offset_11| 2)) |v_#memory_int_17|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1031~0.base_12| 4) |v_#length_21|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1031~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1031~0.offset=|v_ULTIMATE.start_main_~#t1031~0.offset_11|, ULTIMATE.start_main_~#t1031~0.base=|v_ULTIMATE.start_main_~#t1031~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1031~0.offset, ULTIMATE.start_main_~#t1031~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 16:17:36,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1032~0.base_12|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1032~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1032~0.base_12|) |v_ULTIMATE.start_main_~#t1032~0.offset_10| 3)) |v_#memory_int_15|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1032~0.base_12| 4)) (= |v_ULTIMATE.start_main_~#t1032~0.offset_10| 0) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1032~0.base_12|)) (= (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1032~0.base_12| 1) |v_#valid_42|) (not (= 0 |v_ULTIMATE.start_main_~#t1032~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1032~0.base=|v_ULTIMATE.start_main_~#t1032~0.base_12|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1032~0.offset=|v_ULTIMATE.start_main_~#t1032~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1032~0.base, #length, ULTIMATE.start_main_~#t1032~0.offset] because there is no mapped edge [2019-12-07 16:17:36,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~a~0_Out-1727431310 ~__unbuffered_p3_EAX~0_Out-1727431310) (= ~z$r_buff1_thd2~0_Out-1727431310 ~z$r_buff0_thd2~0_In-1727431310) (= ~__unbuffered_p3_EBX~0_Out-1727431310 ~b~0_In-1727431310) (= ~z$r_buff0_thd0~0_In-1727431310 ~z$r_buff1_thd0~0_Out-1727431310) (= ~z$r_buff0_thd4~0_Out-1727431310 1) (= ~z$r_buff0_thd3~0_In-1727431310 ~z$r_buff1_thd3~0_Out-1727431310) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1727431310)) (= ~z$r_buff1_thd1~0_Out-1727431310 ~z$r_buff0_thd1~0_In-1727431310) (= ~z$r_buff1_thd4~0_Out-1727431310 ~z$r_buff0_thd4~0_In-1727431310) (= 1 ~a~0_Out-1727431310)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1727431310, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1727431310, ~b~0=~b~0_In-1727431310, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1727431310, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1727431310, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1727431310, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1727431310} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1727431310, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-1727431310, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1727431310, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1727431310, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-1727431310, ~a~0=~a~0_Out-1727431310, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1727431310, ~b~0=~b~0_In-1727431310, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1727431310, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1727431310, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-1727431310, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1727431310, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1727431310, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1727431310, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1727431310} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-07 16:17:36,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_20 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~x~0_30 v_~__unbuffered_p0_EAX~0_26) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_20) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~b~0_48 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_20, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_20, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 16:17:36,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg.base_11| v_P1Thread1of1ForFork0_~arg.base_9) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x~0_19 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~y~0_18 1) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_9)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_18, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 16:17:36,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In884193228 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite9_Out884193228| |P2Thread1of1ForFork1_#t~ite8_Out884193228|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In884193228 256)))) (or (and (= (mod ~z$w_buff1_used~0_In884193228 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In884193228 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In884193228 256)))) (= |P2Thread1of1ForFork1_#t~ite8_Out884193228| ~z$w_buff0~0_In884193228)) (and (= |P2Thread1of1ForFork1_#t~ite9_Out884193228| ~z$w_buff0~0_In884193228) (= |P2Thread1of1ForFork1_#t~ite8_In884193228| |P2Thread1of1ForFork1_#t~ite8_Out884193228|) (not .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In884193228, ~z$w_buff0_used~0=~z$w_buff0_used~0_In884193228, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In884193228, ~z$w_buff1_used~0=~z$w_buff1_used~0_In884193228, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In884193228, ~weak$$choice2~0=~weak$$choice2~0_In884193228, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In884193228|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In884193228, ~z$w_buff0_used~0=~z$w_buff0_used~0_In884193228, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In884193228, ~z$w_buff1_used~0=~z$w_buff1_used~0_In884193228, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In884193228, ~weak$$choice2~0=~weak$$choice2~0_In884193228, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out884193228|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out884193228|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 16:17:36,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1581126204 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite11_In1581126204| |P2Thread1of1ForFork1_#t~ite11_Out1581126204|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite12_Out1581126204| ~z$w_buff1~0_In1581126204)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite11_Out1581126204| |P2Thread1of1ForFork1_#t~ite12_Out1581126204|) (= |P2Thread1of1ForFork1_#t~ite11_Out1581126204| ~z$w_buff1~0_In1581126204) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1581126204 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1581126204 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In1581126204 256)) .cse1) (and .cse1 (= (mod ~z$w_buff1_used~0_In1581126204 256) 0))))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1581126204, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1581126204, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In1581126204|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1581126204, ~z$w_buff1~0=~z$w_buff1~0_In1581126204, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1581126204, ~weak$$choice2~0=~weak$$choice2~0_In1581126204} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1581126204, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1581126204|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1581126204, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1581126204|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1581126204, ~z$w_buff1~0=~z$w_buff1~0_In1581126204, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1581126204, ~weak$$choice2~0=~weak$$choice2~0_In1581126204} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 16:17:36,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In534169677 256)))) (or (and (= ~z$w_buff0_used~0_In534169677 |P2Thread1of1ForFork1_#t~ite15_Out534169677|) (= |P2Thread1of1ForFork1_#t~ite14_In534169677| |P2Thread1of1ForFork1_#t~ite14_Out534169677|) (not .cse0)) (and .cse0 (= ~z$w_buff0_used~0_In534169677 |P2Thread1of1ForFork1_#t~ite14_Out534169677|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In534169677 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In534169677 256)) .cse1) (and .cse1 (= (mod ~z$w_buff1_used~0_In534169677 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In534169677 256)))) (= |P2Thread1of1ForFork1_#t~ite15_Out534169677| |P2Thread1of1ForFork1_#t~ite14_Out534169677|)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In534169677|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In534169677, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In534169677, ~z$w_buff1_used~0=~z$w_buff1_used~0_In534169677, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In534169677, ~weak$$choice2~0=~weak$$choice2~0_In534169677} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out534169677|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out534169677|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In534169677, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In534169677, ~z$w_buff1_used~0=~z$w_buff1_used~0_In534169677, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In534169677, ~weak$$choice2~0=~weak$$choice2~0_In534169677} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-07 16:17:36,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_9|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 16:17:36,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1805441081 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite23_In1805441081| |P2Thread1of1ForFork1_#t~ite23_Out1805441081|) (= |P2Thread1of1ForFork1_#t~ite24_Out1805441081| ~z$r_buff1_thd3~0_In1805441081) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite24_Out1805441081| |P2Thread1of1ForFork1_#t~ite23_Out1805441081|) (= ~z$r_buff1_thd3~0_In1805441081 |P2Thread1of1ForFork1_#t~ite23_Out1805441081|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1805441081 256) 0))) (or (= (mod ~z$w_buff0_used~0_In1805441081 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In1805441081 256)) .cse1) (and .cse1 (= (mod ~z$w_buff1_used~0_In1805441081 256) 0))))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1805441081, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1805441081, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In1805441081|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1805441081, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1805441081, ~weak$$choice2~0=~weak$$choice2~0_In1805441081} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out1805441081|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1805441081, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1805441081, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out1805441081|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1805441081, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1805441081, ~weak$$choice2~0=~weak$$choice2~0_In1805441081} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-07 16:17:36,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 16:17:36,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1690976594 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1690976594 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1690976594 |P3Thread1of1ForFork2_#t~ite28_Out-1690976594|)) (and (not .cse1) (not .cse0) (= 0 |P3Thread1of1ForFork2_#t~ite28_Out-1690976594|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1690976594, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1690976594} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1690976594|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1690976594, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1690976594} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 16:17:36,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-572823387 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-572823387 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-572823387 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-572823387 256) 0))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite29_Out-572823387|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-572823387 |P3Thread1of1ForFork2_#t~ite29_Out-572823387|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-572823387, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-572823387, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-572823387, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-572823387} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-572823387|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-572823387, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-572823387, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-572823387, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-572823387} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 16:17:36,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1657205871 256))) (.cse1 (= ~z$r_buff0_thd4~0_Out1657205871 ~z$r_buff0_thd4~0_In1657205871)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1657205871 256)))) (or (and .cse0 .cse1) (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out1657205871) (not .cse2)) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1657205871, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1657205871} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1657205871, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1657205871, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out1657205871|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-07 16:17:36,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1265363422 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In1265363422 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1265363422 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1265363422 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite31_Out1265363422| ~z$r_buff1_thd4~0_In1265363422)) (and (= |P3Thread1of1ForFork2_#t~ite31_Out1265363422| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1265363422, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1265363422, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1265363422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1265363422} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1265363422, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1265363422, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1265363422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1265363422, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out1265363422|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 16:17:36,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= |v_P3Thread1of1ForFork2_#t~ite31_42| v_~z$r_buff1_thd4~0_62) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_42|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_41|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 16:17:36,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 16:17:36,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-964143046 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-964143046 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite36_Out-964143046| |ULTIMATE.start_main_#t~ite37_Out-964143046|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-964143046| ~z$w_buff1~0_In-964143046) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite36_Out-964143046| ~z~0_In-964143046) (or .cse2 .cse0) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-964143046, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-964143046, ~z$w_buff1~0=~z$w_buff1~0_In-964143046, ~z~0=~z~0_In-964143046} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-964143046, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-964143046, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-964143046|, ~z$w_buff1~0=~z$w_buff1~0_In-964143046, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-964143046|, ~z~0=~z~0_In-964143046} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 16:17:36,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1545405005 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1545405005 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1545405005 |ULTIMATE.start_main_#t~ite38_Out-1545405005|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out-1545405005|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1545405005, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1545405005} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1545405005, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1545405005, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1545405005|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 16:17:36,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1518571980 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1518571980 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1518571980 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1518571980 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out1518571980| ~z$w_buff1_used~0_In1518571980) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite39_Out1518571980| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1518571980, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1518571980, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1518571980, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1518571980} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1518571980, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1518571980|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1518571980, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1518571980, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1518571980} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 16:17:36,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2131187137 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In2131187137 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out2131187137| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out2131187137| ~z$r_buff0_thd0~0_In2131187137)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2131187137, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2131187137} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2131187137, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2131187137|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2131187137} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 16:17:36,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1148706750 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1148706750 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1148706750 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1148706750 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out-1148706750| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite41_Out-1148706750| ~z$r_buff1_thd0~0_In-1148706750) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1148706750, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1148706750, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1148706750, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1148706750} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1148706750|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1148706750, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1148706750, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1148706750, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1148706750} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 16:17:36,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= v_~y~0_25 2) (= 0 v_~__unbuffered_p0_EAX~0_32) (= 0 v_~__unbuffered_p2_EAX~0_16))) 1 0)) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:17:36,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:17:36 BasicIcfg [2019-12-07 16:17:36,668 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:17:36,668 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:17:36,668 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:17:36,668 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:17:36,668 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:17:19" (3/4) ... [2019-12-07 16:17:36,670 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:17:36,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_119| 0 0))) (and (= v_~z~0_122 0) (= v_~z$w_buff0_used~0_514 0) (= v_~z$mem_tmp~0_32 0) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_50 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= 0 v_~__unbuffered_p3_EBX~0_94) (= |v_#valid_117| (store .cse0 |v_ULTIMATE.start_main_~#t1029~0.base_71| 1)) (= 0 v_~__unbuffered_p3_EAX~0_93) (= 0 v_~weak$$choice0~0_26) (< 0 |v_#StackHeapBarrier_19|) (= 0 |v_ULTIMATE.start_main_~#t1029~0.offset_43|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= v_~z$w_buff0~0_183 0) (= 0 v_~z$r_buff1_thd3~0_197) (= 0 v_~z$flush_delayed~0_53) (= 0 v_~z$r_buff1_thd1~0_59) (= (select .cse0 |v_ULTIMATE.start_main_~#t1029~0.base_71|) 0) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd0~0_138 0) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1029~0.base_71|) (= v_~z$r_buff0_thd2~0_57 0) (= v_~z$read_delayed~0_7 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1029~0.base_71| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1029~0.base_71|) |v_ULTIMATE.start_main_~#t1029~0.offset_43| 0)) |v_#memory_int_27|) (= |v_#NULL.offset_5| 0) (= v_~weak$$choice2~0_111 0) (= 0 v_~z$r_buff0_thd3~0_266) (= v_~x~0_36 0) (= v_~y~0_68 0) (= v_~z$w_buff1_used~0_298 0) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~z$w_buff1~0_123 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t1029~0.base_71| 4)) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0) (= 0 v_~__unbuffered_p2_EAX~0_55))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_119|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t1030~0.offset=|v_ULTIMATE.start_main_~#t1030~0.offset_41|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ULTIMATE.start_main_~#t1029~0.base=|v_ULTIMATE.start_main_~#t1029~0.base_71|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_~#t1032~0.base=|v_ULTIMATE.start_main_~#t1032~0.base_36|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_93, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_55, ~z$mem_tmp~0=v_~z$mem_tmp~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_26, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_36, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_138, ~y~0=v_~y~0_68, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_197, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_94, ULTIMATE.start_main_~#t1032~0.offset=|v_ULTIMATE.start_main_~#t1032~0.offset_24|, ULTIMATE.start_main_~#t1030~0.base=|v_ULTIMATE.start_main_~#t1030~0.base_68|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t1031~0.offset=|v_ULTIMATE.start_main_~#t1031~0.offset_25|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_103|, ULTIMATE.start_main_~#t1031~0.base=|v_ULTIMATE.start_main_~#t1031~0.base_36|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_44|, #valid=|v_#valid_117|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_122, ULTIMATE.start_main_~#t1029~0.offset=|v_ULTIMATE.start_main_~#t1029~0.offset_43|, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1030~0.offset, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t1029~0.base, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1032~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t1032~0.offset, ULTIMATE.start_main_~#t1030~0.base, #NULL.base, ULTIMATE.start_main_~#t1031~0.offset, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1031~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t1029~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 16:17:36,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1030~0.base_11| 0)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1030~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1030~0.offset_10| 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1030~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1030~0.base_11|) |v_ULTIMATE.start_main_~#t1030~0.offset_10| 1)) |v_#memory_int_19|) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1030~0.base_11| 1) |v_#valid_48|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1030~0.base_11|)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1030~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1030~0.offset=|v_ULTIMATE.start_main_~#t1030~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1030~0.base=|v_ULTIMATE.start_main_~#t1030~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1030~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1030~0.base] because there is no mapped edge [2019-12-07 16:17:36,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1031~0.base_12| 1)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1031~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t1031~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t1031~0.offset_11| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1031~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1031~0.base_12|) |v_ULTIMATE.start_main_~#t1031~0.offset_11| 2)) |v_#memory_int_17|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1031~0.base_12| 4) |v_#length_21|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1031~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1031~0.offset=|v_ULTIMATE.start_main_~#t1031~0.offset_11|, ULTIMATE.start_main_~#t1031~0.base=|v_ULTIMATE.start_main_~#t1031~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1031~0.offset, ULTIMATE.start_main_~#t1031~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 16:17:36,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1032~0.base_12|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1032~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1032~0.base_12|) |v_ULTIMATE.start_main_~#t1032~0.offset_10| 3)) |v_#memory_int_15|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1032~0.base_12| 4)) (= |v_ULTIMATE.start_main_~#t1032~0.offset_10| 0) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1032~0.base_12|)) (= (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1032~0.base_12| 1) |v_#valid_42|) (not (= 0 |v_ULTIMATE.start_main_~#t1032~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1032~0.base=|v_ULTIMATE.start_main_~#t1032~0.base_12|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1032~0.offset=|v_ULTIMATE.start_main_~#t1032~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1032~0.base, #length, ULTIMATE.start_main_~#t1032~0.offset] because there is no mapped edge [2019-12-07 16:17:36,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~a~0_Out-1727431310 ~__unbuffered_p3_EAX~0_Out-1727431310) (= ~z$r_buff1_thd2~0_Out-1727431310 ~z$r_buff0_thd2~0_In-1727431310) (= ~__unbuffered_p3_EBX~0_Out-1727431310 ~b~0_In-1727431310) (= ~z$r_buff0_thd0~0_In-1727431310 ~z$r_buff1_thd0~0_Out-1727431310) (= ~z$r_buff0_thd4~0_Out-1727431310 1) (= ~z$r_buff0_thd3~0_In-1727431310 ~z$r_buff1_thd3~0_Out-1727431310) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1727431310)) (= ~z$r_buff1_thd1~0_Out-1727431310 ~z$r_buff0_thd1~0_In-1727431310) (= ~z$r_buff1_thd4~0_Out-1727431310 ~z$r_buff0_thd4~0_In-1727431310) (= 1 ~a~0_Out-1727431310)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1727431310, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1727431310, ~b~0=~b~0_In-1727431310, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1727431310, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1727431310, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1727431310, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1727431310} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1727431310, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-1727431310, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1727431310, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1727431310, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-1727431310, ~a~0=~a~0_Out-1727431310, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1727431310, ~b~0=~b~0_In-1727431310, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1727431310, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1727431310, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-1727431310, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1727431310, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1727431310, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1727431310, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1727431310} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-07 16:17:36,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_20 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~x~0_30 v_~__unbuffered_p0_EAX~0_26) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_20) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~b~0_48 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_20, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_20, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 16:17:36,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg.base_11| v_P1Thread1of1ForFork0_~arg.base_9) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x~0_19 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~y~0_18 1) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_9)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_18, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 16:17:36,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In884193228 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite9_Out884193228| |P2Thread1of1ForFork1_#t~ite8_Out884193228|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In884193228 256)))) (or (and (= (mod ~z$w_buff1_used~0_In884193228 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In884193228 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In884193228 256)))) (= |P2Thread1of1ForFork1_#t~ite8_Out884193228| ~z$w_buff0~0_In884193228)) (and (= |P2Thread1of1ForFork1_#t~ite9_Out884193228| ~z$w_buff0~0_In884193228) (= |P2Thread1of1ForFork1_#t~ite8_In884193228| |P2Thread1of1ForFork1_#t~ite8_Out884193228|) (not .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In884193228, ~z$w_buff0_used~0=~z$w_buff0_used~0_In884193228, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In884193228, ~z$w_buff1_used~0=~z$w_buff1_used~0_In884193228, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In884193228, ~weak$$choice2~0=~weak$$choice2~0_In884193228, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In884193228|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In884193228, ~z$w_buff0_used~0=~z$w_buff0_used~0_In884193228, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In884193228, ~z$w_buff1_used~0=~z$w_buff1_used~0_In884193228, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In884193228, ~weak$$choice2~0=~weak$$choice2~0_In884193228, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out884193228|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out884193228|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 16:17:36,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1581126204 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite11_In1581126204| |P2Thread1of1ForFork1_#t~ite11_Out1581126204|) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite12_Out1581126204| ~z$w_buff1~0_In1581126204)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite11_Out1581126204| |P2Thread1of1ForFork1_#t~ite12_Out1581126204|) (= |P2Thread1of1ForFork1_#t~ite11_Out1581126204| ~z$w_buff1~0_In1581126204) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1581126204 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In1581126204 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In1581126204 256)) .cse1) (and .cse1 (= (mod ~z$w_buff1_used~0_In1581126204 256) 0))))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1581126204, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1581126204, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In1581126204|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1581126204, ~z$w_buff1~0=~z$w_buff1~0_In1581126204, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1581126204, ~weak$$choice2~0=~weak$$choice2~0_In1581126204} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1581126204, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1581126204|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1581126204, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1581126204|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1581126204, ~z$w_buff1~0=~z$w_buff1~0_In1581126204, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1581126204, ~weak$$choice2~0=~weak$$choice2~0_In1581126204} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 16:17:36,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In534169677 256)))) (or (and (= ~z$w_buff0_used~0_In534169677 |P2Thread1of1ForFork1_#t~ite15_Out534169677|) (= |P2Thread1of1ForFork1_#t~ite14_In534169677| |P2Thread1of1ForFork1_#t~ite14_Out534169677|) (not .cse0)) (and .cse0 (= ~z$w_buff0_used~0_In534169677 |P2Thread1of1ForFork1_#t~ite14_Out534169677|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In534169677 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In534169677 256)) .cse1) (and .cse1 (= (mod ~z$w_buff1_used~0_In534169677 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In534169677 256)))) (= |P2Thread1of1ForFork1_#t~ite15_Out534169677| |P2Thread1of1ForFork1_#t~ite14_Out534169677|)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In534169677|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In534169677, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In534169677, ~z$w_buff1_used~0=~z$w_buff1_used~0_In534169677, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In534169677, ~weak$$choice2~0=~weak$$choice2~0_In534169677} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out534169677|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out534169677|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In534169677, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In534169677, ~z$w_buff1_used~0=~z$w_buff1_used~0_In534169677, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In534169677, ~weak$$choice2~0=~weak$$choice2~0_In534169677} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-07 16:17:36,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_9|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 16:17:36,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1805441081 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite23_In1805441081| |P2Thread1of1ForFork1_#t~ite23_Out1805441081|) (= |P2Thread1of1ForFork1_#t~ite24_Out1805441081| ~z$r_buff1_thd3~0_In1805441081) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite24_Out1805441081| |P2Thread1of1ForFork1_#t~ite23_Out1805441081|) (= ~z$r_buff1_thd3~0_In1805441081 |P2Thread1of1ForFork1_#t~ite23_Out1805441081|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1805441081 256) 0))) (or (= (mod ~z$w_buff0_used~0_In1805441081 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In1805441081 256)) .cse1) (and .cse1 (= (mod ~z$w_buff1_used~0_In1805441081 256) 0))))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1805441081, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1805441081, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In1805441081|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1805441081, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1805441081, ~weak$$choice2~0=~weak$$choice2~0_In1805441081} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out1805441081|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1805441081, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1805441081, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out1805441081|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1805441081, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1805441081, ~weak$$choice2~0=~weak$$choice2~0_In1805441081} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-07 16:17:36,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 16:17:36,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1690976594 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1690976594 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1690976594 |P3Thread1of1ForFork2_#t~ite28_Out-1690976594|)) (and (not .cse1) (not .cse0) (= 0 |P3Thread1of1ForFork2_#t~ite28_Out-1690976594|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1690976594, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1690976594} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1690976594|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1690976594, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1690976594} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 16:17:36,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-572823387 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-572823387 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-572823387 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-572823387 256) 0))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite29_Out-572823387|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-572823387 |P3Thread1of1ForFork2_#t~ite29_Out-572823387|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-572823387, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-572823387, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-572823387, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-572823387} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-572823387|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-572823387, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-572823387, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-572823387, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-572823387} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 16:17:36,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1657205871 256))) (.cse1 (= ~z$r_buff0_thd4~0_Out1657205871 ~z$r_buff0_thd4~0_In1657205871)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1657205871 256)))) (or (and .cse0 .cse1) (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out1657205871) (not .cse2)) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1657205871, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1657205871} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1657205871, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1657205871, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out1657205871|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-07 16:17:36,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1265363422 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In1265363422 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1265363422 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1265363422 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite31_Out1265363422| ~z$r_buff1_thd4~0_In1265363422)) (and (= |P3Thread1of1ForFork2_#t~ite31_Out1265363422| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1265363422, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1265363422, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1265363422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1265363422} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1265363422, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1265363422, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1265363422, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1265363422, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out1265363422|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 16:17:36,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= |v_P3Thread1of1ForFork2_#t~ite31_42| v_~z$r_buff1_thd4~0_62) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_42|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_41|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 16:17:36,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 16:17:36,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-964143046 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-964143046 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite36_Out-964143046| |ULTIMATE.start_main_#t~ite37_Out-964143046|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-964143046| ~z$w_buff1~0_In-964143046) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite36_Out-964143046| ~z~0_In-964143046) (or .cse2 .cse0) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-964143046, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-964143046, ~z$w_buff1~0=~z$w_buff1~0_In-964143046, ~z~0=~z~0_In-964143046} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-964143046, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-964143046, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-964143046|, ~z$w_buff1~0=~z$w_buff1~0_In-964143046, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-964143046|, ~z~0=~z~0_In-964143046} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 16:17:36,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1545405005 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1545405005 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1545405005 |ULTIMATE.start_main_#t~ite38_Out-1545405005|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out-1545405005|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1545405005, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1545405005} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1545405005, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1545405005, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1545405005|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 16:17:36,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1518571980 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1518571980 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1518571980 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1518571980 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out1518571980| ~z$w_buff1_used~0_In1518571980) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite39_Out1518571980| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1518571980, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1518571980, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1518571980, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1518571980} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1518571980, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1518571980|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1518571980, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1518571980, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1518571980} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 16:17:36,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2131187137 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In2131187137 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out2131187137| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out2131187137| ~z$r_buff0_thd0~0_In2131187137)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2131187137, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2131187137} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2131187137, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2131187137|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2131187137} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 16:17:36,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1148706750 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1148706750 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-1148706750 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1148706750 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out-1148706750| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite41_Out-1148706750| ~z$r_buff1_thd0~0_In-1148706750) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1148706750, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1148706750, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1148706750, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1148706750} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1148706750|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1148706750, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1148706750, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1148706750, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1148706750} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 16:17:36,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= v_~y~0_25 2) (= 0 v_~__unbuffered_p0_EAX~0_32) (= 0 v_~__unbuffered_p2_EAX~0_16))) 1 0)) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:17:36,727 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_07cc26c6-0ba8-4bb6-a285-53a5081cba5c/bin/uautomizer/witness.graphml [2019-12-07 16:17:36,728 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:17:36,729 INFO L168 Benchmark]: Toolchain (without parser) took 17901.32 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 934.0 MB in the beginning and 910.6 MB in the end (delta: 23.4 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-12-07 16:17:36,729 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:17:36,729 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -127.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:17:36,729 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:17:36,729 INFO L168 Benchmark]: Boogie Preprocessor took 25.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:17:36,730 INFO L168 Benchmark]: RCFGBuilder took 382.47 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: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:17:36,730 INFO L168 Benchmark]: TraceAbstraction took 17013.06 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 920.0 MB in the end (delta: 82.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-12-07 16:17:36,730 INFO L168 Benchmark]: Witness Printer took 59.82 ms. Allocated memory is still 2.7 GB. Free memory was 920.0 MB in the beginning and 910.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:17:36,732 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 377.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -127.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 382.47 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: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17013.06 ms. Allocated memory was 1.1 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 920.0 MB in the end (delta: 82.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 59.82 ms. Allocated memory is still 2.7 GB. Free memory was 920.0 MB in the beginning and 910.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 170 ProgramPointsBefore, 74 ProgramPointsAfterwards, 192 TransitionsBefore, 78 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 23 ChoiceCompositions, 5707 VarBasedMoverChecksPositive, 158 VarBasedMoverChecksNegative, 28 SemBasedMoverChecksPositive, 169 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.6s, 0 MoverChecksTotal, 44168 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t1029, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1030, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1031, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1032, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 2 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.8s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2154 SDtfs, 2899 SDslu, 3253 SDs, 0 SdLazy, 1134 SolverSat, 200 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43003occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 24702 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 538 NumberOfCodeBlocks, 538 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 471 ConstructedInterpolants, 0 QuantifiedInterpolants, 77243 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...