./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi010_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/rfi010_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 02b1eb230d4166cb684cab2937b3d6466047a004 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.2.0-5485861 [2020-10-26 00:27:01,985 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 00:27:01,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 00:27:02,023 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 00:27:02,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 00:27:02,026 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 00:27:02,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 00:27:02,031 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 00:27:02,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 00:27:02,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 00:27:02,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 00:27:02,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 00:27:02,052 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 00:27:02,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 00:27:02,055 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 00:27:02,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 00:27:02,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 00:27:02,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 00:27:02,062 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 00:27:02,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 00:27:02,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 00:27:02,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 00:27:02,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 00:27:02,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 00:27:02,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 00:27:02,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 00:27:02,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 00:27:02,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 00:27:02,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 00:27:02,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 00:27:02,081 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 00:27:02,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 00:27:02,083 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 00:27:02,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 00:27:02,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 00:27:02,087 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 00:27:02,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 00:27:02,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 00:27:02,089 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 00:27:02,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 00:27:02,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 00:27:02,093 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-26 00:27:02,124 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 00:27:02,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 00:27:02,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 00:27:02,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 00:27:02,127 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 00:27:02,128 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 00:27:02,128 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 00:27:02,128 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 00:27:02,129 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 00:27:02,129 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 00:27:02,129 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-26 00:27:02,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-26 00:27:02,130 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-26 00:27:02,131 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 00:27:02,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 00:27:02,131 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 00:27:02,132 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-26 00:27:02,132 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 00:27:02,132 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 00:27:02,133 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-26 00:27:02,133 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-26 00:27:02,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 00:27:02,134 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 00:27:02,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-26 00:27:02,141 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-26 00:27:02,141 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 00:27:02,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-26 00:27:02,142 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-26 00:27:02,142 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 00:27:02,142 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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(reach_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 -> 02b1eb230d4166cb684cab2937b3d6466047a004 [2020-10-26 00:27:02,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 00:27:02,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 00:27:02,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 00:27:02,672 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 00:27:02,674 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 00:27:02,676 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi010_rmo.opt.i [2020-10-26 00:27:02,772 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ba10776b/d12c258de5544c07aeb0575373fdf9dd/FLAGcde02db28 [2020-10-26 00:27:03,706 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 00:27:03,707 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi010_rmo.opt.i [2020-10-26 00:27:03,730 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ba10776b/d12c258de5544c07aeb0575373fdf9dd/FLAGcde02db28 [2020-10-26 00:27:03,851 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ba10776b/d12c258de5544c07aeb0575373fdf9dd [2020-10-26 00:27:03,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 00:27:03,861 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 00:27:03,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 00:27:03,863 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 00:27:03,870 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 00:27:03,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 12:27:03" (1/1) ... [2020-10-26 00:27:03,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2657efc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:27:03, skipping insertion in model container [2020-10-26 00:27:03,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 12:27:03" (1/1) ... [2020-10-26 00:27:03,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 00:27:03,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 00:27:04,439 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 00:27:04,456 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 00:27:04,564 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 00:27:04,728 INFO L208 MainTranslator]: Completed translation [2020-10-26 00:27:04,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:27:04 WrapperNode [2020-10-26 00:27:04,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 00:27:04,731 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 00:27:04,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 00:27:04,732 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 00:27:04,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:27:04" (1/1) ... [2020-10-26 00:27:04,803 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:27:04" (1/1) ... [2020-10-26 00:27:04,843 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 00:27:04,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 00:27:04,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 00:27:04,844 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 00:27:04,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:27:04" (1/1) ... [2020-10-26 00:27:04,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:27:04" (1/1) ... [2020-10-26 00:27:04,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:27:04" (1/1) ... [2020-10-26 00:27:04,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:27:04" (1/1) ... [2020-10-26 00:27:04,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:27:04" (1/1) ... [2020-10-26 00:27:04,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:27:04" (1/1) ... [2020-10-26 00:27:04,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:27:04" (1/1) ... [2020-10-26 00:27:04,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 00:27:04,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 00:27:04,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 00:27:04,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 00:27:04,896 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:27:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-26 00:27:04,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 00:27:04,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-26 00:27:04,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 00:27:04,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 00:27:04,995 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-26 00:27:04,995 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-26 00:27:04,995 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-26 00:27:04,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-26 00:27:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 00:27:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-26 00:27:04,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 00:27:04,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 00:27:04,998 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-26 00:27:07,915 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 00:27:07,915 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-26 00:27:07,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:27:07 BoogieIcfgContainer [2020-10-26 00:27:07,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 00:27:07,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-26 00:27:07,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-26 00:27:07,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-26 00:27:07,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 12:27:03" (1/3) ... [2020-10-26 00:27:07,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b22b091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 12:27:07, skipping insertion in model container [2020-10-26 00:27:07,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:27:04" (2/3) ... [2020-10-26 00:27:07,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b22b091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 12:27:07, skipping insertion in model container [2020-10-26 00:27:07,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:27:07" (3/3) ... [2020-10-26 00:27:07,953 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi010_rmo.opt.i [2020-10-26 00:27:07,981 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-26 00:27:07,981 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-26 00:27:07,990 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-26 00:27:07,995 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-26 00:27:08,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,082 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,082 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,082 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,082 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,082 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,106 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,106 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,106 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,108 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,111 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,112 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,113 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,121 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,123 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,130 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,130 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,131 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,134 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:27:08,138 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-26 00:27:08,151 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-26 00:27:08,194 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-26 00:27:08,194 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-26 00:27:08,194 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-26 00:27:08,194 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 00:27:08,194 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 00:27:08,195 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-26 00:27:08,195 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 00:27:08,195 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-26 00:27:08,214 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-26 00:27:08,216 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 86 transitions, 182 flow [2020-10-26 00:27:08,220 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 86 transitions, 182 flow [2020-10-26 00:27:08,222 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 90 places, 86 transitions, 182 flow [2020-10-26 00:27:08,268 INFO L129 PetriNetUnfolder]: 3/84 cut-off events. [2020-10-26 00:27:08,269 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-26 00:27:08,273 INFO L80 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 3/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2020-10-26 00:27:08,275 INFO L116 LiptonReduction]: Number of co-enabled transitions 1026 [2020-10-26 00:27:08,506 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-10-26 00:27:08,769 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-10-26 00:27:09,176 WARN L193 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-26 00:27:09,323 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-26 00:27:09,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:27:09,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:09,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:27:09,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:09,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:27:09,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:27:09,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:27:09,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:27:09,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:27:09,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:09,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:27:09,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:09,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:27:09,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:27:09,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:27:09,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:27:09,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:27:09,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:09,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:27:09,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:27:09,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:09,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:27:09,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:27:09,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:27:09,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:27:09,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:09,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:09,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:09,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:09,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:09,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:09,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-26 00:27:09,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:27:09,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:09,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:27:09,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:09,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:27:09,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:09,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:27:09,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:27:09,923 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:27:09,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:27:09,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:27:09,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:09,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:27:09,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:09,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:27:09,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:27:09,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:27:09,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:27:10,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:27:10,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:10,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:10,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:10,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:27:10,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:10,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:10,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:10,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:10,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:10,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:10,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:27:10,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:27:10,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:27:10,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:27:10,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:10,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:10,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:10,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:27:10,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:10,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:10,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:10,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:10,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:10,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:10,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:10,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:10,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:27:10,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:27:10,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:27:10,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:27:10,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:10,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:10,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:10,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:10,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:10,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:10,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:10,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:10,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:10,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:10,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:27:10,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:27:10,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:27:10,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:27:10,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:10,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:10,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:10,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:11,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:11,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:11,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:11,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:11,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:11,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:11,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:11,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:11,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:11,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:11,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:11,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:11,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:11,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:27:11,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:11,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:27:11,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:11,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:27:11,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:27:11,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:11,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:11,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:11,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:11,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:11,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:27:11,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:11,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:27:11,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:27:11,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:11,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:27:11,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:27:11,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:27:11,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:27:11,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:11,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:11,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:11,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:11,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:11,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:11,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-26 00:27:11,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:27:11,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:11,543 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-26 00:27:11,673 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-26 00:27:11,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:11,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-26 00:27:11,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:27:11,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:11,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:27:11,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:11,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:27:11,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:27:11,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:11,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:27:11,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:27:11,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:27:11,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:27:11,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:11,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:11,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:11,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:11,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:12,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:27:12,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:12,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:27:12,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:27:12,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:12,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:27:12,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:27:12,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:27:12,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:27:12,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:12,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:12,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:12,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:12,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:12,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:12,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:27:12,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:27:12,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:12,331 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:12,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:27:12,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:27:12,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:12,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:27:12,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:27:12,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:27:12,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:27:12,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:12,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:27:12,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:27:12,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:27:12,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:27:12,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:12,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:12,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:12,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:27:12,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:27:13,432 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2020-10-26 00:27:14,381 WARN L193 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2020-10-26 00:27:14,602 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-26 00:27:14,796 INFO L131 LiptonReduction]: Checked pairs total: 2466 [2020-10-26 00:27:14,797 INFO L133 LiptonReduction]: Total number of compositions: 85 [2020-10-26 00:27:14,804 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow [2020-10-26 00:27:14,821 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 150 states. [2020-10-26 00:27:14,823 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2020-10-26 00:27:14,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-26 00:27:14,829 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:27:14,830 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-26 00:27:14,831 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:27:14,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:27:14,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1138784107, now seen corresponding path program 1 times [2020-10-26 00:27:14,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:27:14,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892287812] [2020-10-26 00:27:14,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:27:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:27:15,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:27:15,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892287812] [2020-10-26 00:27:15,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:27:15,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-26 00:27:15,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12432238] [2020-10-26 00:27:15,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:27:15,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:27:15,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:27:15,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:27:15,216 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 3 states. [2020-10-26 00:27:15,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:27:15,304 INFO L93 Difference]: Finished difference Result 130 states and 302 transitions. [2020-10-26 00:27:15,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:27:15,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-26 00:27:15,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:27:15,325 INFO L225 Difference]: With dead ends: 130 [2020-10-26 00:27:15,326 INFO L226 Difference]: Without dead ends: 106 [2020-10-26 00:27:15,327 INFO L677 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 [2020-10-26 00:27:15,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-26 00:27:15,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-10-26 00:27:15,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-26 00:27:15,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 240 transitions. [2020-10-26 00:27:15,404 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 240 transitions. Word has length 5 [2020-10-26 00:27:15,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:27:15,405 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 240 transitions. [2020-10-26 00:27:15,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:27:15,405 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 240 transitions. [2020-10-26 00:27:15,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-26 00:27:15,406 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:27:15,406 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:27:15,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-26 00:27:15,407 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:27:15,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:27:15,412 INFO L82 PathProgramCache]: Analyzing trace with hash -845069286, now seen corresponding path program 1 times [2020-10-26 00:27:15,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:27:15,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208743368] [2020-10-26 00:27:15,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:27:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:27:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:27:15,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208743368] [2020-10-26 00:27:15,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:27:15,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-26 00:27:15,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331639894] [2020-10-26 00:27:15,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:27:15,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:27:15,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:27:15,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:27:15,565 INFO L87 Difference]: Start difference. First operand 106 states and 240 transitions. Second operand 3 states. [2020-10-26 00:27:15,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:27:15,591 INFO L93 Difference]: Finished difference Result 98 states and 218 transitions. [2020-10-26 00:27:15,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:27:15,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-26 00:27:15,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:27:15,594 INFO L225 Difference]: With dead ends: 98 [2020-10-26 00:27:15,594 INFO L226 Difference]: Without dead ends: 98 [2020-10-26 00:27:15,596 INFO L677 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 [2020-10-26 00:27:15,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-10-26 00:27:15,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2020-10-26 00:27:15,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-10-26 00:27:15,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 218 transitions. [2020-10-26 00:27:15,614 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 218 transitions. Word has length 7 [2020-10-26 00:27:15,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:27:15,615 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 218 transitions. [2020-10-26 00:27:15,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:27:15,616 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 218 transitions. [2020-10-26 00:27:15,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-26 00:27:15,617 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:27:15,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:27:15,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-26 00:27:15,617 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:27:15,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:27:15,618 INFO L82 PathProgramCache]: Analyzing trace with hash -362793876, now seen corresponding path program 1 times [2020-10-26 00:27:15,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:27:15,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873070162] [2020-10-26 00:27:15,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:27:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:27:15,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:27:15,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873070162] [2020-10-26 00:27:15,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:27:15,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 00:27:15,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245349307] [2020-10-26 00:27:15,830 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 00:27:15,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:27:15,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 00:27:15,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:27:15,831 INFO L87 Difference]: Start difference. First operand 98 states and 218 transitions. Second operand 4 states. [2020-10-26 00:27:15,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:27:15,875 INFO L93 Difference]: Finished difference Result 83 states and 154 transitions. [2020-10-26 00:27:15,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 00:27:15,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-10-26 00:27:15,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:27:15,877 INFO L225 Difference]: With dead ends: 83 [2020-10-26 00:27:15,878 INFO L226 Difference]: Without dead ends: 59 [2020-10-26 00:27:15,878 INFO L677 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 [2020-10-26 00:27:15,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-26 00:27:15,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-10-26 00:27:15,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-26 00:27:15,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 101 transitions. [2020-10-26 00:27:15,892 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 101 transitions. Word has length 9 [2020-10-26 00:27:15,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:27:15,893 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 101 transitions. [2020-10-26 00:27:15,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 00:27:15,893 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 101 transitions. [2020-10-26 00:27:15,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-26 00:27:15,894 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:27:15,894 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:27:15,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-26 00:27:15,894 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:27:15,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:27:15,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1167521103, now seen corresponding path program 1 times [2020-10-26 00:27:15,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:27:15,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679728651] [2020-10-26 00:27:15,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:27:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:27:16,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:27:16,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679728651] [2020-10-26 00:27:16,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:27:16,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 00:27:16,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116727571] [2020-10-26 00:27:16,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 00:27:16,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:27:16,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 00:27:16,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:27:16,142 INFO L87 Difference]: Start difference. First operand 59 states and 101 transitions. Second operand 5 states. [2020-10-26 00:27:16,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:27:16,212 INFO L93 Difference]: Finished difference Result 46 states and 73 transitions. [2020-10-26 00:27:16,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 00:27:16,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-26 00:27:16,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:27:16,214 INFO L225 Difference]: With dead ends: 46 [2020-10-26 00:27:16,214 INFO L226 Difference]: Without dead ends: 37 [2020-10-26 00:27:16,215 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-26 00:27:16,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-26 00:27:16,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-26 00:27:16,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-26 00:27:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 57 transitions. [2020-10-26 00:27:16,218 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 57 transitions. Word has length 12 [2020-10-26 00:27:16,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:27:16,219 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 57 transitions. [2020-10-26 00:27:16,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 00:27:16,219 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 57 transitions. [2020-10-26 00:27:16,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-26 00:27:16,220 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:27:16,220 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:27:16,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-26 00:27:16,220 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:27:16,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:27:16,220 INFO L82 PathProgramCache]: Analyzing trace with hash 491964803, now seen corresponding path program 1 times [2020-10-26 00:27:16,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:27:16,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493593038] [2020-10-26 00:27:16,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:27:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:27:16,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:27:16,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493593038] [2020-10-26 00:27:16,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:27:16,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 00:27:16,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946244618] [2020-10-26 00:27:16,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 00:27:16,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:27:16,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 00:27:16,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:27:16,373 INFO L87 Difference]: Start difference. First operand 37 states and 57 transitions. Second operand 4 states. [2020-10-26 00:27:16,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:27:16,398 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2020-10-26 00:27:16,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 00:27:16,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-26 00:27:16,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:27:16,400 INFO L225 Difference]: With dead ends: 48 [2020-10-26 00:27:16,400 INFO L226 Difference]: Without dead ends: 22 [2020-10-26 00:27:16,400 INFO L677 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 [2020-10-26 00:27:16,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-10-26 00:27:16,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-10-26 00:27:16,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-26 00:27:16,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-10-26 00:27:16,407 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 15 [2020-10-26 00:27:16,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:27:16,408 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-10-26 00:27:16,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 00:27:16,408 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2020-10-26 00:27:16,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-26 00:27:16,408 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:27:16,409 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:27:16,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-26 00:27:16,409 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:27:16,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:27:16,409 INFO L82 PathProgramCache]: Analyzing trace with hash -139330135, now seen corresponding path program 2 times [2020-10-26 00:27:16,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:27:16,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513293926] [2020-10-26 00:27:16,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:27:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:27:16,961 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 35 [2020-10-26 00:27:17,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:27:17,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513293926] [2020-10-26 00:27:17,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:27:17,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 00:27:17,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545283930] [2020-10-26 00:27:17,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 00:27:17,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:27:17,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 00:27:17,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-26 00:27:17,026 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 7 states. [2020-10-26 00:27:17,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:27:17,253 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2020-10-26 00:27:17,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 00:27:17,254 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-26 00:27:17,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:27:17,255 INFO L225 Difference]: With dead ends: 28 [2020-10-26 00:27:17,255 INFO L226 Difference]: Without dead ends: 18 [2020-10-26 00:27:17,256 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-26 00:27:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-10-26 00:27:17,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-10-26 00:27:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-26 00:27:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-10-26 00:27:17,258 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2020-10-26 00:27:17,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:27:17,258 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-10-26 00:27:17,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 00:27:17,259 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-10-26 00:27:17,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-26 00:27:17,259 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:27:17,259 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:27:17,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-26 00:27:17,259 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:27:17,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:27:17,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1672616011, now seen corresponding path program 3 times [2020-10-26 00:27:17,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:27:17,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804901740] [2020-10-26 00:27:17,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:27:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 00:27:17,326 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 00:27:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 00:27:17,389 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 00:27:17,427 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 00:27:17,427 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-26 00:27:17,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-26 00:27:17,429 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-26 00:27:17,445 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1140] [1140] L3-->L837: Formula: (let ((.cse6 (= (mod ~y$w_buff0_used~0_In-185658993 256) 0)) (.cse7 (= (mod ~y$r_buff0_thd0~0_In-185658993 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In-185658993 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In-185658993 256) 0))) (let ((.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse3 (not .cse7)) (.cse4 (not .cse6)) (.cse5 (or .cse6 .cse7))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-185658993 0)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-185658993 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-185658993|) (or (and .cse0 (= ~y$w_buff1_used~0_Out-185658993 0) .cse1) (and (= ~y$w_buff1_used~0_Out-185658993 ~y$w_buff1_used~0_In-185658993) .cse2)) (or (and .cse3 (= ~y~0_Out-185658993 ~y$w_buff0~0_In-185658993) .cse4) (and (or (and .cse2 (= ~y~0_Out-185658993 ~y~0_In-185658993)) (and .cse0 (= ~y~0_Out-185658993 ~y$w_buff1~0_In-185658993) .cse1)) .cse5)) (or (and .cse3 (= ~y$w_buff0_used~0_Out-185658993 0) .cse4) (and .cse5 (= ~y$w_buff0_used~0_Out-185658993 ~y$w_buff0_used~0_In-185658993))) (= ~y$r_buff0_thd0~0_In-185658993 ~y$r_buff0_thd0~0_Out-185658993) (= ~y$r_buff1_thd0~0_Out-185658993 ~y$r_buff1_thd0~0_In-185658993)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-185658993|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-185658993, ~y$w_buff1~0=~y$w_buff1~0_In-185658993, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-185658993, ~y$w_buff0~0=~y$w_buff0~0_In-185658993, ~y~0=~y~0_In-185658993, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-185658993, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-185658993} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-185658993, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-185658993|, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-185658993|, ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-185658993|, ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-185658993|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-185658993|, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-185658993|, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-185658993|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-185658993, ~y$w_buff1~0=~y$w_buff1~0_In-185658993, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-185658993, ~y$w_buff0~0=~y$w_buff0~0_In-185658993, ~y~0=~y~0_Out-185658993, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-185658993, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-185658993} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite59, ~y~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite64, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-26 00:27:17,468 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,469 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,471 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,471 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,471 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,473 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,473 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,473 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,473 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,475 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,475 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,475 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,475 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,476 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,476 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,477 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,477 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,478 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,478 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,478 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,478 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,483 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,483 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,484 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,484 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,484 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,484 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,484 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,484 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,484 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,484 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,484 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,485 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,485 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,485 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,485 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,485 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,485 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,486 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,486 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,486 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,486 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,486 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,486 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,486 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 12:27:17 BasicIcfg [2020-10-26 00:27:17,560 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-26 00:27:17,561 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 00:27:17,561 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 00:27:17,561 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 00:27:17,563 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:27:07" (3/4) ... [2020-10-26 00:27:17,566 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-26 00:27:17,580 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1140] [1140] L3-->L837: Formula: (let ((.cse6 (= (mod ~y$w_buff0_used~0_In-185658993 256) 0)) (.cse7 (= (mod ~y$r_buff0_thd0~0_In-185658993 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In-185658993 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In-185658993 256) 0))) (let ((.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse3 (not .cse7)) (.cse4 (not .cse6)) (.cse5 (or .cse6 .cse7))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-185658993 0)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-185658993 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-185658993|) (or (and .cse0 (= ~y$w_buff1_used~0_Out-185658993 0) .cse1) (and (= ~y$w_buff1_used~0_Out-185658993 ~y$w_buff1_used~0_In-185658993) .cse2)) (or (and .cse3 (= ~y~0_Out-185658993 ~y$w_buff0~0_In-185658993) .cse4) (and (or (and .cse2 (= ~y~0_Out-185658993 ~y~0_In-185658993)) (and .cse0 (= ~y~0_Out-185658993 ~y$w_buff1~0_In-185658993) .cse1)) .cse5)) (or (and .cse3 (= ~y$w_buff0_used~0_Out-185658993 0) .cse4) (and .cse5 (= ~y$w_buff0_used~0_Out-185658993 ~y$w_buff0_used~0_In-185658993))) (= ~y$r_buff0_thd0~0_In-185658993 ~y$r_buff0_thd0~0_Out-185658993) (= ~y$r_buff1_thd0~0_Out-185658993 ~y$r_buff1_thd0~0_In-185658993)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-185658993|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-185658993, ~y$w_buff1~0=~y$w_buff1~0_In-185658993, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-185658993, ~y$w_buff0~0=~y$w_buff0~0_In-185658993, ~y~0=~y~0_In-185658993, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-185658993, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-185658993} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-185658993, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-185658993|, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-185658993|, ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-185658993|, ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-185658993|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-185658993|, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-185658993|, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-185658993|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-185658993, ~y$w_buff1~0=~y$w_buff1~0_In-185658993, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-185658993, ~y$w_buff0~0=~y$w_buff0~0_In-185658993, ~y~0=~y~0_Out-185658993, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-185658993, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-185658993} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite59, ~y~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite64, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-26 00:27:17,581 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,582 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,582 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,582 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,582 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,582 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,583 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,583 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,583 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,583 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,583 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,583 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,584 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,584 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,584 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,584 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,584 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,584 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,585 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,585 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,585 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,585 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,585 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,585 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,586 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,586 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,586 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,586 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,587 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,588 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,588 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,588 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,588 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,588 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,588 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,589 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,589 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,589 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,589 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,589 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,589 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,589 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,590 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,590 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,590 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,590 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,590 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,590 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,591 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,591 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,591 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,591 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,591 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,591 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,592 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,592 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,592 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:27:17,592 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:27:17,738 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-26 00:27:17,739 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 00:27:17,740 INFO L168 Benchmark]: Toolchain (without parser) took 13884.03 ms. Allocated memory was 46.1 MB in the beginning and 249.6 MB in the end (delta: 203.4 MB). Free memory was 29.9 MB in the beginning and 201.7 MB in the end (delta: -171.8 MB). Peak memory consumption was 31.1 MB. Max. memory is 16.1 GB. [2020-10-26 00:27:17,741 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 33.6 MB. Free memory was 18.7 MB in the beginning and 18.7 MB in the end (delta: 42.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 00:27:17,741 INFO L168 Benchmark]: CACSL2BoogieTranslator took 866.58 ms. Allocated memory was 46.1 MB in the beginning and 58.7 MB in the end (delta: 12.6 MB). Free memory was 29.3 MB in the beginning and 38.8 MB in the end (delta: -9.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-10-26 00:27:17,742 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.02 ms. Allocated memory is still 58.7 MB. Free memory was 38.8 MB in the beginning and 35.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-26 00:27:17,742 INFO L168 Benchmark]: Boogie Preprocessor took 49.31 ms. Allocated memory is still 58.7 MB. Free memory was 35.9 MB in the beginning and 33.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 00:27:17,743 INFO L168 Benchmark]: RCFGBuilder took 3023.51 ms. Allocated memory was 58.7 MB in the beginning and 86.0 MB in the end (delta: 27.3 MB). Free memory was 33.6 MB in the beginning and 34.2 MB in the end (delta: -640.5 kB). Peak memory consumption was 42.3 MB. Max. memory is 16.1 GB. [2020-10-26 00:27:17,744 INFO L168 Benchmark]: TraceAbstraction took 9640.74 ms. Allocated memory was 86.0 MB in the beginning and 249.6 MB in the end (delta: 163.6 MB). Free memory was 33.4 MB in the beginning and 215.3 MB in the end (delta: -181.9 MB). Peak memory consumption was 120.9 MB. Max. memory is 16.1 GB. [2020-10-26 00:27:17,744 INFO L168 Benchmark]: Witness Printer took 178.08 ms. Allocated memory is still 249.6 MB. Free memory was 215.3 MB in the beginning and 201.7 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-10-26 00:27:17,749 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41 ms. Allocated memory is still 33.6 MB. Free memory was 18.7 MB in the beginning and 18.7 MB in the end (delta: 42.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 866.58 ms. Allocated memory was 46.1 MB in the beginning and 58.7 MB in the end (delta: 12.6 MB). Free memory was 29.3 MB in the beginning and 38.8 MB in the end (delta: -9.5 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 112.02 ms. Allocated memory is still 58.7 MB. Free memory was 38.8 MB in the beginning and 35.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 49.31 ms. Allocated memory is still 58.7 MB. Free memory was 35.9 MB in the beginning and 33.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3023.51 ms. Allocated memory was 58.7 MB in the beginning and 86.0 MB in the end (delta: 27.3 MB). Free memory was 33.6 MB in the beginning and 34.2 MB in the end (delta: -640.5 kB). Peak memory consumption was 42.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9640.74 ms. Allocated memory was 86.0 MB in the beginning and 249.6 MB in the end (delta: 163.6 MB). Free memory was 33.4 MB in the beginning and 215.3 MB in the end (delta: -181.9 MB). Peak memory consumption was 120.9 MB. Max. memory is 16.1 GB. * Witness Printer took 178.08 ms. Allocated memory is still 249.6 MB. Free memory was 215.3 MB in the beginning and 201.7 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 706 VarBasedMoverChecksPositive, 40 VarBasedMoverChecksNegative, 2 SemBasedMoverChecksPositive, 38 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.5s, 54 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.5s, 90 PlacesBefore, 26 PlacesAfterwards, 86 TransitionsBefore, 19 TransitionsAfterwards, 1026 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 85 TotalNumberOfCompositions, 2466 MoverChecksTotal - CounterExampleResult [Line: 18]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1771; [L824] FCALL, FORK 0 pthread_create(&t1771, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L825] 0 pthread_t t1772; [L826] FCALL, FORK 0 pthread_create(&t1772, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L771] 2 y$w_buff1 = y$w_buff0 [L772] 2 y$w_buff0 = 1 [L773] 2 y$w_buff1_used = y$w_buff0_used [L774] 2 y$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L776] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L777] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L778] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L779] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 y$flush_delayed = weak$$choice2 [L785] 2 y$mem_tmp = y [L786] 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) [L786] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 [L786] 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) [L786] 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) [L787] 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)) [L787] EXPR 2 !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) [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0 [L787] EXPR 2 !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) [L787] 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)) [L787] 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)) [L788] 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)) [L788] EXPR 2 !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) [L788] 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)) [L788] 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)) [L789] 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)) [L789] 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)) [L790] 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)) [L790] 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)) [L791] 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)) [L791] 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)) [L792] 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)) [L792] EXPR 2 !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) [L792] 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)) [L792] 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)) [L793] 2 __unbuffered_p1_EAX = y [L794] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L794] 2 y = y$flush_delayed ? y$mem_tmp : y [L795] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L798] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 y$flush_delayed = weak$$choice2 [L749] 1 y$mem_tmp = y [L750] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L750] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L751] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L751] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L752] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L752] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L753] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L753] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L754] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L754] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L754] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L754] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L755] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L755] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L755] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L756] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = y [L758] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L758] 1 y = y$flush_delayed ? y$mem_tmp : y [L759] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L801] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L802] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 2 return 0; [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L19] COND TRUE 0 !expression [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "rfi010_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 84 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.2s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 100 SDtfs, 80 SDslu, 132 SDs, 0 SdLazy, 80 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 4887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...