./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix036_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ee3cdcfb-39d5-43cb-820d-0e1c5e2aa588/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ee3cdcfb-39d5-43cb-820d-0e1c5e2aa588/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ee3cdcfb-39d5-43cb-820d-0e1c5e2aa588/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ee3cdcfb-39d5-43cb-820d-0e1c5e2aa588/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix036_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ee3cdcfb-39d5-43cb-820d-0e1c5e2aa588/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ee3cdcfb-39d5-43cb-820d-0e1c5e2aa588/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 ed7989611a29782090ffd275937aa1df9d5fe6ef .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 19:00:52,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:00:52,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:00:52,997 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:00:52,998 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:00:52,998 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:00:52,999 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:00:53,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:00:53,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:00:53,002 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:00:53,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:00:53,004 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:00:53,004 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:00:53,005 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:00:53,005 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:00:53,006 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:00:53,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:00:53,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:00:53,008 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:00:53,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:00:53,011 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:00:53,012 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:00:53,013 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:00:53,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:00:53,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:00:53,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:00:53,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:00:53,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:00:53,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:00:53,016 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:00:53,016 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:00:53,017 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:00:53,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:00:53,018 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:00:53,018 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:00:53,018 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:00:53,019 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:00:53,019 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:00:53,019 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:00:53,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:00:53,020 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:00:53,020 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ee3cdcfb-39d5-43cb-820d-0e1c5e2aa588/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 19:00:53,030 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:00:53,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:00:53,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 19:00:53,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 19:00:53,031 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 19:00:53,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:00:53,031 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:00:53,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:00:53,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:00:53,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:00:53,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:00:53,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:00:53,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:00:53,032 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:00:53,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:00:53,032 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:00:53,032 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:00:53,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:00:53,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 19:00:53,033 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:00:53,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:00:53,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:00:53,033 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:00:53,033 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:00:53,034 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:00:53,034 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 19:00:53,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:00:53,034 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:00:53,034 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:00:53,034 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_ee3cdcfb-39d5-43cb-820d-0e1c5e2aa588/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 -> ed7989611a29782090ffd275937aa1df9d5fe6ef [2019-12-07 19:00:53,133 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:00:53,142 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:00:53,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:00:53,146 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:00:53,146 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:00:53,147 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ee3cdcfb-39d5-43cb-820d-0e1c5e2aa588/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix036_pso.opt.i [2019-12-07 19:00:53,186 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ee3cdcfb-39d5-43cb-820d-0e1c5e2aa588/bin/uautomizer/data/e3887568e/34089d6fccff4f55b1fb7439954a2073/FLAG35186bc0e [2019-12-07 19:00:53,638 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:00:53,638 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ee3cdcfb-39d5-43cb-820d-0e1c5e2aa588/sv-benchmarks/c/pthread-wmm/mix036_pso.opt.i [2019-12-07 19:00:53,649 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ee3cdcfb-39d5-43cb-820d-0e1c5e2aa588/bin/uautomizer/data/e3887568e/34089d6fccff4f55b1fb7439954a2073/FLAG35186bc0e [2019-12-07 19:00:53,658 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ee3cdcfb-39d5-43cb-820d-0e1c5e2aa588/bin/uautomizer/data/e3887568e/34089d6fccff4f55b1fb7439954a2073 [2019-12-07 19:00:53,660 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:00:53,661 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:00:53,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:00:53,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:00:53,664 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:00:53,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:00:53" (1/1) ... [2019-12-07 19:00:53,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:53, skipping insertion in model container [2019-12-07 19:00:53,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:00:53" (1/1) ... [2019-12-07 19:00:53,672 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:00:53,702 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:00:53,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:00:53,951 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:00:53,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:00:54,042 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:00:54,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:54 WrapperNode [2019-12-07 19:00:54,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:00:54,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:00:54,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:00:54,044 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:00:54,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:54" (1/1) ... [2019-12-07 19:00:54,062 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:54" (1/1) ... [2019-12-07 19:00:54,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:00:54,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:00:54,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:00:54,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:00:54,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:54" (1/1) ... [2019-12-07 19:00:54,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:54" (1/1) ... [2019-12-07 19:00:54,090 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:54" (1/1) ... [2019-12-07 19:00:54,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:54" (1/1) ... [2019-12-07 19:00:54,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:54" (1/1) ... [2019-12-07 19:00:54,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:54" (1/1) ... [2019-12-07 19:00:54,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:54" (1/1) ... [2019-12-07 19:00:54,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:00:54,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:00:54,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:00:54,106 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:00:54,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee3cdcfb-39d5-43cb-820d-0e1c5e2aa588/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 19:00:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:00:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 19:00:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 19:00:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:00:54,152 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 19:00:54,153 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 19:00:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 19:00:54,153 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 19:00:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 19:00:54,153 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 19:00:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 19:00:54,153 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 19:00:54,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 19:00:54,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:00:54,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:00:54,155 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 19:00:54,491 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:00:54,491 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 19:00:54,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:00:54 BoogieIcfgContainer [2019-12-07 19:00:54,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:00:54,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:00:54,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:00:54,495 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:00:54,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:00:53" (1/3) ... [2019-12-07 19:00:54,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ae38bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:00:54, skipping insertion in model container [2019-12-07 19:00:54,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:54" (2/3) ... [2019-12-07 19:00:54,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ae38bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:00:54, skipping insertion in model container [2019-12-07 19:00:54,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:00:54" (3/3) ... [2019-12-07 19:00:54,497 INFO L109 eAbstractionObserver]: Analyzing ICFG mix036_pso.opt.i [2019-12-07 19:00:54,503 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 19:00:54,503 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:00:54,508 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 19:00:54,508 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 19:00:54,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,532 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,532 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,533 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,533 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,535 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,535 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,548 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,549 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,549 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,549 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,549 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,549 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,549 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,549 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,550 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,550 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,550 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,550 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,550 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,550 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,550 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,550 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,553 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,553 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:54,564 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 19:00:54,577 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:00:54,577 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:00:54,577 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:00:54,577 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:00:54,577 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:00:54,577 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:00:54,577 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:00:54,577 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:00:54,588 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 193 transitions [2019-12-07 19:00:54,589 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 171 places, 193 transitions [2019-12-07 19:00:54,641 INFO L134 PetriNetUnfolder]: 35/189 cut-off events. [2019-12-07 19:00:54,641 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:00:54,650 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 189 events. 35/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 579 event pairs. 12/164 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 19:00:54,662 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 171 places, 193 transitions [2019-12-07 19:00:54,688 INFO L134 PetriNetUnfolder]: 35/189 cut-off events. [2019-12-07 19:00:54,688 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:00:54,692 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 189 events. 35/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 579 event pairs. 12/164 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 19:00:54,703 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-07 19:00:54,704 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 19:00:57,705 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-12-07 19:00:57,973 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-07 19:00:58,094 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48496 [2019-12-07 19:00:58,094 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-07 19:00:58,096 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 87 transitions [2019-12-07 19:00:59,345 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 26302 states. [2019-12-07 19:00:59,346 INFO L276 IsEmpty]: Start isEmpty. Operand 26302 states. [2019-12-07 19:00:59,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 19:00:59,352 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:59,352 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:59,352 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 19:00:59,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:59,356 INFO L82 PathProgramCache]: Analyzing trace with hash -887935004, now seen corresponding path program 1 times [2019-12-07 19:00:59,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:59,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853096967] [2019-12-07 19:00:59,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:59,526 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 19:00:59,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853096967] [2019-12-07 19:00:59,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:59,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:00:59,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895165531] [2019-12-07 19:00:59,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:00:59,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:59,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:00:59,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:00:59,541 INFO L87 Difference]: Start difference. First operand 26302 states. Second operand 3 states. [2019-12-07 19:00:59,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:59,882 INFO L93 Difference]: Finished difference Result 25630 states and 112008 transitions. [2019-12-07 19:00:59,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:00:59,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 19:00:59,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:00,053 INFO L225 Difference]: With dead ends: 25630 [2019-12-07 19:01:00,053 INFO L226 Difference]: Without dead ends: 24142 [2019-12-07 19:01:00,054 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 19:01:00,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24142 states. [2019-12-07 19:01:00,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24142 to 24142. [2019-12-07 19:01:00,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24142 states. [2019-12-07 19:01:00,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24142 states to 24142 states and 105356 transitions. [2019-12-07 19:01:00,859 INFO L78 Accepts]: Start accepts. Automaton has 24142 states and 105356 transitions. Word has length 9 [2019-12-07 19:01:00,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:00,860 INFO L462 AbstractCegarLoop]: Abstraction has 24142 states and 105356 transitions. [2019-12-07 19:01:00,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:01:00,860 INFO L276 IsEmpty]: Start isEmpty. Operand 24142 states and 105356 transitions. [2019-12-07 19:01:00,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 19:01:00,865 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:00,865 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:00,866 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 19:01:00,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:00,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1247749362, now seen corresponding path program 1 times [2019-12-07 19:01:00,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:00,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648231971] [2019-12-07 19:01:00,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:00,925 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 19:01:00,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648231971] [2019-12-07 19:01:00,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:00,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:01:00,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093200032] [2019-12-07 19:01:00,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:01:00,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:00,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:01:00,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:01:00,927 INFO L87 Difference]: Start difference. First operand 24142 states and 105356 transitions. Second operand 4 states. [2019-12-07 19:01:01,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:01,292 INFO L93 Difference]: Finished difference Result 36454 states and 153868 transitions. [2019-12-07 19:01:01,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:01:01,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 19:01:01,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:01,473 INFO L225 Difference]: With dead ends: 36454 [2019-12-07 19:01:01,473 INFO L226 Difference]: Without dead ends: 36394 [2019-12-07 19:01:01,473 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 19:01:01,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36394 states. [2019-12-07 19:01:02,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36394 to 33062. [2019-12-07 19:01:02,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33062 states. [2019-12-07 19:01:02,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33062 states to 33062 states and 141336 transitions. [2019-12-07 19:01:02,335 INFO L78 Accepts]: Start accepts. Automaton has 33062 states and 141336 transitions. Word has length 15 [2019-12-07 19:01:02,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:02,335 INFO L462 AbstractCegarLoop]: Abstraction has 33062 states and 141336 transitions. [2019-12-07 19:01:02,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:01:02,336 INFO L276 IsEmpty]: Start isEmpty. Operand 33062 states and 141336 transitions. [2019-12-07 19:01:02,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:01:02,340 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:02,341 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 19:01:02,341 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 19:01:02,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:02,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1635073164, now seen corresponding path program 1 times [2019-12-07 19:01:02,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:02,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992017250] [2019-12-07 19:01:02,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:02,375 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 19:01:02,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992017250] [2019-12-07 19:01:02,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:02,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:01:02,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111213861] [2019-12-07 19:01:02,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:01:02,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:02,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:01:02,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:02,376 INFO L87 Difference]: Start difference. First operand 33062 states and 141336 transitions. Second operand 3 states. [2019-12-07 19:01:02,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:02,674 INFO L93 Difference]: Finished difference Result 41522 states and 174636 transitions. [2019-12-07 19:01:02,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:01:02,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 19:01:02,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:02,760 INFO L225 Difference]: With dead ends: 41522 [2019-12-07 19:01:02,760 INFO L226 Difference]: Without dead ends: 41522 [2019-12-07 19:01:02,760 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 19:01:02,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41522 states. [2019-12-07 19:01:03,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41522 to 35834. [2019-12-07 19:01:03,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35834 states. [2019-12-07 19:01:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35834 states to 35834 states and 152544 transitions. [2019-12-07 19:01:03,696 INFO L78 Accepts]: Start accepts. Automaton has 35834 states and 152544 transitions. Word has length 18 [2019-12-07 19:01:03,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:03,697 INFO L462 AbstractCegarLoop]: Abstraction has 35834 states and 152544 transitions. [2019-12-07 19:01:03,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:01:03,697 INFO L276 IsEmpty]: Start isEmpty. Operand 35834 states and 152544 transitions. [2019-12-07 19:01:03,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:01:03,703 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:03,703 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 19:01:03,703 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 19:01:03,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:03,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1634952543, now seen corresponding path program 1 times [2019-12-07 19:01:03,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:03,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711020846] [2019-12-07 19:01:03,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:03,756 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 19:01:03,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711020846] [2019-12-07 19:01:03,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:03,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:01:03,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551776031] [2019-12-07 19:01:03,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:01:03,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:03,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:01:03,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:01:03,758 INFO L87 Difference]: Start difference. First operand 35834 states and 152544 transitions. Second operand 4 states. [2019-12-07 19:01:04,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:04,005 INFO L93 Difference]: Finished difference Result 43266 states and 181176 transitions. [2019-12-07 19:01:04,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:01:04,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 19:01:04,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:04,095 INFO L225 Difference]: With dead ends: 43266 [2019-12-07 19:01:04,095 INFO L226 Difference]: Without dead ends: 43226 [2019-12-07 19:01:04,095 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 19:01:04,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43226 states. [2019-12-07 19:01:04,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43226 to 37670. [2019-12-07 19:01:04,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37670 states. [2019-12-07 19:01:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37670 states to 37670 states and 159820 transitions. [2019-12-07 19:01:05,006 INFO L78 Accepts]: Start accepts. Automaton has 37670 states and 159820 transitions. Word has length 18 [2019-12-07 19:01:05,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:05,007 INFO L462 AbstractCegarLoop]: Abstraction has 37670 states and 159820 transitions. [2019-12-07 19:01:05,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:01:05,007 INFO L276 IsEmpty]: Start isEmpty. Operand 37670 states and 159820 transitions. [2019-12-07 19:01:05,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:01:05,011 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:05,011 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 19:01:05,011 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 19:01:05,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:05,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1770652005, now seen corresponding path program 1 times [2019-12-07 19:01:05,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:05,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836712442] [2019-12-07 19:01:05,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:05,058 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 19:01:05,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836712442] [2019-12-07 19:01:05,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:05,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:01:05,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863348137] [2019-12-07 19:01:05,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:01:05,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:05,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:01:05,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:01:05,060 INFO L87 Difference]: Start difference. First operand 37670 states and 159820 transitions. Second operand 4 states. [2019-12-07 19:01:05,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:05,356 INFO L93 Difference]: Finished difference Result 47658 states and 200116 transitions. [2019-12-07 19:01:05,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:01:05,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 19:01:05,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:05,462 INFO L225 Difference]: With dead ends: 47658 [2019-12-07 19:01:05,462 INFO L226 Difference]: Without dead ends: 47598 [2019-12-07 19:01:05,463 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 19:01:05,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47598 states. [2019-12-07 19:01:06,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47598 to 39262. [2019-12-07 19:01:06,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39262 states. [2019-12-07 19:01:06,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39262 states to 39262 states and 166916 transitions. [2019-12-07 19:01:06,432 INFO L78 Accepts]: Start accepts. Automaton has 39262 states and 166916 transitions. Word has length 18 [2019-12-07 19:01:06,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:06,432 INFO L462 AbstractCegarLoop]: Abstraction has 39262 states and 166916 transitions. [2019-12-07 19:01:06,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:01:06,432 INFO L276 IsEmpty]: Start isEmpty. Operand 39262 states and 166916 transitions. [2019-12-07 19:01:06,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 19:01:06,441 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:06,441 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:06,441 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 19:01:06,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:06,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1431333081, now seen corresponding path program 1 times [2019-12-07 19:01:06,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:06,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480385865] [2019-12-07 19:01:06,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:06,483 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 19:01:06,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480385865] [2019-12-07 19:01:06,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:06,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:01:06,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978523605] [2019-12-07 19:01:06,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:01:06,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:06,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:01:06,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:06,485 INFO L87 Difference]: Start difference. First operand 39262 states and 166916 transitions. Second operand 3 states. [2019-12-07 19:01:06,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:06,662 INFO L93 Difference]: Finished difference Result 37206 states and 156212 transitions. [2019-12-07 19:01:06,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:01:06,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 19:01:06,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:06,743 INFO L225 Difference]: With dead ends: 37206 [2019-12-07 19:01:06,744 INFO L226 Difference]: Without dead ends: 37206 [2019-12-07 19:01:06,744 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 19:01:06,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37206 states. [2019-12-07 19:01:07,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37206 to 36326. [2019-12-07 19:01:07,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36326 states. [2019-12-07 19:01:07,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36326 states to 36326 states and 152780 transitions. [2019-12-07 19:01:07,655 INFO L78 Accepts]: Start accepts. Automaton has 36326 states and 152780 transitions. Word has length 20 [2019-12-07 19:01:07,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:07,655 INFO L462 AbstractCegarLoop]: Abstraction has 36326 states and 152780 transitions. [2019-12-07 19:01:07,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:01:07,655 INFO L276 IsEmpty]: Start isEmpty. Operand 36326 states and 152780 transitions. [2019-12-07 19:01:07,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 19:01:07,661 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:07,661 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 19:01:07,661 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 19:01:07,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:07,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1560525539, now seen corresponding path program 1 times [2019-12-07 19:01:07,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:07,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175986700] [2019-12-07 19:01:07,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:07,693 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 19:01:07,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175986700] [2019-12-07 19:01:07,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:07,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:01:07,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278969279] [2019-12-07 19:01:07,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:01:07,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:07,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:01:07,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:07,694 INFO L87 Difference]: Start difference. First operand 36326 states and 152780 transitions. Second operand 3 states. [2019-12-07 19:01:07,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:07,801 INFO L93 Difference]: Finished difference Result 28661 states and 111723 transitions. [2019-12-07 19:01:07,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:01:07,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 19:01:07,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:07,859 INFO L225 Difference]: With dead ends: 28661 [2019-12-07 19:01:07,859 INFO L226 Difference]: Without dead ends: 28661 [2019-12-07 19:01:07,860 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 19:01:07,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28661 states. [2019-12-07 19:01:08,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28661 to 28661. [2019-12-07 19:01:08,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28661 states. [2019-12-07 19:01:08,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28661 states to 28661 states and 111723 transitions. [2019-12-07 19:01:08,397 INFO L78 Accepts]: Start accepts. Automaton has 28661 states and 111723 transitions. Word has length 20 [2019-12-07 19:01:08,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:08,398 INFO L462 AbstractCegarLoop]: Abstraction has 28661 states and 111723 transitions. [2019-12-07 19:01:08,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:01:08,398 INFO L276 IsEmpty]: Start isEmpty. Operand 28661 states and 111723 transitions. [2019-12-07 19:01:08,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 19:01:08,403 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:08,403 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 19:01:08,403 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 19:01:08,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:08,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1326592186, now seen corresponding path program 1 times [2019-12-07 19:01:08,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:08,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978150087] [2019-12-07 19:01:08,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:08,456 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 19:01:08,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978150087] [2019-12-07 19:01:08,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:08,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:01:08,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845358669] [2019-12-07 19:01:08,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:01:08,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:08,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:01:08,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:01:08,457 INFO L87 Difference]: Start difference. First operand 28661 states and 111723 transitions. Second operand 4 states. [2019-12-07 19:01:08,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:08,568 INFO L93 Difference]: Finished difference Result 28238 states and 110065 transitions. [2019-12-07 19:01:08,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:01:08,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 19:01:08,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:08,623 INFO L225 Difference]: With dead ends: 28238 [2019-12-07 19:01:08,623 INFO L226 Difference]: Without dead ends: 28238 [2019-12-07 19:01:08,623 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 19:01:08,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28238 states. [2019-12-07 19:01:09,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28238 to 28238. [2019-12-07 19:01:09,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28238 states. [2019-12-07 19:01:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28238 states to 28238 states and 110065 transitions. [2019-12-07 19:01:09,157 INFO L78 Accepts]: Start accepts. Automaton has 28238 states and 110065 transitions. Word has length 21 [2019-12-07 19:01:09,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:09,158 INFO L462 AbstractCegarLoop]: Abstraction has 28238 states and 110065 transitions. [2019-12-07 19:01:09,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:01:09,158 INFO L276 IsEmpty]: Start isEmpty. Operand 28238 states and 110065 transitions. [2019-12-07 19:01:09,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 19:01:09,167 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:09,167 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 19:01:09,167 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 19:01:09,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:09,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1477949356, now seen corresponding path program 1 times [2019-12-07 19:01:09,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:09,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677570547] [2019-12-07 19:01:09,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:09,214 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 19:01:09,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677570547] [2019-12-07 19:01:09,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:09,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:01:09,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752348971] [2019-12-07 19:01:09,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:01:09,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:09,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:01:09,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:01:09,216 INFO L87 Difference]: Start difference. First operand 28238 states and 110065 transitions. Second operand 4 states. [2019-12-07 19:01:09,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:09,471 INFO L93 Difference]: Finished difference Result 40530 states and 155256 transitions. [2019-12-07 19:01:09,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:01:09,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-07 19:01:09,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:09,543 INFO L225 Difference]: With dead ends: 40530 [2019-12-07 19:01:09,544 INFO L226 Difference]: Without dead ends: 39814 [2019-12-07 19:01:09,544 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 19:01:09,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39814 states. [2019-12-07 19:01:10,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39814 to 39750. [2019-12-07 19:01:10,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39750 states. [2019-12-07 19:01:10,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39750 states to 39750 states and 152647 transitions. [2019-12-07 19:01:10,237 INFO L78 Accepts]: Start accepts. Automaton has 39750 states and 152647 transitions. Word has length 23 [2019-12-07 19:01:10,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:10,237 INFO L462 AbstractCegarLoop]: Abstraction has 39750 states and 152647 transitions. [2019-12-07 19:01:10,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:01:10,237 INFO L276 IsEmpty]: Start isEmpty. Operand 39750 states and 152647 transitions. [2019-12-07 19:01:10,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 19:01:10,249 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:10,249 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 19:01:10,249 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 19:01:10,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:10,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1431233055, now seen corresponding path program 1 times [2019-12-07 19:01:10,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:10,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121433351] [2019-12-07 19:01:10,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:10,282 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 19:01:10,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121433351] [2019-12-07 19:01:10,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:10,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:01:10,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324429993] [2019-12-07 19:01:10,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:01:10,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:10,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:01:10,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:01:10,284 INFO L87 Difference]: Start difference. First operand 39750 states and 152647 transitions. Second operand 4 states. [2019-12-07 19:01:10,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:10,356 INFO L93 Difference]: Finished difference Result 18203 states and 60116 transitions. [2019-12-07 19:01:10,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:01:10,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-07 19:01:10,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:10,380 INFO L225 Difference]: With dead ends: 18203 [2019-12-07 19:01:10,381 INFO L226 Difference]: Without dead ends: 18203 [2019-12-07 19:01:10,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:01:10,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18203 states. [2019-12-07 19:01:10,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18203 to 18203. [2019-12-07 19:01:10,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18203 states. [2019-12-07 19:01:10,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18203 states to 18203 states and 60116 transitions. [2019-12-07 19:01:10,647 INFO L78 Accepts]: Start accepts. Automaton has 18203 states and 60116 transitions. Word has length 23 [2019-12-07 19:01:10,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:10,647 INFO L462 AbstractCegarLoop]: Abstraction has 18203 states and 60116 transitions. [2019-12-07 19:01:10,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:01:10,648 INFO L276 IsEmpty]: Start isEmpty. Operand 18203 states and 60116 transitions. [2019-12-07 19:01:10,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 19:01:10,654 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:10,654 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 19:01:10,654 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 19:01:10,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:10,654 INFO L82 PathProgramCache]: Analyzing trace with hash -871587162, now seen corresponding path program 1 times [2019-12-07 19:01:10,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:10,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905594377] [2019-12-07 19:01:10,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:10,685 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 19:01:10,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905594377] [2019-12-07 19:01:10,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:10,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:01:10,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620555898] [2019-12-07 19:01:10,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:01:10,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:10,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:01:10,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:01:10,687 INFO L87 Difference]: Start difference. First operand 18203 states and 60116 transitions. Second operand 5 states. [2019-12-07 19:01:10,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:10,720 INFO L93 Difference]: Finished difference Result 4519 states and 13461 transitions. [2019-12-07 19:01:10,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:01:10,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 19:01:10,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:10,727 INFO L225 Difference]: With dead ends: 4519 [2019-12-07 19:01:10,727 INFO L226 Difference]: Without dead ends: 4519 [2019-12-07 19:01:10,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:01:10,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2019-12-07 19:01:10,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 4105. [2019-12-07 19:01:10,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4105 states. [2019-12-07 19:01:10,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 12058 transitions. [2019-12-07 19:01:10,776 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 12058 transitions. Word has length 24 [2019-12-07 19:01:10,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:10,776 INFO L462 AbstractCegarLoop]: Abstraction has 4105 states and 12058 transitions. [2019-12-07 19:01:10,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:01:10,776 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 12058 transitions. [2019-12-07 19:01:10,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 19:01:10,780 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:10,780 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 19:01:10,780 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 19:01:10,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:10,780 INFO L82 PathProgramCache]: Analyzing trace with hash 808807491, now seen corresponding path program 1 times [2019-12-07 19:01:10,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:10,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394524917] [2019-12-07 19:01:10,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:10,815 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 19:01:10,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394524917] [2019-12-07 19:01:10,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:10,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:01:10,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961758064] [2019-12-07 19:01:10,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:01:10,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:10,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:01:10,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:01:10,817 INFO L87 Difference]: Start difference. First operand 4105 states and 12058 transitions. Second operand 5 states. [2019-12-07 19:01:10,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:10,931 INFO L93 Difference]: Finished difference Result 5269 states and 15043 transitions. [2019-12-07 19:01:10,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:01:10,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-07 19:01:10,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:10,936 INFO L225 Difference]: With dead ends: 5269 [2019-12-07 19:01:10,936 INFO L226 Difference]: Without dead ends: 5233 [2019-12-07 19:01:10,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:01:10,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5233 states. [2019-12-07 19:01:10,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5233 to 4281. [2019-12-07 19:01:10,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4281 states. [2019-12-07 19:01:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 12550 transitions. [2019-12-07 19:01:10,986 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 12550 transitions. Word has length 32 [2019-12-07 19:01:10,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:10,986 INFO L462 AbstractCegarLoop]: Abstraction has 4281 states and 12550 transitions. [2019-12-07 19:01:10,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:01:10,987 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 12550 transitions. [2019-12-07 19:01:10,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 19:01:10,991 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:10,991 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 19:01:10,991 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 19:01:10,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:10,991 INFO L82 PathProgramCache]: Analyzing trace with hash 911486793, now seen corresponding path program 1 times [2019-12-07 19:01:10,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:10,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463963816] [2019-12-07 19:01:10,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:11,011 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 19:01:11,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463963816] [2019-12-07 19:01:11,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:11,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:01:11,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412567144] [2019-12-07 19:01:11,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:01:11,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:11,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:01:11,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:01:11,012 INFO L87 Difference]: Start difference. First operand 4281 states and 12550 transitions. Second operand 3 states. [2019-12-07 19:01:11,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:11,054 INFO L93 Difference]: Finished difference Result 4869 states and 13562 transitions. [2019-12-07 19:01:11,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:01:11,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 19:01:11,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:11,060 INFO L225 Difference]: With dead ends: 4869 [2019-12-07 19:01:11,060 INFO L226 Difference]: Without dead ends: 4869 [2019-12-07 19:01:11,061 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 19:01:11,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4869 states. [2019-12-07 19:01:11,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4869 to 4279. [2019-12-07 19:01:11,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4279 states. [2019-12-07 19:01:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4279 states to 4279 states and 11975 transitions. [2019-12-07 19:01:11,112 INFO L78 Accepts]: Start accepts. Automaton has 4279 states and 11975 transitions. Word has length 32 [2019-12-07 19:01:11,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:11,112 INFO L462 AbstractCegarLoop]: Abstraction has 4279 states and 11975 transitions. [2019-12-07 19:01:11,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:01:11,112 INFO L276 IsEmpty]: Start isEmpty. Operand 4279 states and 11975 transitions. [2019-12-07 19:01:11,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 19:01:11,116 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:11,116 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 19:01:11,117 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 19:01:11,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:11,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1231778147, now seen corresponding path program 1 times [2019-12-07 19:01:11,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:11,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472756753] [2019-12-07 19:01:11,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:11,157 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 19:01:11,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472756753] [2019-12-07 19:01:11,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:11,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:01:11,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918865920] [2019-12-07 19:01:11,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:01:11,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:11,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:01:11,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:01:11,159 INFO L87 Difference]: Start difference. First operand 4279 states and 11975 transitions. Second operand 6 states. [2019-12-07 19:01:11,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:11,196 INFO L93 Difference]: Finished difference Result 2999 states and 9005 transitions. [2019-12-07 19:01:11,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:01:11,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 19:01:11,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:11,200 INFO L225 Difference]: With dead ends: 2999 [2019-12-07 19:01:11,201 INFO L226 Difference]: Without dead ends: 2987 [2019-12-07 19:01:11,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:01:11,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2019-12-07 19:01:11,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2446. [2019-12-07 19:01:11,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2446 states. [2019-12-07 19:01:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 7681 transitions. [2019-12-07 19:01:11,236 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 7681 transitions. Word has length 33 [2019-12-07 19:01:11,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:11,237 INFO L462 AbstractCegarLoop]: Abstraction has 2446 states and 7681 transitions. [2019-12-07 19:01:11,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:01:11,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 7681 transitions. [2019-12-07 19:01:11,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 19:01:11,240 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:11,240 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 19:01:11,240 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 19:01:11,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:11,240 INFO L82 PathProgramCache]: Analyzing trace with hash -2080368215, now seen corresponding path program 1 times [2019-12-07 19:01:11,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:11,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884085844] [2019-12-07 19:01:11,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:11,313 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 19:01:11,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884085844] [2019-12-07 19:01:11,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:11,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:01:11,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146895419] [2019-12-07 19:01:11,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:01:11,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:11,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:01:11,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:01:11,315 INFO L87 Difference]: Start difference. First operand 2446 states and 7681 transitions. Second operand 5 states. [2019-12-07 19:01:11,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:11,346 INFO L93 Difference]: Finished difference Result 3414 states and 10269 transitions. [2019-12-07 19:01:11,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:01:11,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-07 19:01:11,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:11,358 INFO L225 Difference]: With dead ends: 3414 [2019-12-07 19:01:11,358 INFO L226 Difference]: Without dead ends: 2192 [2019-12-07 19:01:11,359 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:01:11,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-12-07 19:01:11,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2192. [2019-12-07 19:01:11,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2192 states. [2019-12-07 19:01:11,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 6796 transitions. [2019-12-07 19:01:11,393 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 6796 transitions. Word has length 48 [2019-12-07 19:01:11,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:11,393 INFO L462 AbstractCegarLoop]: Abstraction has 2192 states and 6796 transitions. [2019-12-07 19:01:11,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:01:11,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 6796 transitions. [2019-12-07 19:01:11,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 19:01:11,397 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:11,397 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 19:01:11,397 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 19:01:11,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:11,398 INFO L82 PathProgramCache]: Analyzing trace with hash -229481117, now seen corresponding path program 2 times [2019-12-07 19:01:11,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:11,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244777534] [2019-12-07 19:01:11,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:11,470 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 19:01:11,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244777534] [2019-12-07 19:01:11,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:11,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:01:11,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475579097] [2019-12-07 19:01:11,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:01:11,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:11,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:01:11,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:01:11,472 INFO L87 Difference]: Start difference. First operand 2192 states and 6796 transitions. Second operand 6 states. [2019-12-07 19:01:11,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:11,658 INFO L93 Difference]: Finished difference Result 6254 states and 19347 transitions. [2019-12-07 19:01:11,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 19:01:11,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-12-07 19:01:11,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:11,664 INFO L225 Difference]: With dead ends: 6254 [2019-12-07 19:01:11,664 INFO L226 Difference]: Without dead ends: 5690 [2019-12-07 19:01:11,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:01:11,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5690 states. [2019-12-07 19:01:11,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5690 to 3298. [2019-12-07 19:01:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3298 states. [2019-12-07 19:01:11,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3298 states to 3298 states and 10039 transitions. [2019-12-07 19:01:11,708 INFO L78 Accepts]: Start accepts. Automaton has 3298 states and 10039 transitions. Word has length 48 [2019-12-07 19:01:11,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:11,708 INFO L462 AbstractCegarLoop]: Abstraction has 3298 states and 10039 transitions. [2019-12-07 19:01:11,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:01:11,708 INFO L276 IsEmpty]: Start isEmpty. Operand 3298 states and 10039 transitions. [2019-12-07 19:01:11,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 19:01:11,712 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:11,712 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 19:01:11,712 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 19:01:11,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:11,713 INFO L82 PathProgramCache]: Analyzing trace with hash -650781317, now seen corresponding path program 3 times [2019-12-07 19:01:11,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:11,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678916828] [2019-12-07 19:01:11,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:11,751 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 19:01:11,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678916828] [2019-12-07 19:01:11,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:11,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:01:11,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965575717] [2019-12-07 19:01:11,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:01:11,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:11,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:01:11,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:01:11,752 INFO L87 Difference]: Start difference. First operand 3298 states and 10039 transitions. Second operand 4 states. [2019-12-07 19:01:11,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:11,775 INFO L93 Difference]: Finished difference Result 3854 states and 11239 transitions. [2019-12-07 19:01:11,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:01:11,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 19:01:11,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:11,778 INFO L225 Difference]: With dead ends: 3854 [2019-12-07 19:01:11,778 INFO L226 Difference]: Without dead ends: 2333 [2019-12-07 19:01:11,779 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 19:01:11,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2333 states. [2019-12-07 19:01:11,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2333 to 2333. [2019-12-07 19:01:11,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2333 states. [2019-12-07 19:01:11,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 2333 states and 6431 transitions. [2019-12-07 19:01:11,803 INFO L78 Accepts]: Start accepts. Automaton has 2333 states and 6431 transitions. Word has length 48 [2019-12-07 19:01:11,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:11,803 INFO L462 AbstractCegarLoop]: Abstraction has 2333 states and 6431 transitions. [2019-12-07 19:01:11,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:01:11,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 6431 transitions. [2019-12-07 19:01:11,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 19:01:11,806 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:11,806 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 19:01:11,806 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 19:01:11,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:11,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1345283023, now seen corresponding path program 4 times [2019-12-07 19:01:11,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:11,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165973168] [2019-12-07 19:01:11,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:11,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:01:11,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165973168] [2019-12-07 19:01:11,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:11,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:01:11,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362542732] [2019-12-07 19:01:11,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:01:11,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:11,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:01:11,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:01:11,873 INFO L87 Difference]: Start difference. First operand 2333 states and 6431 transitions. Second operand 7 states. [2019-12-07 19:01:12,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:12,034 INFO L93 Difference]: Finished difference Result 4180 states and 11323 transitions. [2019-12-07 19:01:12,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 19:01:12,035 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-07 19:01:12,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:12,037 INFO L225 Difference]: With dead ends: 4180 [2019-12-07 19:01:12,037 INFO L226 Difference]: Without dead ends: 3032 [2019-12-07 19:01:12,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:01:12,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3032 states. [2019-12-07 19:01:12,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3032 to 1789. [2019-12-07 19:01:12,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1789 states. [2019-12-07 19:01:12,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 4943 transitions. [2019-12-07 19:01:12,061 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 4943 transitions. Word has length 48 [2019-12-07 19:01:12,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:12,062 INFO L462 AbstractCegarLoop]: Abstraction has 1789 states and 4943 transitions. [2019-12-07 19:01:12,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:01:12,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 4943 transitions. [2019-12-07 19:01:12,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 19:01:12,064 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:12,064 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 19:01:12,064 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 19:01:12,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:12,064 INFO L82 PathProgramCache]: Analyzing trace with hash -347920659, now seen corresponding path program 5 times [2019-12-07 19:01:12,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:12,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899511306] [2019-12-07 19:01:12,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:12,101 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 19:01:12,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899511306] [2019-12-07 19:01:12,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:12,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:01:12,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083250728] [2019-12-07 19:01:12,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:01:12,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:12,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:01:12,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:01:12,103 INFO L87 Difference]: Start difference. First operand 1789 states and 4943 transitions. Second operand 4 states. [2019-12-07 19:01:12,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:12,119 INFO L93 Difference]: Finished difference Result 2227 states and 5888 transitions. [2019-12-07 19:01:12,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:01:12,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 19:01:12,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:12,121 INFO L225 Difference]: With dead ends: 2227 [2019-12-07 19:01:12,121 INFO L226 Difference]: Without dead ends: 486 [2019-12-07 19:01:12,121 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 19:01:12,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-12-07 19:01:12,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2019-12-07 19:01:12,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-12-07 19:01:12,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1030 transitions. [2019-12-07 19:01:12,127 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1030 transitions. Word has length 48 [2019-12-07 19:01:12,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:12,127 INFO L462 AbstractCegarLoop]: Abstraction has 486 states and 1030 transitions. [2019-12-07 19:01:12,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:01:12,127 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1030 transitions. [2019-12-07 19:01:12,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 19:01:12,128 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:12,128 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 19:01:12,128 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 19:01:12,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:12,129 INFO L82 PathProgramCache]: Analyzing trace with hash -954630289, now seen corresponding path program 6 times [2019-12-07 19:01:12,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:12,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172438662] [2019-12-07 19:01:12,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:12,194 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 19:01:12,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172438662] [2019-12-07 19:01:12,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:12,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:01:12,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972517085] [2019-12-07 19:01:12,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:01:12,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:01:12,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:01:12,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:01:12,196 INFO L87 Difference]: Start difference. First operand 486 states and 1030 transitions. Second operand 7 states. [2019-12-07 19:01:12,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:12,324 INFO L93 Difference]: Finished difference Result 862 states and 1799 transitions. [2019-12-07 19:01:12,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 19:01:12,325 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-07 19:01:12,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:12,325 INFO L225 Difference]: With dead ends: 862 [2019-12-07 19:01:12,325 INFO L226 Difference]: Without dead ends: 576 [2019-12-07 19:01:12,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:01:12,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-12-07 19:01:12,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 518. [2019-12-07 19:01:12,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-12-07 19:01:12,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 1090 transitions. [2019-12-07 19:01:12,332 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 1090 transitions. Word has length 48 [2019-12-07 19:01:12,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:12,332 INFO L462 AbstractCegarLoop]: Abstraction has 518 states and 1090 transitions. [2019-12-07 19:01:12,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:01:12,333 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 1090 transitions. [2019-12-07 19:01:12,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 19:01:12,333 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:12,334 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 19:01:12,334 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:01:12,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:12,334 INFO L82 PathProgramCache]: Analyzing trace with hash 477153033, now seen corresponding path program 7 times [2019-12-07 19:01:12,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:01:12,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596017195] [2019-12-07 19:01:12,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:01:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:01:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:01:12,422 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 19:01:12,422 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:01:12,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_99| 0 0))) (and (< 0 |v_#StackHeapBarrier_23|) (= v_~z$r_buff0_thd0~0_139 0) (= 0 v_~z$r_buff0_thd3~0_325) (= 0 v_~z$r_buff0_thd4~0_238) (= v_~weak$$choice2~0_127 0) (= 0 v_~__unbuffered_p0_EAX~0_49) (= 0 |v_ULTIMATE.start_main_~#t949~0.offset_29|) (= v_~z$w_buff0~0_307 0) (= v_~__unbuffered_p3_EAX~0_136 0) (= 0 v_~__unbuffered_p2_EAX~0_47) (= 0 v_~__unbuffered_p3_EBX~0_136) (= |v_#valid_97| (store .cse0 |v_ULTIMATE.start_main_~#t949~0.base_44| 1)) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff1_thd0~0_179 0) (= 0 v_~z$r_buff1_thd4~0_175) (= v_~z$w_buff0_used~0_604 0) (= 0 |v_#NULL.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_~#t949~0.base_44|) 0) (= v_~z~0_135 0) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~weak$$choice0~0_20) (= v_~z$w_buff1~0_205 0) (= v_~z$r_buff1_thd1~0_119 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_119 0) (= v_~b~0_92 0) (= v_~z$r_buff0_thd2~0_73 0) (= v_~z$r_buff0_thd1~0_73 0) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t949~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t949~0.base_44|) |v_ULTIMATE.start_main_~#t949~0.offset_29| 0)) |v_#memory_int_29|) (= v_~a~0_119 0) (= |v_#NULL.offset_4| 0) (= v_~x~0_37 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t949~0.base_44| 4)) (= v_~z$w_buff1_used~0_405 0) (= 0 v_~z$flush_delayed~0_40) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff1_thd3~0_260) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~y~0_31 0) (= v_~__unbuffered_cnt~0_126 0) (< |v_#StackHeapBarrier_23| |v_ULTIMATE.start_main_~#t949~0.base_44|) (= v_~z$mem_tmp~0_21 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_23|, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_~#t950~0.base=|v_ULTIMATE.start_main_~#t950~0.base_39|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_119, #NULL.offset=|v_#NULL.offset_4|, ~a~0=v_~a~0_119, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, ULTIMATE.start_main_~#t951~0.offset=|v_ULTIMATE.start_main_~#t951~0.offset_26|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_238, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_136, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ULTIMATE.start_main_~#t949~0.offset=|v_ULTIMATE.start_main_~#t949~0.offset_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ULTIMATE.start_main_~#t949~0.base=|v_ULTIMATE.start_main_~#t949~0.base_44|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_85|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_405, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_43|, ULTIMATE.start_main_~#t950~0.offset=|v_ULTIMATE.start_main_~#t950~0.offset_26|, ~z$flush_delayed~0=v_~z$flush_delayed~0_40, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_23|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_31|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_119, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_325, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_37, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_175, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_21|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t952~0.offset=|v_ULTIMATE.start_main_~#t952~0.offset_20|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_179, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_73, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_604, ~z$w_buff0~0=v_~z$w_buff0~0_307, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_260, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_59|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_~#t952~0.base=|v_ULTIMATE.start_main_~#t952~0.base_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_136, ULTIMATE.start_main_~#t951~0.base=|v_ULTIMATE.start_main_~#t951~0.base_39|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_63|, ~b~0=v_~b~0_92, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_127, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_73} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t950~0.base, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t951~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t949~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_~#t949~0.base, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t950~0.offset, ~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, ULTIMATE.start_main_~#t952~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, ULTIMATE.start_main_~#t952~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t951~0.base, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 19:01:12,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L845-1-->L847: Formula: (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t950~0.base_12| 4)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t950~0.base_12|)) (= |v_ULTIMATE.start_main_~#t950~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t950~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t950~0.base_12|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t950~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t950~0.base_12|) |v_ULTIMATE.start_main_~#t950~0.offset_10| 1)) |v_#memory_int_17|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t950~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t950~0.base=|v_ULTIMATE.start_main_~#t950~0.base_12|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_~#t950~0.offset=|v_ULTIMATE.start_main_~#t950~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t950~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t950~0.offset] because there is no mapped edge [2019-12-07 19:01:12,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L847-1-->L849: Formula: (and (= (store |v_#valid_55| |v_ULTIMATE.start_main_~#t951~0.base_13| 1) |v_#valid_54|) (= 0 (select |v_#valid_55| |v_ULTIMATE.start_main_~#t951~0.base_13|)) (= |v_ULTIMATE.start_main_~#t951~0.offset_11| 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t951~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t951~0.base_13|) |v_ULTIMATE.start_main_~#t951~0.offset_11| 2))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t951~0.base_13| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t951~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t951~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t951~0.offset=|v_ULTIMATE.start_main_~#t951~0.offset_11|, #length=|v_#length_23|, ULTIMATE.start_main_~#t951~0.base=|v_ULTIMATE.start_main_~#t951~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t951~0.offset, #length, ULTIMATE.start_main_~#t951~0.base] because there is no mapped edge [2019-12-07 19:01:12,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L849-1-->L851: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t952~0.base_10| 4)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t952~0.base_10| 1) |v_#valid_46|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t952~0.base_10|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t952~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t952~0.base_10|) |v_ULTIMATE.start_main_~#t952~0.offset_9| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t952~0.base_10|) (= |v_ULTIMATE.start_main_~#t952~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t952~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_4|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t952~0.base=|v_ULTIMATE.start_main_~#t952~0.base_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t952~0.offset=|v_ULTIMATE.start_main_~#t952~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t952~0.base, #length, ULTIMATE.start_main_~#t952~0.offset] because there is no mapped edge [2019-12-07 19:01:12,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L4-->L822: Formula: (and (= v_~z$r_buff0_thd4~0_24 v_~z$r_buff1_thd4~0_12) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_14 0)) (= 1 v_~a~0_5) (= v_~__unbuffered_p3_EBX~0_6 v_~b~0_6) (= v_~z$r_buff1_thd1~0_5 v_~z$r_buff0_thd1~0_6) (= v_~z$r_buff0_thd0~0_23 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff1_thd2~0_5 v_~z$r_buff0_thd2~0_6) (= v_~__unbuffered_p3_EAX~0_7 v_~a~0_5) (= v_~z$r_buff0_thd3~0_49 v_~z$r_buff1_thd3~0_27) (= v_~z$r_buff0_thd4~0_23 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_14, ~b~0=v_~b~0_6, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_24, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_49, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_6} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_14, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_12, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_6, ~a~0=v_~a~0_5, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, ~b~0=v_~b~0_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_5, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_7, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_23, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_49, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_6} 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 19:01:12,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_20 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_20) (= v_~__unbuffered_cnt~0_112 (+ v_~__unbuffered_cnt~0_113 1)) (= v_~x~0_33 v_~__unbuffered_p0_EAX~0_27) (= v_~b~0_68 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_113, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_33} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, ~b~0=v_~b~0_68, 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_112, 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_33} 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 19:01:12,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] P1ENTRY-->P1EXIT: Formula: (and (= v_~y~0_25 v_~__unbuffered_p1_EAX~0_19) (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_~x~0_30 1) (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_15| v_P1Thread1of1ForFork0_~arg.offset_13) (= v_P1Thread1of1ForFork0_~arg.base_13 |v_P1Thread1of1ForFork0_#in~arg.base_15|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_15|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~y~0=v_~y~0_25} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_13, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_15|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_25, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 19:01:12,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In179325246 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite8_In179325246| |P2Thread1of1ForFork1_#t~ite8_Out179325246|) (= ~z$w_buff0~0_In179325246 |P2Thread1of1ForFork1_#t~ite9_Out179325246|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In179325246 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In179325246 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In179325246 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In179325246 256)) .cse1))) (= |P2Thread1of1ForFork1_#t~ite9_Out179325246| |P2Thread1of1ForFork1_#t~ite8_Out179325246|) .cse0 (= ~z$w_buff0~0_In179325246 |P2Thread1of1ForFork1_#t~ite8_Out179325246|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In179325246, ~z$w_buff0_used~0=~z$w_buff0_used~0_In179325246, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In179325246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In179325246, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In179325246, ~weak$$choice2~0=~weak$$choice2~0_In179325246, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In179325246|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In179325246, ~z$w_buff0_used~0=~z$w_buff0_used~0_In179325246, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In179325246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In179325246, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In179325246, ~weak$$choice2~0=~weak$$choice2~0_In179325246, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out179325246|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out179325246|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 19:01:12,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L784-->L785: Formula: (and (= v_~z$r_buff0_thd3~0_131 v_~z$r_buff0_thd3~0_130) (not (= (mod v_~weak$$choice2~0_38 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_10|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_6|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_38, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_13|} 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 19:01:12,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] L787-->L795: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_14 256))) (= 0 v_~z$flush_delayed~0_13) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= v_~z~0_40 v_~z$mem_tmp~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ~z$flush_delayed~0=v_~z$flush_delayed~0_14} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_9|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 19:01:12,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1590328055 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1590328055 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out-1590328055| ~z$w_buff0_used~0_In-1590328055)) (and (= |P3Thread1of1ForFork2_#t~ite28_Out-1590328055| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1590328055, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1590328055} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1590328055|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1590328055, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1590328055} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 19:01:12,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1978141499 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1978141499 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1978141499 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In1978141499 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite29_Out1978141499| 0)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork2_#t~ite29_Out1978141499| ~z$w_buff1_used~0_In1978141499) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1978141499, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1978141499, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1978141499, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1978141499} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1978141499|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1978141499, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1978141499, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1978141499, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1978141499} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 19:01:12,438 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L825-->L826: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In2096769610 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_Out2096769610 ~z$r_buff0_thd4~0_In2096769610)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2096769610 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out2096769610) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2096769610} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out2096769610, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out2096769610|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-07 19:01:12,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1207685159 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In1207685159 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In1207685159 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1207685159 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite31_Out1207685159| ~z$r_buff1_thd4~0_In1207685159) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite31_Out1207685159| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1207685159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1207685159, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1207685159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1207685159} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1207685159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1207685159, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1207685159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1207685159, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out1207685159|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 19:01:12,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L826-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite31_42| v_~z$r_buff1_thd4~0_61) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, 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_61, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, 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 19:01:12,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L851-1-->L857: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_50) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:01:12,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L857-2-->L857-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In89039659 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In89039659 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In89039659 |ULTIMATE.start_main_#t~ite36_Out89039659|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite36_Out89039659| ~z~0_In89039659)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In89039659, ~z$w_buff1_used~0=~z$w_buff1_used~0_In89039659, ~z$w_buff1~0=~z$w_buff1~0_In89039659, ~z~0=~z~0_In89039659} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In89039659, ~z$w_buff1_used~0=~z$w_buff1_used~0_In89039659, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out89039659|, ~z$w_buff1~0=~z$w_buff1~0_In89039659, ~z~0=~z~0_In89039659} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 19:01:12,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L857-4-->L858: Formula: (= v_~z~0_18 |v_ULTIMATE.start_main_#t~ite36_15|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_6|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-07 19:01:12,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1291914956 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1291914956 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out-1291914956| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out-1291914956| ~z$w_buff0_used~0_In-1291914956) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1291914956, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1291914956} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1291914956, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1291914956, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1291914956|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 19:01:12,440 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L859-->L859-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In908169825 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In908169825 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In908169825 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In908169825 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite39_Out908169825| ~z$w_buff1_used~0_In908169825)) (and (= |ULTIMATE.start_main_#t~ite39_Out908169825| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In908169825, ~z$w_buff0_used~0=~z$w_buff0_used~0_In908169825, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In908169825, ~z$w_buff1_used~0=~z$w_buff1_used~0_In908169825} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In908169825, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out908169825|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In908169825, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In908169825, ~z$w_buff1_used~0=~z$w_buff1_used~0_In908169825} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 19:01:12,441 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L860-->L860-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1210292619 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1210292619 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1210292619| ~z$r_buff0_thd0~0_In1210292619)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite40_Out1210292619|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1210292619, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1210292619, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1210292619|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 19:01:12,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L861-->L861-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1214179106 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1214179106 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1214179106 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1214179106 256)))) (or (and (= ~z$r_buff1_thd0~0_In-1214179106 |ULTIMATE.start_main_#t~ite41_Out-1214179106|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite41_Out-1214179106|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1214179106, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1214179106, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1214179106, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1214179106} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1214179106|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1214179106, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1214179106, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1214179106, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1214179106} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 19:01:12,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L861-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_23 256)) (= v_~z$r_buff1_thd0~0_157 |v_ULTIMATE.start_main_#t~ite41_37|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~main$tmp_guard1~0_23 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_117) (= v_~__unbuffered_p3_EAX~0_117 1) (= 0 v_~__unbuffered_p2_EAX~0_31) (= 0 v_~__unbuffered_p0_EAX~0_34) (= 0 v_~__unbuffered_p1_EAX~0_26))) 1 0)) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_117, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_117} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_157, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_117, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_117, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} 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 19:01:12,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:01:12 BasicIcfg [2019-12-07 19:01:12,497 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:01:12,498 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:01:12,498 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:01:12,498 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:01:12,498 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:00:54" (3/4) ... [2019-12-07 19:01:12,500 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 19:01:12,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_99| 0 0))) (and (< 0 |v_#StackHeapBarrier_23|) (= v_~z$r_buff0_thd0~0_139 0) (= 0 v_~z$r_buff0_thd3~0_325) (= 0 v_~z$r_buff0_thd4~0_238) (= v_~weak$$choice2~0_127 0) (= 0 v_~__unbuffered_p0_EAX~0_49) (= 0 |v_ULTIMATE.start_main_~#t949~0.offset_29|) (= v_~z$w_buff0~0_307 0) (= v_~__unbuffered_p3_EAX~0_136 0) (= 0 v_~__unbuffered_p2_EAX~0_47) (= 0 v_~__unbuffered_p3_EBX~0_136) (= |v_#valid_97| (store .cse0 |v_ULTIMATE.start_main_~#t949~0.base_44| 1)) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff1_thd0~0_179 0) (= 0 v_~z$r_buff1_thd4~0_175) (= v_~z$w_buff0_used~0_604 0) (= 0 |v_#NULL.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_~#t949~0.base_44|) 0) (= v_~z~0_135 0) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~weak$$choice0~0_20) (= v_~z$w_buff1~0_205 0) (= v_~z$r_buff1_thd1~0_119 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_119 0) (= v_~b~0_92 0) (= v_~z$r_buff0_thd2~0_73 0) (= v_~z$r_buff0_thd1~0_73 0) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t949~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t949~0.base_44|) |v_ULTIMATE.start_main_~#t949~0.offset_29| 0)) |v_#memory_int_29|) (= v_~a~0_119 0) (= |v_#NULL.offset_4| 0) (= v_~x~0_37 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t949~0.base_44| 4)) (= v_~z$w_buff1_used~0_405 0) (= 0 v_~z$flush_delayed~0_40) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff1_thd3~0_260) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~y~0_31 0) (= v_~__unbuffered_cnt~0_126 0) (< |v_#StackHeapBarrier_23| |v_ULTIMATE.start_main_~#t949~0.base_44|) (= v_~z$mem_tmp~0_21 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_23|, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_~#t950~0.base=|v_ULTIMATE.start_main_~#t950~0.base_39|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_119, #NULL.offset=|v_#NULL.offset_4|, ~a~0=v_~a~0_119, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, ULTIMATE.start_main_~#t951~0.offset=|v_ULTIMATE.start_main_~#t951~0.offset_26|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_238, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_136, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ULTIMATE.start_main_~#t949~0.offset=|v_ULTIMATE.start_main_~#t949~0.offset_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ULTIMATE.start_main_~#t949~0.base=|v_ULTIMATE.start_main_~#t949~0.base_44|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_85|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_405, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_43|, ULTIMATE.start_main_~#t950~0.offset=|v_ULTIMATE.start_main_~#t950~0.offset_26|, ~z$flush_delayed~0=v_~z$flush_delayed~0_40, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_23|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_31|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_119, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_325, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_37, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_175, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_21|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t952~0.offset=|v_ULTIMATE.start_main_~#t952~0.offset_20|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_179, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_73, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_604, ~z$w_buff0~0=v_~z$w_buff0~0_307, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_260, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_59|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_~#t952~0.base=|v_ULTIMATE.start_main_~#t952~0.base_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_136, ULTIMATE.start_main_~#t951~0.base=|v_ULTIMATE.start_main_~#t951~0.base_39|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_63|, ~b~0=v_~b~0_92, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_127, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_73} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t950~0.base, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t951~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t949~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_~#t949~0.base, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t950~0.offset, ~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, ULTIMATE.start_main_~#t952~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, ULTIMATE.start_main_~#t952~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t951~0.base, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 19:01:12,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L845-1-->L847: Formula: (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t950~0.base_12| 4)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t950~0.base_12|)) (= |v_ULTIMATE.start_main_~#t950~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t950~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t950~0.base_12|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t950~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t950~0.base_12|) |v_ULTIMATE.start_main_~#t950~0.offset_10| 1)) |v_#memory_int_17|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t950~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t950~0.base=|v_ULTIMATE.start_main_~#t950~0.base_12|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_~#t950~0.offset=|v_ULTIMATE.start_main_~#t950~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t950~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t950~0.offset] because there is no mapped edge [2019-12-07 19:01:12,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L847-1-->L849: Formula: (and (= (store |v_#valid_55| |v_ULTIMATE.start_main_~#t951~0.base_13| 1) |v_#valid_54|) (= 0 (select |v_#valid_55| |v_ULTIMATE.start_main_~#t951~0.base_13|)) (= |v_ULTIMATE.start_main_~#t951~0.offset_11| 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t951~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t951~0.base_13|) |v_ULTIMATE.start_main_~#t951~0.offset_11| 2))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t951~0.base_13| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t951~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t951~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t951~0.offset=|v_ULTIMATE.start_main_~#t951~0.offset_11|, #length=|v_#length_23|, ULTIMATE.start_main_~#t951~0.base=|v_ULTIMATE.start_main_~#t951~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t951~0.offset, #length, ULTIMATE.start_main_~#t951~0.base] because there is no mapped edge [2019-12-07 19:01:12,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L849-1-->L851: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t952~0.base_10| 4)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t952~0.base_10| 1) |v_#valid_46|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t952~0.base_10|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t952~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t952~0.base_10|) |v_ULTIMATE.start_main_~#t952~0.offset_9| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t952~0.base_10|) (= |v_ULTIMATE.start_main_~#t952~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t952~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_4|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t952~0.base=|v_ULTIMATE.start_main_~#t952~0.base_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t952~0.offset=|v_ULTIMATE.start_main_~#t952~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t952~0.base, #length, ULTIMATE.start_main_~#t952~0.offset] because there is no mapped edge [2019-12-07 19:01:12,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L4-->L822: Formula: (and (= v_~z$r_buff0_thd4~0_24 v_~z$r_buff1_thd4~0_12) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_14 0)) (= 1 v_~a~0_5) (= v_~__unbuffered_p3_EBX~0_6 v_~b~0_6) (= v_~z$r_buff1_thd1~0_5 v_~z$r_buff0_thd1~0_6) (= v_~z$r_buff0_thd0~0_23 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff1_thd2~0_5 v_~z$r_buff0_thd2~0_6) (= v_~__unbuffered_p3_EAX~0_7 v_~a~0_5) (= v_~z$r_buff0_thd3~0_49 v_~z$r_buff1_thd3~0_27) (= v_~z$r_buff0_thd4~0_23 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_14, ~b~0=v_~b~0_6, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_24, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_49, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_6} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_14, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_12, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_6, ~a~0=v_~a~0_5, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, ~b~0=v_~b~0_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_5, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_7, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_23, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_49, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_6} 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 19:01:12,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_20 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_20) (= v_~__unbuffered_cnt~0_112 (+ v_~__unbuffered_cnt~0_113 1)) (= v_~x~0_33 v_~__unbuffered_p0_EAX~0_27) (= v_~b~0_68 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_113, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_33} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, ~b~0=v_~b~0_68, 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_112, 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_33} 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 19:01:12,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] P1ENTRY-->P1EXIT: Formula: (and (= v_~y~0_25 v_~__unbuffered_p1_EAX~0_19) (= 0 |v_P1Thread1of1ForFork0_#res.base_7|) (= v_~x~0_30 1) (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P1Thread1of1ForFork0_#res.offset_7|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_15| v_P1Thread1of1ForFork0_~arg.offset_13) (= v_P1Thread1of1ForFork0_~arg.base_13 |v_P1Thread1of1ForFork0_#in~arg.base_15|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_15|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~y~0=v_~y~0_25} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_13, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_15|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, ~y~0=v_~y~0_25, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 19:01:12,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In179325246 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite8_In179325246| |P2Thread1of1ForFork1_#t~ite8_Out179325246|) (= ~z$w_buff0~0_In179325246 |P2Thread1of1ForFork1_#t~ite9_Out179325246|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In179325246 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In179325246 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In179325246 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In179325246 256)) .cse1))) (= |P2Thread1of1ForFork1_#t~ite9_Out179325246| |P2Thread1of1ForFork1_#t~ite8_Out179325246|) .cse0 (= ~z$w_buff0~0_In179325246 |P2Thread1of1ForFork1_#t~ite8_Out179325246|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In179325246, ~z$w_buff0_used~0=~z$w_buff0_used~0_In179325246, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In179325246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In179325246, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In179325246, ~weak$$choice2~0=~weak$$choice2~0_In179325246, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In179325246|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In179325246, ~z$w_buff0_used~0=~z$w_buff0_used~0_In179325246, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In179325246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In179325246, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In179325246, ~weak$$choice2~0=~weak$$choice2~0_In179325246, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out179325246|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out179325246|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 19:01:12,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L784-->L785: Formula: (and (= v_~z$r_buff0_thd3~0_131 v_~z$r_buff0_thd3~0_130) (not (= (mod v_~weak$$choice2~0_38 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_10|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_6|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_38, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_13|} 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 19:01:12,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] L787-->L795: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_14 256))) (= 0 v_~z$flush_delayed~0_13) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= v_~z~0_40 v_~z$mem_tmp~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ~z$flush_delayed~0=v_~z$flush_delayed~0_14} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_9|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 19:01:12,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1590328055 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1590328055 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out-1590328055| ~z$w_buff0_used~0_In-1590328055)) (and (= |P3Thread1of1ForFork2_#t~ite28_Out-1590328055| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1590328055, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1590328055} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1590328055|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1590328055, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1590328055} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 19:01:12,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1978141499 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1978141499 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1978141499 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In1978141499 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite29_Out1978141499| 0)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork2_#t~ite29_Out1978141499| ~z$w_buff1_used~0_In1978141499) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1978141499, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1978141499, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1978141499, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1978141499} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1978141499|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1978141499, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1978141499, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1978141499, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1978141499} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 19:01:12,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L825-->L826: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In2096769610 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_Out2096769610 ~z$r_buff0_thd4~0_In2096769610)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2096769610 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out2096769610) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2096769610} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out2096769610, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out2096769610|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-07 19:01:12,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1207685159 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In1207685159 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In1207685159 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1207685159 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite31_Out1207685159| ~z$r_buff1_thd4~0_In1207685159) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite31_Out1207685159| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1207685159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1207685159, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1207685159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1207685159} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1207685159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1207685159, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1207685159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1207685159, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out1207685159|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 19:01:12,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L826-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite31_42| v_~z$r_buff1_thd4~0_61) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, 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_61, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, 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 19:01:12,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L851-1-->L857: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_50) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:01:12,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L857-2-->L857-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In89039659 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In89039659 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In89039659 |ULTIMATE.start_main_#t~ite36_Out89039659|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite36_Out89039659| ~z~0_In89039659)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In89039659, ~z$w_buff1_used~0=~z$w_buff1_used~0_In89039659, ~z$w_buff1~0=~z$w_buff1~0_In89039659, ~z~0=~z~0_In89039659} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In89039659, ~z$w_buff1_used~0=~z$w_buff1_used~0_In89039659, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out89039659|, ~z$w_buff1~0=~z$w_buff1~0_In89039659, ~z~0=~z~0_In89039659} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 19:01:12,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L857-4-->L858: Formula: (= v_~z~0_18 |v_ULTIMATE.start_main_#t~ite36_15|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_6|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-07 19:01:12,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1291914956 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1291914956 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out-1291914956| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out-1291914956| ~z$w_buff0_used~0_In-1291914956) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1291914956, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1291914956} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1291914956, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1291914956, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1291914956|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 19:01:12,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L859-->L859-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In908169825 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In908169825 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In908169825 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In908169825 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite39_Out908169825| ~z$w_buff1_used~0_In908169825)) (and (= |ULTIMATE.start_main_#t~ite39_Out908169825| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In908169825, ~z$w_buff0_used~0=~z$w_buff0_used~0_In908169825, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In908169825, ~z$w_buff1_used~0=~z$w_buff1_used~0_In908169825} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In908169825, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out908169825|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In908169825, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In908169825, ~z$w_buff1_used~0=~z$w_buff1_used~0_In908169825} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 19:01:12,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L860-->L860-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1210292619 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1210292619 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1210292619| ~z$r_buff0_thd0~0_In1210292619)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite40_Out1210292619|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1210292619, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1210292619, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1210292619|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 19:01:12,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L861-->L861-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1214179106 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1214179106 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1214179106 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1214179106 256)))) (or (and (= ~z$r_buff1_thd0~0_In-1214179106 |ULTIMATE.start_main_#t~ite41_Out-1214179106|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite41_Out-1214179106|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1214179106, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1214179106, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1214179106, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1214179106} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1214179106|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1214179106, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1214179106, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1214179106, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1214179106} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 19:01:12,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L861-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_23 256)) (= v_~z$r_buff1_thd0~0_157 |v_ULTIMATE.start_main_#t~ite41_37|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~main$tmp_guard1~0_23 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_117) (= v_~__unbuffered_p3_EAX~0_117 1) (= 0 v_~__unbuffered_p2_EAX~0_31) (= 0 v_~__unbuffered_p0_EAX~0_34) (= 0 v_~__unbuffered_p1_EAX~0_26))) 1 0)) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_117, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_117} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_157, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_117, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_117, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} 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 19:01:12,577 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ee3cdcfb-39d5-43cb-820d-0e1c5e2aa588/bin/uautomizer/witness.graphml [2019-12-07 19:01:12,577 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:01:12,578 INFO L168 Benchmark]: Toolchain (without parser) took 18916.97 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 937.0 MB in the beginning and 1.8 GB in the end (delta: -884.2 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-12-07 19:01:12,578 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:01:12,578 INFO L168 Benchmark]: CACSL2BoogieTranslator took 381.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -139.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:01:12,578 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.26 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 19:01:12,579 INFO L168 Benchmark]: Boogie Preprocessor took 24.76 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 19:01:12,579 INFO L168 Benchmark]: RCFGBuilder took 386.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:01:12,579 INFO L168 Benchmark]: TraceAbstraction took 18004.45 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -817.4 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-12-07 19:01:12,579 INFO L168 Benchmark]: Witness Printer took 79.11 ms. Allocated memory is still 3.0 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:01:12,581 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 381.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -139.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.26 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 24.76 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 386.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18004.45 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.8 GB). Free memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: -817.4 MB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 79.11 ms. Allocated memory is still 3.0 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 171 ProgramPointsBefore, 79 ProgramPointsAfterwards, 193 TransitionsBefore, 87 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 39 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 19 ChoiceCompositions, 5629 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 54 SemBasedMoverChecksPositive, 182 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 48496 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t949, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t950, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t951, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t952, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 1 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L822] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, 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=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] [L772] 3 y = 1 [L775] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 3 z$flush_delayed = weak$$choice2 [L778] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 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) [L780] 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)) [L781] EXPR 3 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!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))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1 = 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)) [L782] EXPR 3 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_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))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 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)) [L783] 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 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)) [L785] EXPR 3 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$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))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 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)) [L786] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 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) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 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 [L857] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 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 [L860] 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, 159 locations, 2 error locations. Result: UNSAFE, OverallTime: 17.8s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2705 SDtfs, 2701 SDslu, 4599 SDs, 0 SdLazy, 1121 SolverSat, 98 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39750occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 30046 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 642 NumberOfCodeBlocks, 642 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 574 ConstructedInterpolants, 0 QuantifiedInterpolants, 106782 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...