./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix006_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e5b598f6-2146-461d-89d6-da20e1441978/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e5b598f6-2146-461d-89d6-da20e1441978/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e5b598f6-2146-461d-89d6-da20e1441978/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e5b598f6-2146-461d-89d6-da20e1441978/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix006_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e5b598f6-2146-461d-89d6-da20e1441978/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e5b598f6-2146-461d-89d6-da20e1441978/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 a3d0efa2af6556ea841df2ccfd8d80c5c94f7027 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 17:56:57,698 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:56:57,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:56:57,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:56:57,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:56:57,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:56:57,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:56:57,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:56:57,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:56:57,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:56:57,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:56:57,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:56:57,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:56:57,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:56:57,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:56:57,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:56:57,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:56:57,717 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:56:57,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:56:57,719 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:56:57,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:56:57,721 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:56:57,722 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:56:57,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:56:57,724 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:56:57,724 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:56:57,724 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:56:57,725 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:56:57,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:56:57,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:56:57,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:56:57,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:56:57,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:56:57,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:56:57,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:56:57,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:56:57,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:56:57,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:56:57,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:56:57,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:56:57,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:56:57,730 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e5b598f6-2146-461d-89d6-da20e1441978/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:56:57,739 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:56:57,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:56:57,740 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:56:57,740 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:56:57,740 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:56:57,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:56:57,741 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:56:57,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:56:57,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:56:57,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:56:57,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:56:57,741 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:56:57,741 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:56:57,742 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:56:57,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:56:57,742 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:56:57,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:56:57,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:56:57,742 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:56:57,742 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:56:57,742 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:56:57,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:56:57,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:56:57,743 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:56:57,743 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:56:57,743 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:56:57,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:56:57,743 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:56:57,743 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:56:57,743 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_e5b598f6-2146-461d-89d6-da20e1441978/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 -> a3d0efa2af6556ea841df2ccfd8d80c5c94f7027 [2019-12-07 17:56:57,843 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:56:57,853 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:56:57,856 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:56:57,857 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:56:57,857 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:56:57,858 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e5b598f6-2146-461d-89d6-da20e1441978/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix006_power.opt.i [2019-12-07 17:56:57,898 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e5b598f6-2146-461d-89d6-da20e1441978/bin/uautomizer/data/d98fe48fb/94cb420471d04788bcc3edf885294639/FLAG211e8eb23 [2019-12-07 17:56:58,442 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:56:58,442 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e5b598f6-2146-461d-89d6-da20e1441978/sv-benchmarks/c/pthread-wmm/mix006_power.opt.i [2019-12-07 17:56:58,452 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e5b598f6-2146-461d-89d6-da20e1441978/bin/uautomizer/data/d98fe48fb/94cb420471d04788bcc3edf885294639/FLAG211e8eb23 [2019-12-07 17:56:58,881 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e5b598f6-2146-461d-89d6-da20e1441978/bin/uautomizer/data/d98fe48fb/94cb420471d04788bcc3edf885294639 [2019-12-07 17:56:58,884 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:56:58,885 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:56:58,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:56:58,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:56:58,888 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:56:58,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:56:58" (1/1) ... [2019-12-07 17:56:58,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4060fd46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:58, skipping insertion in model container [2019-12-07 17:56:58,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:56:58" (1/1) ... [2019-12-07 17:56:58,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:56:58,926 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:56:59,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:56:59,184 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:56:59,228 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:56:59,272 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:56:59,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:59 WrapperNode [2019-12-07 17:56:59,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:56:59,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:56:59,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:56:59,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:56:59,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:59" (1/1) ... [2019-12-07 17:56:59,292 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:59" (1/1) ... [2019-12-07 17:56:59,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:56:59,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:56:59,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:56:59,313 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:56:59,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:59" (1/1) ... [2019-12-07 17:56:59,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:59" (1/1) ... [2019-12-07 17:56:59,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:59" (1/1) ... [2019-12-07 17:56:59,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:59" (1/1) ... [2019-12-07 17:56:59,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:59" (1/1) ... [2019-12-07 17:56:59,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:59" (1/1) ... [2019-12-07 17:56:59,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:59" (1/1) ... [2019-12-07 17:56:59,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:56:59,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:56:59,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:56:59,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:56:59,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e5b598f6-2146-461d-89d6-da20e1441978/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 17:56:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:56:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:56:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:56:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:56:59,383 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:56:59,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:56:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:56:59,384 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:56:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 17:56:59,384 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 17:56:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:56:59,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:56:59,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:56:59,385 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 17:56:59,778 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:56:59,778 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:56:59,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:56:59 BoogieIcfgContainer [2019-12-07 17:56:59,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:56:59,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:56:59,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:56:59,782 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:56:59,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:56:58" (1/3) ... [2019-12-07 17:56:59,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fcff84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:56:59, skipping insertion in model container [2019-12-07 17:56:59,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:59" (2/3) ... [2019-12-07 17:56:59,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68fcff84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:56:59, skipping insertion in model container [2019-12-07 17:56:59,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:56:59" (3/3) ... [2019-12-07 17:56:59,784 INFO L109 eAbstractionObserver]: Analyzing ICFG mix006_power.opt.i [2019-12-07 17:56:59,790 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:56:59,790 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:56:59,795 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:56:59,796 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:56:59,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,824 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,824 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,826 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,826 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,836 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,836 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,836 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,837 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,837 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:56:59,859 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 17:56:59,872 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:56:59,872 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:56:59,872 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:56:59,872 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:56:59,872 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:56:59,872 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:56:59,872 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:56:59,873 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:56:59,885 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 241 transitions [2019-12-07 17:56:59,886 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-07 17:56:59,947 INFO L134 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-07 17:56:59,948 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:56:59,963 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 923 event pairs. 9/189 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 17:56:59,986 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-07 17:57:00,027 INFO L134 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-07 17:57:00,027 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:57:00,036 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 923 event pairs. 9/189 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 17:57:00,060 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 17:57:00,061 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:57:03,494 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-07 17:57:03,599 INFO L206 etLargeBlockEncoding]: Checked pairs total: 128241 [2019-12-07 17:57:03,599 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-07 17:57:03,601 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 110 places, 133 transitions [2019-12-07 17:57:06,767 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 47186 states. [2019-12-07 17:57:06,769 INFO L276 IsEmpty]: Start isEmpty. Operand 47186 states. [2019-12-07 17:57:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 17:57:06,773 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:06,773 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:06,774 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:06,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:06,777 INFO L82 PathProgramCache]: Analyzing trace with hash -137140126, now seen corresponding path program 1 times [2019-12-07 17:57:06,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:06,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135906049] [2019-12-07 17:57:06,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:06,926 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 17:57:06,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135906049] [2019-12-07 17:57:06,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:06,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:57:06,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148331928] [2019-12-07 17:57:06,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:57:06,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:06,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:57:06,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:57:06,941 INFO L87 Difference]: Start difference. First operand 47186 states. Second operand 3 states. [2019-12-07 17:57:07,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:07,342 INFO L93 Difference]: Finished difference Result 46894 states and 192684 transitions. [2019-12-07 17:57:07,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:57:07,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 17:57:07,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:07,602 INFO L225 Difference]: With dead ends: 46894 [2019-12-07 17:57:07,603 INFO L226 Difference]: Without dead ends: 43674 [2019-12-07 17:57:07,603 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 17:57:08,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43674 states. [2019-12-07 17:57:08,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43674 to 43674. [2019-12-07 17:57:08,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43674 states. [2019-12-07 17:57:09,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43674 states to 43674 states and 179330 transitions. [2019-12-07 17:57:09,134 INFO L78 Accepts]: Start accepts. Automaton has 43674 states and 179330 transitions. Word has length 7 [2019-12-07 17:57:09,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:09,135 INFO L462 AbstractCegarLoop]: Abstraction has 43674 states and 179330 transitions. [2019-12-07 17:57:09,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:57:09,136 INFO L276 IsEmpty]: Start isEmpty. Operand 43674 states and 179330 transitions. [2019-12-07 17:57:09,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:57:09,142 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:09,142 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:09,142 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:09,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:09,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1070314357, now seen corresponding path program 1 times [2019-12-07 17:57:09,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:09,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558918518] [2019-12-07 17:57:09,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:09,212 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 17:57:09,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558918518] [2019-12-07 17:57:09,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:09,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:57:09,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231975922] [2019-12-07 17:57:09,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:09,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:09,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:09,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:09,214 INFO L87 Difference]: Start difference. First operand 43674 states and 179330 transitions. Second operand 4 states. [2019-12-07 17:57:09,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:09,841 INFO L93 Difference]: Finished difference Result 69642 states and 274292 transitions. [2019-12-07 17:57:09,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:57:09,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 17:57:09,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:10,021 INFO L225 Difference]: With dead ends: 69642 [2019-12-07 17:57:10,022 INFO L226 Difference]: Without dead ends: 69610 [2019-12-07 17:57:10,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 17:57:10,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69610 states. [2019-12-07 17:57:11,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69610 to 67954. [2019-12-07 17:57:11,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67954 states. [2019-12-07 17:57:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67954 states to 67954 states and 269064 transitions. [2019-12-07 17:57:11,914 INFO L78 Accepts]: Start accepts. Automaton has 67954 states and 269064 transitions. Word has length 13 [2019-12-07 17:57:11,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:11,914 INFO L462 AbstractCegarLoop]: Abstraction has 67954 states and 269064 transitions. [2019-12-07 17:57:11,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:11,914 INFO L276 IsEmpty]: Start isEmpty. Operand 67954 states and 269064 transitions. [2019-12-07 17:57:11,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:57:11,920 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:11,920 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:11,920 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:11,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:11,921 INFO L82 PathProgramCache]: Analyzing trace with hash 484016506, now seen corresponding path program 1 times [2019-12-07 17:57:11,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:11,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038691090] [2019-12-07 17:57:11,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:11,977 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 17:57:11,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038691090] [2019-12-07 17:57:11,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:11,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:57:11,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31388727] [2019-12-07 17:57:11,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:11,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:11,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:11,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:11,978 INFO L87 Difference]: Start difference. First operand 67954 states and 269064 transitions. Second operand 4 states. [2019-12-07 17:57:12,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:12,614 INFO L93 Difference]: Finished difference Result 86818 states and 338660 transitions. [2019-12-07 17:57:12,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:57:12,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 17:57:12,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:12,836 INFO L225 Difference]: With dead ends: 86818 [2019-12-07 17:57:12,836 INFO L226 Difference]: Without dead ends: 86790 [2019-12-07 17:57:12,836 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 17:57:13,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86790 states. [2019-12-07 17:57:15,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86790 to 77804. [2019-12-07 17:57:15,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77804 states. [2019-12-07 17:57:16,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77804 states to 77804 states and 306271 transitions. [2019-12-07 17:57:16,042 INFO L78 Accepts]: Start accepts. Automaton has 77804 states and 306271 transitions. Word has length 16 [2019-12-07 17:57:16,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:16,042 INFO L462 AbstractCegarLoop]: Abstraction has 77804 states and 306271 transitions. [2019-12-07 17:57:16,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:16,042 INFO L276 IsEmpty]: Start isEmpty. Operand 77804 states and 306271 transitions. [2019-12-07 17:57:16,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:57:16,047 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:16,047 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:16,047 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:16,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:16,048 INFO L82 PathProgramCache]: Analyzing trace with hash 2119638279, now seen corresponding path program 1 times [2019-12-07 17:57:16,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:16,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799783362] [2019-12-07 17:57:16,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:16,076 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 17:57:16,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799783362] [2019-12-07 17:57:16,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:16,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:57:16,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104713914] [2019-12-07 17:57:16,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:57:16,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:16,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:57:16,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:57:16,078 INFO L87 Difference]: Start difference. First operand 77804 states and 306271 transitions. Second operand 3 states. [2019-12-07 17:57:16,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:16,940 INFO L93 Difference]: Finished difference Result 129752 states and 490387 transitions. [2019-12-07 17:57:16,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:57:16,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 17:57:16,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:17,239 INFO L225 Difference]: With dead ends: 129752 [2019-12-07 17:57:17,240 INFO L226 Difference]: Without dead ends: 129752 [2019-12-07 17:57:17,240 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 17:57:18,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129752 states. [2019-12-07 17:57:20,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129752 to 115674. [2019-12-07 17:57:20,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115674 states. [2019-12-07 17:57:20,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115674 states to 115674 states and 443292 transitions. [2019-12-07 17:57:20,370 INFO L78 Accepts]: Start accepts. Automaton has 115674 states and 443292 transitions. Word has length 17 [2019-12-07 17:57:20,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:20,370 INFO L462 AbstractCegarLoop]: Abstraction has 115674 states and 443292 transitions. [2019-12-07 17:57:20,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:57:20,370 INFO L276 IsEmpty]: Start isEmpty. Operand 115674 states and 443292 transitions. [2019-12-07 17:57:20,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:57:20,379 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:20,379 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 17:57:20,380 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:20,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:20,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1223807206, now seen corresponding path program 1 times [2019-12-07 17:57:20,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:20,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286044676] [2019-12-07 17:57:20,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:20,412 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 17:57:20,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286044676] [2019-12-07 17:57:20,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:20,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:57:20,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100442116] [2019-12-07 17:57:20,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:57:20,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:20,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:57:20,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:57:20,414 INFO L87 Difference]: Start difference. First operand 115674 states and 443292 transitions. Second operand 3 states. [2019-12-07 17:57:20,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:20,638 INFO L93 Difference]: Finished difference Result 63592 states and 212108 transitions. [2019-12-07 17:57:20,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:57:20,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 17:57:20,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:20,750 INFO L225 Difference]: With dead ends: 63592 [2019-12-07 17:57:20,751 INFO L226 Difference]: Without dead ends: 63592 [2019-12-07 17:57:20,751 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 17:57:21,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63592 states. [2019-12-07 17:57:22,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63592 to 63592. [2019-12-07 17:57:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63592 states. [2019-12-07 17:57:22,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63592 states to 63592 states and 212108 transitions. [2019-12-07 17:57:22,307 INFO L78 Accepts]: Start accepts. Automaton has 63592 states and 212108 transitions. Word has length 18 [2019-12-07 17:57:22,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:22,307 INFO L462 AbstractCegarLoop]: Abstraction has 63592 states and 212108 transitions. [2019-12-07 17:57:22,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:57:22,307 INFO L276 IsEmpty]: Start isEmpty. Operand 63592 states and 212108 transitions. [2019-12-07 17:57:22,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:57:22,312 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:22,312 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:22,312 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:22,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:22,312 INFO L82 PathProgramCache]: Analyzing trace with hash 377507519, now seen corresponding path program 1 times [2019-12-07 17:57:22,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:22,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298324163] [2019-12-07 17:57:22,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:22,371 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 17:57:22,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298324163] [2019-12-07 17:57:22,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:22,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:57:22,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610729960] [2019-12-07 17:57:22,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:22,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:22,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:22,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:22,373 INFO L87 Difference]: Start difference. First operand 63592 states and 212108 transitions. Second operand 4 states. [2019-12-07 17:57:22,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:22,653 INFO L93 Difference]: Finished difference Result 72992 states and 242045 transitions. [2019-12-07 17:57:22,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:22,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 17:57:22,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:22,783 INFO L225 Difference]: With dead ends: 72992 [2019-12-07 17:57:22,783 INFO L226 Difference]: Without dead ends: 72476 [2019-12-07 17:57:22,783 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 17:57:23,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72476 states. [2019-12-07 17:57:24,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72476 to 72391. [2019-12-07 17:57:24,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72391 states. [2019-12-07 17:57:24,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72391 states to 72391 states and 240324 transitions. [2019-12-07 17:57:24,207 INFO L78 Accepts]: Start accepts. Automaton has 72391 states and 240324 transitions. Word has length 19 [2019-12-07 17:57:24,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:24,207 INFO L462 AbstractCegarLoop]: Abstraction has 72391 states and 240324 transitions. [2019-12-07 17:57:24,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:24,207 INFO L276 IsEmpty]: Start isEmpty. Operand 72391 states and 240324 transitions. [2019-12-07 17:57:24,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:57:24,212 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:24,212 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:24,212 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:24,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:24,212 INFO L82 PathProgramCache]: Analyzing trace with hash -249657895, now seen corresponding path program 1 times [2019-12-07 17:57:24,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:24,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396333376] [2019-12-07 17:57:24,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:24,243 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 17:57:24,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396333376] [2019-12-07 17:57:24,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:24,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:57:24,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310306358] [2019-12-07 17:57:24,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:24,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:24,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:24,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:24,244 INFO L87 Difference]: Start difference. First operand 72391 states and 240324 transitions. Second operand 4 states. [2019-12-07 17:57:24,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:24,755 INFO L93 Difference]: Finished difference Result 89667 states and 293135 transitions. [2019-12-07 17:57:24,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:57:24,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 17:57:24,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:24,931 INFO L225 Difference]: With dead ends: 89667 [2019-12-07 17:57:24,932 INFO L226 Difference]: Without dead ends: 89650 [2019-12-07 17:57:24,932 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 17:57:26,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89650 states. [2019-12-07 17:57:27,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89650 to 73395. [2019-12-07 17:57:27,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73395 states. [2019-12-07 17:57:27,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73395 states to 73395 states and 243554 transitions. [2019-12-07 17:57:27,348 INFO L78 Accepts]: Start accepts. Automaton has 73395 states and 243554 transitions. Word has length 19 [2019-12-07 17:57:27,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:27,348 INFO L462 AbstractCegarLoop]: Abstraction has 73395 states and 243554 transitions. [2019-12-07 17:57:27,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:27,348 INFO L276 IsEmpty]: Start isEmpty. Operand 73395 states and 243554 transitions. [2019-12-07 17:57:27,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 17:57:27,358 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:27,358 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 17:57:27,359 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:27,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:27,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1058468438, now seen corresponding path program 1 times [2019-12-07 17:57:27,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:27,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815513089] [2019-12-07 17:57:27,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:27,406 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 17:57:27,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815513089] [2019-12-07 17:57:27,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:27,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:57:27,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831894118] [2019-12-07 17:57:27,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:57:27,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:27,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:57:27,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:27,407 INFO L87 Difference]: Start difference. First operand 73395 states and 243554 transitions. Second operand 5 states. [2019-12-07 17:57:28,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:28,130 INFO L93 Difference]: Finished difference Result 102817 states and 332646 transitions. [2019-12-07 17:57:28,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:57:28,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-07 17:57:28,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:28,317 INFO L225 Difference]: With dead ends: 102817 [2019-12-07 17:57:28,317 INFO L226 Difference]: Without dead ends: 102802 [2019-12-07 17:57:28,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:57:28,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102802 states. [2019-12-07 17:57:30,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102802 to 80806. [2019-12-07 17:57:30,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80806 states. [2019-12-07 17:57:30,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80806 states to 80806 states and 266700 transitions. [2019-12-07 17:57:30,315 INFO L78 Accepts]: Start accepts. Automaton has 80806 states and 266700 transitions. Word has length 23 [2019-12-07 17:57:30,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:30,315 INFO L462 AbstractCegarLoop]: Abstraction has 80806 states and 266700 transitions. [2019-12-07 17:57:30,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:57:30,315 INFO L276 IsEmpty]: Start isEmpty. Operand 80806 states and 266700 transitions. [2019-12-07 17:57:30,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 17:57:30,336 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:30,336 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] [2019-12-07 17:57:30,336 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:30,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:30,336 INFO L82 PathProgramCache]: Analyzing trace with hash -785715849, now seen corresponding path program 1 times [2019-12-07 17:57:30,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:30,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741402346] [2019-12-07 17:57:30,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:30,384 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 17:57:30,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741402346] [2019-12-07 17:57:30,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:30,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:57:30,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698508464] [2019-12-07 17:57:30,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:57:30,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:30,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:57:30,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:30,386 INFO L87 Difference]: Start difference. First operand 80806 states and 266700 transitions. Second operand 5 states. [2019-12-07 17:57:31,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:31,137 INFO L93 Difference]: Finished difference Result 107049 states and 345843 transitions. [2019-12-07 17:57:31,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:57:31,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 17:57:31,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:31,330 INFO L225 Difference]: With dead ends: 107049 [2019-12-07 17:57:31,330 INFO L226 Difference]: Without dead ends: 107020 [2019-12-07 17:57:31,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:57:31,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107020 states. [2019-12-07 17:57:32,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107020 to 75120. [2019-12-07 17:57:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75120 states. [2019-12-07 17:57:33,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75120 states to 75120 states and 248534 transitions. [2019-12-07 17:57:33,162 INFO L78 Accepts]: Start accepts. Automaton has 75120 states and 248534 transitions. Word has length 26 [2019-12-07 17:57:33,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:33,162 INFO L462 AbstractCegarLoop]: Abstraction has 75120 states and 248534 transitions. [2019-12-07 17:57:33,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:57:33,162 INFO L276 IsEmpty]: Start isEmpty. Operand 75120 states and 248534 transitions. [2019-12-07 17:57:33,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 17:57:33,214 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:33,214 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 17:57:33,214 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:33,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:33,215 INFO L82 PathProgramCache]: Analyzing trace with hash -474080617, now seen corresponding path program 1 times [2019-12-07 17:57:33,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:33,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348691039] [2019-12-07 17:57:33,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:33,278 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 17:57:33,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348691039] [2019-12-07 17:57:33,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:33,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:57:33,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841826728] [2019-12-07 17:57:33,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:57:33,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:33,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:57:33,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:33,280 INFO L87 Difference]: Start difference. First operand 75120 states and 248534 transitions. Second operand 5 states. [2019-12-07 17:57:34,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:34,157 INFO L93 Difference]: Finished difference Result 149117 states and 505739 transitions. [2019-12-07 17:57:34,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:57:34,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 17:57:34,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:34,454 INFO L225 Difference]: With dead ends: 149117 [2019-12-07 17:57:34,454 INFO L226 Difference]: Without dead ends: 149117 [2019-12-07 17:57:34,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:57:35,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149117 states. [2019-12-07 17:57:36,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149117 to 93228. [2019-12-07 17:57:36,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93228 states. [2019-12-07 17:57:36,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93228 states to 93228 states and 313522 transitions. [2019-12-07 17:57:36,905 INFO L78 Accepts]: Start accepts. Automaton has 93228 states and 313522 transitions. Word has length 33 [2019-12-07 17:57:36,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:36,905 INFO L462 AbstractCegarLoop]: Abstraction has 93228 states and 313522 transitions. [2019-12-07 17:57:36,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:57:36,905 INFO L276 IsEmpty]: Start isEmpty. Operand 93228 states and 313522 transitions. [2019-12-07 17:57:36,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 17:57:36,965 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:36,965 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 17:57:36,965 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:36,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:36,965 INFO L82 PathProgramCache]: Analyzing trace with hash 342436475, now seen corresponding path program 2 times [2019-12-07 17:57:36,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:36,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329077978] [2019-12-07 17:57:36,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:36,994 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 17:57:36,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329077978] [2019-12-07 17:57:36,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:36,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:57:36,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633623875] [2019-12-07 17:57:36,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:36,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:36,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:36,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:36,996 INFO L87 Difference]: Start difference. First operand 93228 states and 313522 transitions. Second operand 4 states. [2019-12-07 17:57:37,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:37,045 INFO L93 Difference]: Finished difference Result 14944 states and 40814 transitions. [2019-12-07 17:57:37,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:37,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 17:57:37,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:37,062 INFO L225 Difference]: With dead ends: 14944 [2019-12-07 17:57:37,063 INFO L226 Difference]: Without dead ends: 14944 [2019-12-07 17:57:37,063 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 17:57:37,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14944 states. [2019-12-07 17:57:37,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14944 to 14471. [2019-12-07 17:57:37,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14471 states. [2019-12-07 17:57:37,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14471 states to 14471 states and 39510 transitions. [2019-12-07 17:57:37,235 INFO L78 Accepts]: Start accepts. Automaton has 14471 states and 39510 transitions. Word has length 33 [2019-12-07 17:57:37,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:37,235 INFO L462 AbstractCegarLoop]: Abstraction has 14471 states and 39510 transitions. [2019-12-07 17:57:37,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:37,235 INFO L276 IsEmpty]: Start isEmpty. Operand 14471 states and 39510 transitions. [2019-12-07 17:57:37,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 17:57:37,247 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:37,247 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] [2019-12-07 17:57:37,247 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:37,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:37,247 INFO L82 PathProgramCache]: Analyzing trace with hash 657313514, now seen corresponding path program 1 times [2019-12-07 17:57:37,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:37,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264308433] [2019-12-07 17:57:37,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:37,304 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 17:57:37,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264308433] [2019-12-07 17:57:37,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:37,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:57:37,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144679749] [2019-12-07 17:57:37,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:57:37,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:37,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:57:37,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:37,306 INFO L87 Difference]: Start difference. First operand 14471 states and 39510 transitions. Second operand 5 states. [2019-12-07 17:57:37,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:37,621 INFO L93 Difference]: Finished difference Result 16974 states and 45303 transitions. [2019-12-07 17:57:37,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:57:37,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-07 17:57:37,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:37,637 INFO L225 Difference]: With dead ends: 16974 [2019-12-07 17:57:37,637 INFO L226 Difference]: Without dead ends: 16974 [2019-12-07 17:57:37,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:57:37,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16974 states. [2019-12-07 17:57:37,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16974 to 16381. [2019-12-07 17:57:37,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16381 states. [2019-12-07 17:57:37,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16381 states to 16381 states and 44082 transitions. [2019-12-07 17:57:37,841 INFO L78 Accepts]: Start accepts. Automaton has 16381 states and 44082 transitions. Word has length 44 [2019-12-07 17:57:37,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:37,842 INFO L462 AbstractCegarLoop]: Abstraction has 16381 states and 44082 transitions. [2019-12-07 17:57:37,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:57:37,842 INFO L276 IsEmpty]: Start isEmpty. Operand 16381 states and 44082 transitions. [2019-12-07 17:57:37,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 17:57:37,856 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:37,856 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] [2019-12-07 17:57:37,856 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:37,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:37,857 INFO L82 PathProgramCache]: Analyzing trace with hash -540828894, now seen corresponding path program 1 times [2019-12-07 17:57:37,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:37,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582031316] [2019-12-07 17:57:37,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:37,958 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 17:57:37,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582031316] [2019-12-07 17:57:37,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:37,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:57:37,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766948112] [2019-12-07 17:57:37,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:37,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:37,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:37,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:37,959 INFO L87 Difference]: Start difference. First operand 16381 states and 44082 transitions. Second operand 4 states. [2019-12-07 17:57:38,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:38,033 INFO L93 Difference]: Finished difference Result 23461 states and 61061 transitions. [2019-12-07 17:57:38,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:57:38,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 17:57:38,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:38,054 INFO L225 Difference]: With dead ends: 23461 [2019-12-07 17:57:38,054 INFO L226 Difference]: Without dead ends: 22530 [2019-12-07 17:57:38,055 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 17:57:38,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22530 states. [2019-12-07 17:57:38,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22530 to 14853. [2019-12-07 17:57:38,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14853 states. [2019-12-07 17:57:38,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14853 states to 14853 states and 40656 transitions. [2019-12-07 17:57:38,258 INFO L78 Accepts]: Start accepts. Automaton has 14853 states and 40656 transitions. Word has length 45 [2019-12-07 17:57:38,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:38,258 INFO L462 AbstractCegarLoop]: Abstraction has 14853 states and 40656 transitions. [2019-12-07 17:57:38,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:38,258 INFO L276 IsEmpty]: Start isEmpty. Operand 14853 states and 40656 transitions. [2019-12-07 17:57:38,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 17:57:38,270 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:38,270 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] [2019-12-07 17:57:38,270 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:38,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:38,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1852649929, now seen corresponding path program 1 times [2019-12-07 17:57:38,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:38,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851762951] [2019-12-07 17:57:38,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:38,495 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 17:57:38,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851762951] [2019-12-07 17:57:38,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:38,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:57:38,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785390870] [2019-12-07 17:57:38,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:57:38,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:38,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:57:38,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:57:38,497 INFO L87 Difference]: Start difference. First operand 14853 states and 40656 transitions. Second operand 11 states. [2019-12-07 17:57:42,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:42,622 INFO L93 Difference]: Finished difference Result 35722 states and 91795 transitions. [2019-12-07 17:57:42,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 17:57:42,624 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2019-12-07 17:57:42,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:42,665 INFO L225 Difference]: With dead ends: 35722 [2019-12-07 17:57:42,665 INFO L226 Difference]: Without dead ends: 30897 [2019-12-07 17:57:42,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=563, Unknown=0, NotChecked=0, Total=702 [2019-12-07 17:57:42,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30897 states. [2019-12-07 17:57:42,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30897 to 19493. [2019-12-07 17:57:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19493 states. [2019-12-07 17:57:42,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19493 states to 19493 states and 53501 transitions. [2019-12-07 17:57:42,976 INFO L78 Accepts]: Start accepts. Automaton has 19493 states and 53501 transitions. Word has length 46 [2019-12-07 17:57:42,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:42,977 INFO L462 AbstractCegarLoop]: Abstraction has 19493 states and 53501 transitions. [2019-12-07 17:57:42,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:57:42,977 INFO L276 IsEmpty]: Start isEmpty. Operand 19493 states and 53501 transitions. [2019-12-07 17:57:42,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 17:57:42,994 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:42,994 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] [2019-12-07 17:57:42,994 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:42,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:42,994 INFO L82 PathProgramCache]: Analyzing trace with hash 2022284017, now seen corresponding path program 1 times [2019-12-07 17:57:42,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:42,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243548608] [2019-12-07 17:57:42,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:43,070 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 17:57:43,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243548608] [2019-12-07 17:57:43,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:43,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:57:43,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713706077] [2019-12-07 17:57:43,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:57:43,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:43,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:57:43,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:57:43,071 INFO L87 Difference]: Start difference. First operand 19493 states and 53501 transitions. Second operand 6 states. [2019-12-07 17:57:43,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:43,396 INFO L93 Difference]: Finished difference Result 17346 states and 46528 transitions. [2019-12-07 17:57:43,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:57:43,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-12-07 17:57:43,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:43,414 INFO L225 Difference]: With dead ends: 17346 [2019-12-07 17:57:43,414 INFO L226 Difference]: Without dead ends: 17346 [2019-12-07 17:57:43,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:57:43,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17346 states. [2019-12-07 17:57:43,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17346 to 14725. [2019-12-07 17:57:43,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14725 states. [2019-12-07 17:57:43,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14725 states to 14725 states and 39256 transitions. [2019-12-07 17:57:43,613 INFO L78 Accepts]: Start accepts. Automaton has 14725 states and 39256 transitions. Word has length 46 [2019-12-07 17:57:43,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:43,613 INFO L462 AbstractCegarLoop]: Abstraction has 14725 states and 39256 transitions. [2019-12-07 17:57:43,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:57:43,613 INFO L276 IsEmpty]: Start isEmpty. Operand 14725 states and 39256 transitions. [2019-12-07 17:57:43,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 17:57:43,626 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:43,627 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] [2019-12-07 17:57:43,627 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:43,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:43,627 INFO L82 PathProgramCache]: Analyzing trace with hash -931538344, now seen corresponding path program 1 times [2019-12-07 17:57:43,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:43,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636545979] [2019-12-07 17:57:43,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:43,668 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 17:57:43,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636545979] [2019-12-07 17:57:43,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:43,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:43,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637729712] [2019-12-07 17:57:43,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:57:43,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:43,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:57:43,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:43,669 INFO L87 Difference]: Start difference. First operand 14725 states and 39256 transitions. Second operand 5 states. [2019-12-07 17:57:43,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:43,711 INFO L93 Difference]: Finished difference Result 11326 states and 31328 transitions. [2019-12-07 17:57:43,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:57:43,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-07 17:57:43,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:43,722 INFO L225 Difference]: With dead ends: 11326 [2019-12-07 17:57:43,722 INFO L226 Difference]: Without dead ends: 10261 [2019-12-07 17:57:43,723 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 17:57:43,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10261 states. [2019-12-07 17:57:43,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10261 to 8862. [2019-12-07 17:57:43,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8862 states. [2019-12-07 17:57:43,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8862 states to 8862 states and 25123 transitions. [2019-12-07 17:57:43,831 INFO L78 Accepts]: Start accepts. Automaton has 8862 states and 25123 transitions. Word has length 47 [2019-12-07 17:57:43,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:43,831 INFO L462 AbstractCegarLoop]: Abstraction has 8862 states and 25123 transitions. [2019-12-07 17:57:43,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:57:43,831 INFO L276 IsEmpty]: Start isEmpty. Operand 8862 states and 25123 transitions. [2019-12-07 17:57:43,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 17:57:43,839 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:43,839 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:43,839 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:43,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:43,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1773007758, now seen corresponding path program 1 times [2019-12-07 17:57:43,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:43,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873922452] [2019-12-07 17:57:43,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:43,951 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 17:57:43,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873922452] [2019-12-07 17:57:43,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:43,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:57:43,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641019751] [2019-12-07 17:57:43,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:57:43,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:43,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:57:43,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:57:43,953 INFO L87 Difference]: Start difference. First operand 8862 states and 25123 transitions. Second operand 11 states. [2019-12-07 17:57:44,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:44,477 INFO L93 Difference]: Finished difference Result 20932 states and 57395 transitions. [2019-12-07 17:57:44,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 17:57:44,477 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2019-12-07 17:57:44,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:44,494 INFO L225 Difference]: With dead ends: 20932 [2019-12-07 17:57:44,494 INFO L226 Difference]: Without dead ends: 16546 [2019-12-07 17:57:44,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2019-12-07 17:57:44,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16546 states. [2019-12-07 17:57:44,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16546 to 8950. [2019-12-07 17:57:44,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8950 states. [2019-12-07 17:57:44,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8950 states to 8950 states and 25333 transitions. [2019-12-07 17:57:44,643 INFO L78 Accepts]: Start accepts. Automaton has 8950 states and 25333 transitions. Word has length 62 [2019-12-07 17:57:44,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:44,643 INFO L462 AbstractCegarLoop]: Abstraction has 8950 states and 25333 transitions. [2019-12-07 17:57:44,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:57:44,644 INFO L276 IsEmpty]: Start isEmpty. Operand 8950 states and 25333 transitions. [2019-12-07 17:57:44,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 17:57:44,652 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:44,652 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:44,652 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:44,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:44,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1066134383, now seen corresponding path program 1 times [2019-12-07 17:57:44,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:44,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548386736] [2019-12-07 17:57:44,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:44,696 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 17:57:44,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548386736] [2019-12-07 17:57:44,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:44,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:44,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549835327] [2019-12-07 17:57:44,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:57:44,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:44,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:57:44,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:57:44,698 INFO L87 Difference]: Start difference. First operand 8950 states and 25333 transitions. Second operand 6 states. [2019-12-07 17:57:44,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:44,818 INFO L93 Difference]: Finished difference Result 15780 states and 44565 transitions. [2019-12-07 17:57:44,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:57:44,818 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-07 17:57:44,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:44,830 INFO L225 Difference]: With dead ends: 15780 [2019-12-07 17:57:44,830 INFO L226 Difference]: Without dead ends: 10776 [2019-12-07 17:57:44,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:57:44,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10776 states. [2019-12-07 17:57:44,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10776 to 9018. [2019-12-07 17:57:44,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9018 states. [2019-12-07 17:57:44,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9018 states to 9018 states and 25465 transitions. [2019-12-07 17:57:44,944 INFO L78 Accepts]: Start accepts. Automaton has 9018 states and 25465 transitions. Word has length 62 [2019-12-07 17:57:44,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:44,944 INFO L462 AbstractCegarLoop]: Abstraction has 9018 states and 25465 transitions. [2019-12-07 17:57:44,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:57:44,944 INFO L276 IsEmpty]: Start isEmpty. Operand 9018 states and 25465 transitions. [2019-12-07 17:57:44,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 17:57:44,952 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:44,952 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:44,952 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:44,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:44,953 INFO L82 PathProgramCache]: Analyzing trace with hash -877359154, now seen corresponding path program 2 times [2019-12-07 17:57:44,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:44,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025831043] [2019-12-07 17:57:44,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:45,077 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 17:57:45,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025831043] [2019-12-07 17:57:45,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:45,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 17:57:45,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733430879] [2019-12-07 17:57:45,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:57:45,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:45,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:57:45,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:57:45,078 INFO L87 Difference]: Start difference. First operand 9018 states and 25465 transitions. Second operand 11 states. [2019-12-07 17:57:45,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:45,591 INFO L93 Difference]: Finished difference Result 21006 states and 53341 transitions. [2019-12-07 17:57:45,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:57:45,592 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2019-12-07 17:57:45,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:45,599 INFO L225 Difference]: With dead ends: 21006 [2019-12-07 17:57:45,599 INFO L226 Difference]: Without dead ends: 6579 [2019-12-07 17:57:45,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:57:45,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6579 states. [2019-12-07 17:57:45,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6579 to 5844. [2019-12-07 17:57:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5844 states. [2019-12-07 17:57:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5844 states to 5844 states and 14720 transitions. [2019-12-07 17:57:45,660 INFO L78 Accepts]: Start accepts. Automaton has 5844 states and 14720 transitions. Word has length 62 [2019-12-07 17:57:45,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:45,660 INFO L462 AbstractCegarLoop]: Abstraction has 5844 states and 14720 transitions. [2019-12-07 17:57:45,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:57:45,660 INFO L276 IsEmpty]: Start isEmpty. Operand 5844 states and 14720 transitions. [2019-12-07 17:57:45,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 17:57:45,664 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:45,664 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:45,664 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:45,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:45,665 INFO L82 PathProgramCache]: Analyzing trace with hash -235949476, now seen corresponding path program 3 times [2019-12-07 17:57:45,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:45,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553812329] [2019-12-07 17:57:45,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:45,704 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 17:57:45,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553812329] [2019-12-07 17:57:45,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:45,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:57:45,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282374618] [2019-12-07 17:57:45,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:57:45,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:45,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:57:45,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:57:45,705 INFO L87 Difference]: Start difference. First operand 5844 states and 14720 transitions. Second operand 3 states. [2019-12-07 17:57:45,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:45,722 INFO L93 Difference]: Finished difference Result 5844 states and 14719 transitions. [2019-12-07 17:57:45,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:57:45,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-07 17:57:45,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:45,728 INFO L225 Difference]: With dead ends: 5844 [2019-12-07 17:57:45,728 INFO L226 Difference]: Without dead ends: 5844 [2019-12-07 17:57:45,728 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 17:57:45,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5844 states. [2019-12-07 17:57:45,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5844 to 5534. [2019-12-07 17:57:45,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5534 states. [2019-12-07 17:57:45,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5534 states to 5534 states and 14012 transitions. [2019-12-07 17:57:45,789 INFO L78 Accepts]: Start accepts. Automaton has 5534 states and 14012 transitions. Word has length 62 [2019-12-07 17:57:45,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:45,789 INFO L462 AbstractCegarLoop]: Abstraction has 5534 states and 14012 transitions. [2019-12-07 17:57:45,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:57:45,789 INFO L276 IsEmpty]: Start isEmpty. Operand 5534 states and 14012 transitions. [2019-12-07 17:57:45,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 17:57:45,793 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:45,793 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:45,793 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:45,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:45,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1029467848, now seen corresponding path program 1 times [2019-12-07 17:57:45,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:45,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536628024] [2019-12-07 17:57:45,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:45,843 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 17:57:45,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536628024] [2019-12-07 17:57:45,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:45,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:57:45,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961915222] [2019-12-07 17:57:45,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:45,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:45,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:45,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:45,844 INFO L87 Difference]: Start difference. First operand 5534 states and 14012 transitions. Second operand 4 states. [2019-12-07 17:57:45,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:45,870 INFO L93 Difference]: Finished difference Result 6243 states and 15615 transitions. [2019-12-07 17:57:45,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:45,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-07 17:57:45,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:45,871 INFO L225 Difference]: With dead ends: 6243 [2019-12-07 17:57:45,871 INFO L226 Difference]: Without dead ends: 804 [2019-12-07 17:57:45,871 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 17:57:45,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-12-07 17:57:45,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2019-12-07 17:57:45,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2019-12-07 17:57:45,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1747 transitions. [2019-12-07 17:57:45,878 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1747 transitions. Word has length 63 [2019-12-07 17:57:45,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:45,878 INFO L462 AbstractCegarLoop]: Abstraction has 804 states and 1747 transitions. [2019-12-07 17:57:45,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:45,879 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1747 transitions. [2019-12-07 17:57:45,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 17:57:45,879 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:45,879 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:45,879 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:45,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:45,880 INFO L82 PathProgramCache]: Analyzing trace with hash 424994232, now seen corresponding path program 2 times [2019-12-07 17:57:45,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:45,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838562362] [2019-12-07 17:57:45,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:45,944 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 17:57:45,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838562362] [2019-12-07 17:57:45,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:45,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:57:45,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028583048] [2019-12-07 17:57:45,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:57:45,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:45,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:57:45,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:57:45,945 INFO L87 Difference]: Start difference. First operand 804 states and 1747 transitions. Second operand 7 states. [2019-12-07 17:57:46,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:46,109 INFO L93 Difference]: Finished difference Result 1350 states and 2869 transitions. [2019-12-07 17:57:46,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:57:46,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-07 17:57:46,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:46,110 INFO L225 Difference]: With dead ends: 1350 [2019-12-07 17:57:46,110 INFO L226 Difference]: Without dead ends: 973 [2019-12-07 17:57:46,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:57:46,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-12-07 17:57:46,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 863. [2019-12-07 17:57:46,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-12-07 17:57:46,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1837 transitions. [2019-12-07 17:57:46,118 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1837 transitions. Word has length 63 [2019-12-07 17:57:46,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:46,118 INFO L462 AbstractCegarLoop]: Abstraction has 863 states and 1837 transitions. [2019-12-07 17:57:46,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:57:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1837 transitions. [2019-12-07 17:57:46,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 17:57:46,118 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:46,119 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:46,119 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:46,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:46,119 INFO L82 PathProgramCache]: Analyzing trace with hash 279364820, now seen corresponding path program 3 times [2019-12-07 17:57:46,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:46,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504633925] [2019-12-07 17:57:46,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:57:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:57:46,203 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:57:46,203 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:57:46,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~__unbuffered_cnt~0_191 0) (= v_~y$r_buff0_thd0~0_148 0) (= v_~y$r_buff1_thd0~0_211 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$mem_tmp~0_192 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t156~0.base_25|)) (= 0 v_~y$r_buff0_thd3~0_503) (= v_~main$tmp_guard1~0_31 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd1~0_145 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= v_~x~0_69 0) (= v_~y$w_buff0_used~0_960 0) (= |v_ULTIMATE.start_main_~#t156~0.offset_18| 0) (= 0 v_~__unbuffered_p1_EAX~0_58) (= 0 v_~y$r_buff0_thd2~0_341) (= v_~y$w_buff1~0_320 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff0_thd1~0_76 0) (= 0 v_~y$r_buff1_thd2~0_299) (= 0 |v_#NULL.base_6|) (= v_~__unbuffered_p2_EBX~0_33 0) (= v_~y$flush_delayed~0_267 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t156~0.base_25| 1) |v_#valid_62|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~z~0_25 0) (= 0 v_~weak$$choice0~0_179) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t156~0.base_25| 4) |v_#length_23|) (= v_~y~0_332 0) (= v_~main$tmp_guard0~0_26 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t156~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t156~0.base_25|) |v_ULTIMATE.start_main_~#t156~0.offset_18| 0))) (= 0 v_~y$w_buff0~0_491) (= v_~weak$$choice2~0_259 0) (= v_~y$w_buff1_used~0_583 0) (= 0 v_~__unbuffered_p2_EAX~0_48) (= 0 v_~y$r_buff1_thd3~0_336) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t156~0.base_25|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_24|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, #NULL.offset=|v_#NULL.offset_6|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t157~0.offset=|v_ULTIMATE.start_main_~#t157~0.offset_19|, ~y$mem_tmp~0=v_~y$mem_tmp~0_192, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_336, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_58, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_76, ~y$flush_delayed~0=v_~y$flush_delayed~0_267, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ULTIMATE.start_main_~#t156~0.offset=|v_ULTIMATE.start_main_~#t156~0.offset_18|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_68|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_56|, ~weak$$choice0~0=v_~weak$$choice0~0_179, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_144|, ~y$w_buff1~0=v_~y$w_buff1~0_320, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_341, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_211, ~x~0=v_~x~0_69, ULTIMATE.start_main_~#t158~0.base=|v_ULTIMATE.start_main_~#t158~0.base_22|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t158~0.offset=|v_ULTIMATE.start_main_~#t158~0.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_960, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_145, ~y$w_buff0~0=v_~y$w_buff0~0_491, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_503, ~y~0=v_~y~0_332, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_108|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_~#t156~0.base=|v_ULTIMATE.start_main_~#t156~0.base_25|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_299, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_46|, ULTIMATE.start_main_~#t157~0.base=|v_ULTIMATE.start_main_~#t157~0.base_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_148, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_25, ~weak$$choice2~0=v_~weak$$choice2~0_259, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_583} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ULTIMATE.start_main_~#t157~0.offset, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t156~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t158~0.base, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t158~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t156~0.base, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t157~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:57:46,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L833-1-->L835: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t157~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t157~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t157~0.base_13|) |v_ULTIMATE.start_main_~#t157~0.offset_11| 1)) |v_#memory_int_15|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t157~0.base_13| 1) |v_#valid_34|) (= |v_ULTIMATE.start_main_~#t157~0.offset_11| 0) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t157~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t157~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t157~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t157~0.offset=|v_ULTIMATE.start_main_~#t157~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t157~0.base=|v_ULTIMATE.start_main_~#t157~0.base_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t157~0.offset, ULTIMATE.start_main_~#t157~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 17:57:46,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L835-1-->L837: Formula: (and (not (= |v_ULTIMATE.start_main_~#t158~0.base_12| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t158~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t158~0.base_12|) |v_ULTIMATE.start_main_~#t158~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t158~0.base_12|)) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t158~0.base_12| 1) |v_#valid_32|) (= |v_ULTIMATE.start_main_~#t158~0.offset_10| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t158~0.base_12|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t158~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t158~0.base=|v_ULTIMATE.start_main_~#t158~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t158~0.offset=|v_ULTIMATE.start_main_~#t158~0.offset_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t158~0.base, ULTIMATE.start_main_~#t158~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 17:57:46,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] L4-->L795: Formula: (and (= v_~y~0_46 v_~y$mem_tmp~0_31) (= |v_P2Thread1of1ForFork0_#t~nondet27_32| v_~weak$$choice2~0_67) (= v_~y$r_buff0_thd0~0_28 v_~y$r_buff1_thd0~0_28) (= 1 v_~y$r_buff0_thd3~0_110) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_17) (= |v_P2Thread1of1ForFork0_#t~nondet26_32| v_~weak$$choice0~0_28) (= v_~y$r_buff0_thd3~0_111 v_~y$r_buff1_thd3~0_58) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44)) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_43) (= v_~weak$$choice2~0_67 v_~y$flush_delayed~0_40)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_111, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_32|, ~y~0=v_~y~0_46, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_32|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44} OutVars{P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_31|, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_31|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_28, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_58, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_110, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_40, ~y~0=v_~y~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_67, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_28} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~nondet27, ~y$flush_delayed~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-07 17:57:46,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1417011224 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1417011224 256) 0))) (or (and (= ~y$w_buff0~0_In-1417011224 |P2Thread1of1ForFork0_#t~ite28_Out-1417011224|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff1~0_In-1417011224 |P2Thread1of1ForFork0_#t~ite28_Out-1417011224|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1417011224, ~y$w_buff1~0=~y$w_buff1~0_In-1417011224, ~y$w_buff0~0=~y$w_buff0~0_In-1417011224, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1417011224} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1417011224|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1417011224, ~y$w_buff1~0=~y$w_buff1~0_In-1417011224, ~y$w_buff0~0=~y$w_buff0~0_In-1417011224, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1417011224} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 17:57:46,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [909] [909] L795-4-->L796: Formula: (= v_~y~0_60 |v_P2Thread1of1ForFork0_#t~ite28_10|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_10|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_9|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_60} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 17:57:46,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] L800-->L801: Formula: (and (= v_~y$r_buff0_thd3~0_109 v_~y$r_buff0_thd3~0_108) (not (= (mod v_~weak$$choice2~0_66 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_66} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_108, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_6|, ~weak$$choice2~0=v_~weak$$choice2~0_66} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 17:57:46,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-784814675 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out-784814675| ~y~0_In-784814675) .cse0) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out-784814675| ~y$mem_tmp~0_In-784814675)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-784814675, ~y$flush_delayed~0=~y$flush_delayed~0_In-784814675, ~y~0=~y~0_In-784814675} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-784814675|, ~y$mem_tmp~0=~y$mem_tmp~0_In-784814675, ~y$flush_delayed~0=~y$flush_delayed~0_In-784814675, ~y~0=~y~0_In-784814675} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 17:57:46,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= v_~z~0_12 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~x~0_40 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~z~0=v_~z~0_12, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~x~0=v_~x~0_40, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 17:57:46,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1043049599 256)))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out1043049599| ~y~0_In1043049599)) (and (= |P1Thread1of1ForFork2_#t~ite25_Out1043049599| ~y$mem_tmp~0_In1043049599) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1043049599, ~y$flush_delayed~0=~y$flush_delayed~0_In1043049599, ~y~0=~y~0_In1043049599} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1043049599, ~y$flush_delayed~0=~y$flush_delayed~0_In1043049599, ~y~0=~y~0_In1043049599, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out1043049599|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 17:57:46,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y$flush_delayed~0_118 0) (= v_~y~0_147 |v_P1Thread1of1ForFork2_#t~ite25_66|) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_66|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_118, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~y~0=v_~y~0_147, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_65|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 17:57:46,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1398193062 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1398193062 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out-1398193062|)) (and (= |P2Thread1of1ForFork0_#t~ite51_Out-1398193062| ~y$w_buff0_used~0_In-1398193062) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1398193062, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1398193062} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1398193062, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1398193062, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-1398193062|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 17:57:46,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In85664443 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In85664443 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In85664443 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In85664443 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In85664443 |P2Thread1of1ForFork0_#t~ite52_Out85664443|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork0_#t~ite52_Out85664443|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In85664443, ~y$w_buff0_used~0=~y$w_buff0_used~0_In85664443, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In85664443, ~y$w_buff1_used~0=~y$w_buff1_used~0_In85664443} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In85664443, ~y$w_buff0_used~0=~y$w_buff0_used~0_In85664443, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In85664443, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out85664443|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In85664443} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 17:57:46,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L813-->L814: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1912364439 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1912364439 256) 0)) (.cse2 (= ~y$r_buff0_thd3~0_In-1912364439 ~y$r_buff0_thd3~0_Out-1912364439))) (or (and (not .cse0) (= ~y$r_buff0_thd3~0_Out-1912364439 0) (not .cse1)) (and .cse2 .cse0) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1912364439, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1912364439} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1912364439, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1912364439, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1912364439|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 17:57:46,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In923887732 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In923887732 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In923887732 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In923887732 256)))) (or (and (= ~y$r_buff1_thd3~0_In923887732 |P2Thread1of1ForFork0_#t~ite54_Out923887732|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out923887732|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In923887732, ~y$w_buff0_used~0=~y$w_buff0_used~0_In923887732, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In923887732, ~y$w_buff1_used~0=~y$w_buff1_used~0_In923887732} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In923887732, ~y$w_buff0_used~0=~y$w_buff0_used~0_In923887732, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out923887732|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In923887732, ~y$w_buff1_used~0=~y$w_buff1_used~0_In923887732} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 17:57:46,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L814-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~y$r_buff1_thd3~0_276 |v_P2Thread1of1ForFork0_#t~ite54_34|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_276, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 17:57:46,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L837-1-->L843: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:57:46,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L843-2-->L843-5: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1772199763 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1772199763 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite59_Out-1772199763| |ULTIMATE.start_main_#t~ite58_Out-1772199763|))) (or (and .cse0 (= ~y$w_buff1~0_In-1772199763 |ULTIMATE.start_main_#t~ite58_Out-1772199763|) (not .cse1) (not .cse2)) (and (or .cse2 .cse1) .cse0 (= ~y~0_In-1772199763 |ULTIMATE.start_main_#t~ite58_Out-1772199763|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1772199763, ~y~0=~y~0_In-1772199763, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1772199763, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1772199763} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1772199763, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1772199763|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1772199763|, ~y~0=~y~0_In-1772199763, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1772199763, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1772199763} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 17:57:46,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1856801078 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1856801078 256)))) (or (and (= ~y$w_buff0_used~0_In1856801078 |ULTIMATE.start_main_#t~ite60_Out1856801078|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite60_Out1856801078|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1856801078, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1856801078} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1856801078|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1856801078, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1856801078} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 17:57:46,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In850117766 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In850117766 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In850117766 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In850117766 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out850117766|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In850117766 |ULTIMATE.start_main_#t~ite61_Out850117766|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In850117766, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In850117766, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In850117766, ~y$w_buff1_used~0=~y$w_buff1_used~0_In850117766} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out850117766|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In850117766, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In850117766, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In850117766, ~y$w_buff1_used~0=~y$w_buff1_used~0_In850117766} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 17:57:46,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-801139373 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-801139373 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite62_Out-801139373|)) (and (= ~y$r_buff0_thd0~0_In-801139373 |ULTIMATE.start_main_#t~ite62_Out-801139373|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-801139373, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-801139373} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-801139373|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-801139373, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-801139373} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 17:57:46,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L847-->L847-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-2032284654 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-2032284654 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-2032284654 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-2032284654 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-2032284654| ~y$r_buff1_thd0~0_In-2032284654) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite63_Out-2032284654| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2032284654, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2032284654, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2032284654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2032284654} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-2032284654|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2032284654, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2032284654, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2032284654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2032284654} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:57:46,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~y$r_buff1_thd0~0_206 |v_ULTIMATE.start_main_#t~ite63_48|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_25 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_25 (ite (= (ite (not (and (= 2 v_~__unbuffered_p1_EAX~0_53) (= v_~x~0_64 2) (= v_~__unbuffered_p2_EBX~0_28 0) (= 1 v_~__unbuffered_p2_EAX~0_42) (= v_~__unbuffered_p1_EBX~0_35 0))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_48|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~x~0=v_~x~0_64} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~x~0=v_~x~0_64, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_206, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:57:46,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:57:46 BasicIcfg [2019-12-07 17:57:46,295 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:57:46,295 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:57:46,295 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:57:46,296 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:57:46,296 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:56:59" (3/4) ... [2019-12-07 17:57:46,298 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:57:46,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~__unbuffered_cnt~0_191 0) (= v_~y$r_buff0_thd0~0_148 0) (= v_~y$r_buff1_thd0~0_211 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$mem_tmp~0_192 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t156~0.base_25|)) (= 0 v_~y$r_buff0_thd3~0_503) (= v_~main$tmp_guard1~0_31 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd1~0_145 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= v_~x~0_69 0) (= v_~y$w_buff0_used~0_960 0) (= |v_ULTIMATE.start_main_~#t156~0.offset_18| 0) (= 0 v_~__unbuffered_p1_EAX~0_58) (= 0 v_~y$r_buff0_thd2~0_341) (= v_~y$w_buff1~0_320 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff0_thd1~0_76 0) (= 0 v_~y$r_buff1_thd2~0_299) (= 0 |v_#NULL.base_6|) (= v_~__unbuffered_p2_EBX~0_33 0) (= v_~y$flush_delayed~0_267 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t156~0.base_25| 1) |v_#valid_62|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~z~0_25 0) (= 0 v_~weak$$choice0~0_179) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t156~0.base_25| 4) |v_#length_23|) (= v_~y~0_332 0) (= v_~main$tmp_guard0~0_26 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t156~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t156~0.base_25|) |v_ULTIMATE.start_main_~#t156~0.offset_18| 0))) (= 0 v_~y$w_buff0~0_491) (= v_~weak$$choice2~0_259 0) (= v_~y$w_buff1_used~0_583 0) (= 0 v_~__unbuffered_p2_EAX~0_48) (= 0 v_~y$r_buff1_thd3~0_336) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t156~0.base_25|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_24|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, #NULL.offset=|v_#NULL.offset_6|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t157~0.offset=|v_ULTIMATE.start_main_~#t157~0.offset_19|, ~y$mem_tmp~0=v_~y$mem_tmp~0_192, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_336, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_58, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_76, ~y$flush_delayed~0=v_~y$flush_delayed~0_267, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ULTIMATE.start_main_~#t156~0.offset=|v_ULTIMATE.start_main_~#t156~0.offset_18|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_68|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_56|, ~weak$$choice0~0=v_~weak$$choice0~0_179, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_144|, ~y$w_buff1~0=v_~y$w_buff1~0_320, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_341, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_211, ~x~0=v_~x~0_69, ULTIMATE.start_main_~#t158~0.base=|v_ULTIMATE.start_main_~#t158~0.base_22|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t158~0.offset=|v_ULTIMATE.start_main_~#t158~0.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_960, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_145, ~y$w_buff0~0=v_~y$w_buff0~0_491, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_503, ~y~0=v_~y~0_332, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_108|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_~#t156~0.base=|v_ULTIMATE.start_main_~#t156~0.base_25|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_299, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_46|, ULTIMATE.start_main_~#t157~0.base=|v_ULTIMATE.start_main_~#t157~0.base_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_148, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_25, ~weak$$choice2~0=v_~weak$$choice2~0_259, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_583} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ULTIMATE.start_main_~#t157~0.offset, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t156~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t158~0.base, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t158~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t156~0.base, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t157~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:57:46,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L833-1-->L835: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t157~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t157~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t157~0.base_13|) |v_ULTIMATE.start_main_~#t157~0.offset_11| 1)) |v_#memory_int_15|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t157~0.base_13| 1) |v_#valid_34|) (= |v_ULTIMATE.start_main_~#t157~0.offset_11| 0) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t157~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t157~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t157~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t157~0.offset=|v_ULTIMATE.start_main_~#t157~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t157~0.base=|v_ULTIMATE.start_main_~#t157~0.base_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t157~0.offset, ULTIMATE.start_main_~#t157~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 17:57:46,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L835-1-->L837: Formula: (and (not (= |v_ULTIMATE.start_main_~#t158~0.base_12| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t158~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t158~0.base_12|) |v_ULTIMATE.start_main_~#t158~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t158~0.base_12|)) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t158~0.base_12| 1) |v_#valid_32|) (= |v_ULTIMATE.start_main_~#t158~0.offset_10| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t158~0.base_12|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t158~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t158~0.base=|v_ULTIMATE.start_main_~#t158~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t158~0.offset=|v_ULTIMATE.start_main_~#t158~0.offset_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t158~0.base, ULTIMATE.start_main_~#t158~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 17:57:46,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] L4-->L795: Formula: (and (= v_~y~0_46 v_~y$mem_tmp~0_31) (= |v_P2Thread1of1ForFork0_#t~nondet27_32| v_~weak$$choice2~0_67) (= v_~y$r_buff0_thd0~0_28 v_~y$r_buff1_thd0~0_28) (= 1 v_~y$r_buff0_thd3~0_110) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_17) (= |v_P2Thread1of1ForFork0_#t~nondet26_32| v_~weak$$choice0~0_28) (= v_~y$r_buff0_thd3~0_111 v_~y$r_buff1_thd3~0_58) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44)) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_43) (= v_~weak$$choice2~0_67 v_~y$flush_delayed~0_40)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_111, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_32|, ~y~0=v_~y~0_46, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_32|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44} OutVars{P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_31|, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_31|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_28, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_58, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_110, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_40, ~y~0=v_~y~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_67, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_28} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~nondet27, ~y$flush_delayed~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-07 17:57:46,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1417011224 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1417011224 256) 0))) (or (and (= ~y$w_buff0~0_In-1417011224 |P2Thread1of1ForFork0_#t~ite28_Out-1417011224|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff1~0_In-1417011224 |P2Thread1of1ForFork0_#t~ite28_Out-1417011224|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1417011224, ~y$w_buff1~0=~y$w_buff1~0_In-1417011224, ~y$w_buff0~0=~y$w_buff0~0_In-1417011224, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1417011224} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-1417011224|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1417011224, ~y$w_buff1~0=~y$w_buff1~0_In-1417011224, ~y$w_buff0~0=~y$w_buff0~0_In-1417011224, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1417011224} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 17:57:46,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [909] [909] L795-4-->L796: Formula: (= v_~y~0_60 |v_P2Thread1of1ForFork0_#t~ite28_10|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_10|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_9|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_60} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 17:57:46,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] L800-->L801: Formula: (and (= v_~y$r_buff0_thd3~0_109 v_~y$r_buff0_thd3~0_108) (not (= (mod v_~weak$$choice2~0_66 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_66} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_108, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_6|, ~weak$$choice2~0=v_~weak$$choice2~0_66} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 17:57:46,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-784814675 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out-784814675| ~y~0_In-784814675) .cse0) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out-784814675| ~y$mem_tmp~0_In-784814675)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-784814675, ~y$flush_delayed~0=~y$flush_delayed~0_In-784814675, ~y~0=~y~0_In-784814675} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-784814675|, ~y$mem_tmp~0=~y$mem_tmp~0_In-784814675, ~y$flush_delayed~0=~y$flush_delayed~0_In-784814675, ~y~0=~y~0_In-784814675} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 17:57:46,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= v_~z~0_12 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~x~0_40 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~z~0=v_~z~0_12, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~x~0=v_~x~0_40, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 17:57:46,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1043049599 256)))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out1043049599| ~y~0_In1043049599)) (and (= |P1Thread1of1ForFork2_#t~ite25_Out1043049599| ~y$mem_tmp~0_In1043049599) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1043049599, ~y$flush_delayed~0=~y$flush_delayed~0_In1043049599, ~y~0=~y~0_In1043049599} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1043049599, ~y$flush_delayed~0=~y$flush_delayed~0_In1043049599, ~y~0=~y~0_In1043049599, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out1043049599|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 17:57:46,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y$flush_delayed~0_118 0) (= v_~y~0_147 |v_P1Thread1of1ForFork2_#t~ite25_66|) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_66|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_118, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~y~0=v_~y~0_147, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_65|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 17:57:46,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1398193062 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1398193062 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out-1398193062|)) (and (= |P2Thread1of1ForFork0_#t~ite51_Out-1398193062| ~y$w_buff0_used~0_In-1398193062) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1398193062, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1398193062} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1398193062, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1398193062, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-1398193062|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 17:57:46,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In85664443 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In85664443 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In85664443 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In85664443 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In85664443 |P2Thread1of1ForFork0_#t~ite52_Out85664443|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork0_#t~ite52_Out85664443|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In85664443, ~y$w_buff0_used~0=~y$w_buff0_used~0_In85664443, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In85664443, ~y$w_buff1_used~0=~y$w_buff1_used~0_In85664443} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In85664443, ~y$w_buff0_used~0=~y$w_buff0_used~0_In85664443, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In85664443, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out85664443|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In85664443} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 17:57:46,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L813-->L814: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1912364439 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1912364439 256) 0)) (.cse2 (= ~y$r_buff0_thd3~0_In-1912364439 ~y$r_buff0_thd3~0_Out-1912364439))) (or (and (not .cse0) (= ~y$r_buff0_thd3~0_Out-1912364439 0) (not .cse1)) (and .cse2 .cse0) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1912364439, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1912364439} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1912364439, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1912364439, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1912364439|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 17:57:46,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In923887732 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In923887732 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In923887732 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In923887732 256)))) (or (and (= ~y$r_buff1_thd3~0_In923887732 |P2Thread1of1ForFork0_#t~ite54_Out923887732|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out923887732|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In923887732, ~y$w_buff0_used~0=~y$w_buff0_used~0_In923887732, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In923887732, ~y$w_buff1_used~0=~y$w_buff1_used~0_In923887732} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In923887732, ~y$w_buff0_used~0=~y$w_buff0_used~0_In923887732, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out923887732|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In923887732, ~y$w_buff1_used~0=~y$w_buff1_used~0_In923887732} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 17:57:46,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L814-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~y$r_buff1_thd3~0_276 |v_P2Thread1of1ForFork0_#t~ite54_34|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_276, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 17:57:46,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L837-1-->L843: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:57:46,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L843-2-->L843-5: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1772199763 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1772199763 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite59_Out-1772199763| |ULTIMATE.start_main_#t~ite58_Out-1772199763|))) (or (and .cse0 (= ~y$w_buff1~0_In-1772199763 |ULTIMATE.start_main_#t~ite58_Out-1772199763|) (not .cse1) (not .cse2)) (and (or .cse2 .cse1) .cse0 (= ~y~0_In-1772199763 |ULTIMATE.start_main_#t~ite58_Out-1772199763|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1772199763, ~y~0=~y~0_In-1772199763, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1772199763, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1772199763} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1772199763, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1772199763|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1772199763|, ~y~0=~y~0_In-1772199763, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1772199763, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1772199763} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 17:57:46,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1856801078 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1856801078 256)))) (or (and (= ~y$w_buff0_used~0_In1856801078 |ULTIMATE.start_main_#t~ite60_Out1856801078|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite60_Out1856801078|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1856801078, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1856801078} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out1856801078|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1856801078, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1856801078} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 17:57:46,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In850117766 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In850117766 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In850117766 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In850117766 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out850117766|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In850117766 |ULTIMATE.start_main_#t~ite61_Out850117766|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In850117766, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In850117766, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In850117766, ~y$w_buff1_used~0=~y$w_buff1_used~0_In850117766} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out850117766|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In850117766, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In850117766, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In850117766, ~y$w_buff1_used~0=~y$w_buff1_used~0_In850117766} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 17:57:46,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-801139373 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-801139373 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite62_Out-801139373|)) (and (= ~y$r_buff0_thd0~0_In-801139373 |ULTIMATE.start_main_#t~ite62_Out-801139373|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-801139373, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-801139373} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-801139373|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-801139373, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-801139373} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 17:57:46,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L847-->L847-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-2032284654 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-2032284654 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-2032284654 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-2032284654 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-2032284654| ~y$r_buff1_thd0~0_In-2032284654) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite63_Out-2032284654| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2032284654, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2032284654, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2032284654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2032284654} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-2032284654|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2032284654, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2032284654, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2032284654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2032284654} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:57:46,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~y$r_buff1_thd0~0_206 |v_ULTIMATE.start_main_#t~ite63_48|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_25 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_25 (ite (= (ite (not (and (= 2 v_~__unbuffered_p1_EAX~0_53) (= v_~x~0_64 2) (= v_~__unbuffered_p2_EBX~0_28 0) (= 1 v_~__unbuffered_p2_EAX~0_42) (= v_~__unbuffered_p1_EBX~0_35 0))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_48|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~x~0=v_~x~0_64} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~x~0=v_~x~0_64, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_206, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:57:46,389 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e5b598f6-2146-461d-89d6-da20e1441978/bin/uautomizer/witness.graphml [2019-12-07 17:57:46,389 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:57:46,390 INFO L168 Benchmark]: Toolchain (without parser) took 47505.70 ms. Allocated memory was 1.0 GB in the beginning and 5.3 GB in the end (delta: 4.2 GB). Free memory was 937.2 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-12-07 17:57:46,391 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:57:46,391 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -127.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:57:46,391 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.80 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 17:57:46,392 INFO L168 Benchmark]: Boogie Preprocessor took 27.13 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 17:57:46,392 INFO L168 Benchmark]: RCFGBuilder took 439.18 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: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:57:46,392 INFO L168 Benchmark]: TraceAbstraction took 46515.12 ms. Allocated memory was 1.1 GB in the beginning and 5.3 GB in the end (delta: 4.1 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2019-12-07 17:57:46,393 INFO L168 Benchmark]: Witness Printer took 93.69 ms. Allocated memory is still 5.3 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:57:46,394 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 387.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 937.2 MB in the beginning and 1.1 GB in the end (delta: -127.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.80 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. * Boogie Preprocessor took 27.13 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. * RCFGBuilder took 439.18 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: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46515.12 ms. Allocated memory was 1.1 GB in the beginning and 5.3 GB in the end (delta: 4.1 GB). Free memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. * Witness Printer took 93.69 ms. Allocated memory is still 5.3 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 195 ProgramPointsBefore, 110 ProgramPointsAfterwards, 241 TransitionsBefore, 133 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 27 ChoiceCompositions, 9977 VarBasedMoverChecksPositive, 318 VarBasedMoverChecksNegative, 79 SemBasedMoverChecksPositive, 323 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 128241 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t156, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t157, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t158, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 y$w_buff1 = y$w_buff0 [L780] 3 y$w_buff0 = 1 [L781] 3 y$w_buff1_used = y$w_buff0_used [L782] 3 y$w_buff0_used = (_Bool)1 [L795] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L797] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L798] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y = y$flush_delayed ? y$mem_tmp : y [L804] 3 y$flush_delayed = (_Bool)0 [L807] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 2 x = 2 [L751] 2 __unbuffered_p1_EAX = x [L754] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 2 y$flush_delayed = weak$$choice2 [L757] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L759] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L761] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L764] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L811] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L812] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L843] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L844] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L845] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L846] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 186 locations, 2 error locations. Result: UNSAFE, OverallTime: 46.3s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5958 SDtfs, 6792 SDslu, 13653 SDs, 0 SdLazy, 5533 SolverSat, 342 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 32 SyntacticMatches, 10 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115674occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 23.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 185521 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 889 NumberOfCodeBlocks, 889 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 804 ConstructedInterpolants, 0 QuantifiedInterpolants, 232583 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...