./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix026_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3f589c2d-0c33-4ae8-830c-e4ed1bc00243/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_3f589c2d-0c33-4ae8-830c-e4ed1bc00243/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3f589c2d-0c33-4ae8-830c-e4ed1bc00243/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3f589c2d-0c33-4ae8-830c-e4ed1bc00243/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3f589c2d-0c33-4ae8-830c-e4ed1bc00243/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3f589c2d-0c33-4ae8-830c-e4ed1bc00243/bin/uautomizer --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 4d112a400c8602f9777d01abaed30a0bb1c8437a .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-69874e2 [2020-12-01 15:09:26,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 15:09:26,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 15:09:26,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 15:09:26,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 15:09:26,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 15:09:26,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 15:09:26,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 15:09:26,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 15:09:26,661 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 15:09:26,663 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 15:09:26,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 15:09:26,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 15:09:26,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 15:09:26,680 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 15:09:26,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 15:09:26,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 15:09:26,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 15:09:26,692 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 15:09:26,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 15:09:26,704 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 15:09:26,710 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 15:09:26,712 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 15:09:26,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 15:09:26,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 15:09:26,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 15:09:26,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 15:09:26,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 15:09:26,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 15:09:26,726 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 15:09:26,727 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 15:09:26,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 15:09:26,732 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 15:09:26,735 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 15:09:26,736 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 15:09:26,736 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 15:09:26,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 15:09:26,737 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 15:09:26,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 15:09:26,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 15:09:26,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 15:09:26,740 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3f589c2d-0c33-4ae8-830c-e4ed1bc00243/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-01 15:09:26,769 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 15:09:26,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 15:09:26,771 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 15:09:26,772 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 15:09:26,772 INFO L138 SettingsManager]: * Use SBE=true [2020-12-01 15:09:26,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 15:09:26,773 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 15:09:26,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 15:09:26,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 15:09:26,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 15:09:26,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 15:09:26,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 15:09:26,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 15:09:26,774 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 15:09:26,775 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 15:09:26,775 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 15:09:26,775 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 15:09:26,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 15:09:26,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-01 15:09:26,776 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 15:09:26,776 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-01 15:09:26,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-01 15:09:26,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 15:09:26,777 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 15:09:26,777 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 15:09:26,778 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-01 15:09:26,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 15:09:26,778 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 15:09:26,778 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-01 15:09:26,779 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:/tmp/vcloud-vcloud-master/worker/run_dir_3f589c2d-0c33-4ae8-830c-e4ed1bc00243/bin/uautomizer/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 -> /tmp/vcloud-vcloud-master/worker/run_dir_3f589c2d-0c33-4ae8-830c-e4ed1bc00243/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(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 -> 4d112a400c8602f9777d01abaed30a0bb1c8437a [2020-12-01 15:09:27,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 15:09:27,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 15:09:27,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 15:09:27,095 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 15:09:27,096 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 15:09:27,098 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3f589c2d-0c33-4ae8-830c-e4ed1bc00243/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix026_power.opt.i [2020-12-01 15:09:27,182 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3f589c2d-0c33-4ae8-830c-e4ed1bc00243/bin/uautomizer/data/1757c7898/cd616f845d1a4896b9aec31f1b6dd3d1/FLAGd6c0c6236 [2020-12-01 15:09:27,862 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 15:09:27,865 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3f589c2d-0c33-4ae8-830c-e4ed1bc00243/sv-benchmarks/c/pthread-wmm/mix026_power.opt.i [2020-12-01 15:09:27,893 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3f589c2d-0c33-4ae8-830c-e4ed1bc00243/bin/uautomizer/data/1757c7898/cd616f845d1a4896b9aec31f1b6dd3d1/FLAGd6c0c6236 [2020-12-01 15:09:28,164 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3f589c2d-0c33-4ae8-830c-e4ed1bc00243/bin/uautomizer/data/1757c7898/cd616f845d1a4896b9aec31f1b6dd3d1 [2020-12-01 15:09:28,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 15:09:28,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 15:09:28,173 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 15:09:28,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 15:09:28,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 15:09:28,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:09:28" (1/1) ... [2020-12-01 15:09:28,194 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@613ea95b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:09:28, skipping insertion in model container [2020-12-01 15:09:28,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:09:28" (1/1) ... [2020-12-01 15:09:28,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 15:09:28,252 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 15:09:28,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:09:28,755 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 15:09:28,835 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:09:28,944 INFO L208 MainTranslator]: Completed translation [2020-12-01 15:09:28,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:09:28 WrapperNode [2020-12-01 15:09:28,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 15:09:28,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 15:09:28,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 15:09:28,948 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 15:09:28,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:09:28" (1/1) ... [2020-12-01 15:09:29,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:09:28" (1/1) ... [2020-12-01 15:09:29,056 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 15:09:29,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 15:09:29,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 15:09:29,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 15:09:29,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:09:28" (1/1) ... [2020-12-01 15:09:29,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:09:28" (1/1) ... [2020-12-01 15:09:29,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:09:28" (1/1) ... [2020-12-01 15:09:29,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:09:28" (1/1) ... [2020-12-01 15:09:29,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:09:28" (1/1) ... [2020-12-01 15:09:29,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:09:28" (1/1) ... [2020-12-01 15:09:29,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:09:28" (1/1) ... [2020-12-01 15:09:29,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 15:09:29,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 15:09:29,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 15:09:29,122 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 15:09:29,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:09:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3f589c2d-0c33-4ae8-830c-e4ed1bc00243/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-01 15:09:29,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-01 15:09:29,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-01 15:09:29,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 15:09:29,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-01 15:09:29,206 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-01 15:09:29,207 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-01 15:09:29,207 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-01 15:09:29,207 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-01 15:09:29,207 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-01 15:09:29,208 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-01 15:09:29,208 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-12-01 15:09:29,208 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-12-01 15:09:29,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 15:09:29,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-01 15:09:29,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 15:09:29,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 15:09:29,211 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-01 15:09:31,575 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 15:09:31,575 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-12-01 15:09:31,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:09:31 BoogieIcfgContainer [2020-12-01 15:09:31,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 15:09:31,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-01 15:09:31,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-01 15:09:31,588 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-01 15:09:31,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 03:09:28" (1/3) ... [2020-12-01 15:09:31,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4137d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:09:31, skipping insertion in model container [2020-12-01 15:09:31,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:09:28" (2/3) ... [2020-12-01 15:09:31,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4137d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:09:31, skipping insertion in model container [2020-12-01 15:09:31,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:09:31" (3/3) ... [2020-12-01 15:09:31,592 INFO L111 eAbstractionObserver]: Analyzing ICFG mix026_power.opt.i [2020-12-01 15:09:31,610 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-01 15:09:31,610 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-01 15:09:31,614 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-01 15:09:31,616 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-01 15:09:31,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,686 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,687 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,687 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,688 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,695 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,714 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,717 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,717 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,718 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,718 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,718 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,719 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,720 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,721 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,731 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,734 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,739 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,739 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,740 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,740 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,740 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,741 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,742 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,742 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,742 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,743 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,747 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,747 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,748 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,748 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,748 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,748 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,749 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,749 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,750 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,750 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,750 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,750 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,751 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,751 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,751 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,751 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,751 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,751 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,752 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,752 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,752 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,752 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,756 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,757 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,758 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,758 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,758 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,758 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,758 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,759 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,759 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,759 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,759 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,759 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,764 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,770 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,771 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,777 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,778 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,778 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,792 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,792 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,794 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,794 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,794 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,794 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,794 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,795 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,795 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,795 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,795 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,795 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:09:31,797 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-01 15:09:31,809 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-01 15:09:31,843 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-01 15:09:31,843 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-01 15:09:31,843 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-01 15:09:31,843 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-01 15:09:31,843 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-01 15:09:31,844 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-01 15:09:31,844 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-01 15:09:31,844 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-01 15:09:31,861 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-01 15:09:31,864 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 121 transitions, 262 flow [2020-12-01 15:09:31,868 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 121 transitions, 262 flow [2020-12-01 15:09:31,870 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 121 transitions, 262 flow [2020-12-01 15:09:31,947 INFO L129 PetriNetUnfolder]: 3/117 cut-off events. [2020-12-01 15:09:31,947 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-01 15:09:31,959 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-12-01 15:09:31,967 INFO L116 LiptonReduction]: Number of co-enabled transitions 2870 [2020-12-01 15:09:32,496 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:32,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:32,503 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:32,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:32,516 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:32,517 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:32,523 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:32,524 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:32,602 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:32,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:32,606 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:32,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:32,613 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:32,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:32,618 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:32,619 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:33,311 WARN L197 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-01 15:09:33,423 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-12-01 15:09:33,970 WARN L197 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-12-01 15:09:33,985 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-12-01 15:09:33,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:34,456 WARN L197 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2020-12-01 15:09:34,556 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:34,556 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-01 15:09:34,563 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:34,563 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:34,685 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:34,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:34,689 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:09:34,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:09:34,692 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-01 15:09:34,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:09:34,696 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:09:34,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:09:34,701 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:34,702 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:34,704 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:34,704 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:34,711 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:34,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:34,956 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:34,957 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:34,958 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:34,958 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:34,961 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:34,962 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:34,965 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:34,965 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:34,995 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:34,995 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:34,996 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:34,997 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:35,000 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,001 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:35,004 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,005 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:35,134 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-01 15:09:35,135 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:35,178 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,178 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:35,179 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,180 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:35,182 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,183 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:35,185 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,186 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:35,212 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,213 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:35,214 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,214 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:35,217 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,217 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:35,220 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,220 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:35,257 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,257 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:35,258 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,258 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:35,261 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,261 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:35,263 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,264 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:35,289 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,289 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:35,290 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,290 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:35,293 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,293 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:35,296 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,296 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:35,352 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:35,354 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,356 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:35,358 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,358 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:35,361 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,361 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:35,388 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,388 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:35,390 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,391 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:35,398 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:35,401 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,401 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:35,613 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:35,630 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:09:35,630 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:09:35,632 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-01 15:09:35,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:09:35,634 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:09:35,634 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:09:35,637 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:35,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:35,639 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:35,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:35,641 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:35,641 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:35,714 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:35,715 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-01 15:09:35,718 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:35,718 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:35,863 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,864 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:35,865 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,865 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:35,867 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,868 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:35,870 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,870 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:35,897 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,898 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:35,908 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,909 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:35,912 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:35,915 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:35,915 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:36,115 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-12-01 15:09:36,238 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2020-12-01 15:09:36,387 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2020-12-01 15:09:36,709 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:36,710 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:36,711 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:36,711 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:36,714 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:36,715 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:36,725 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:36,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:36,744 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:36,745 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:36,746 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:36,746 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:36,748 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:36,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:36,750 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:36,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:36,800 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:36,800 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:36,801 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:36,802 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:36,803 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:36,804 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:36,806 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:36,806 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:36,828 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:36,829 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:36,831 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:36,831 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:36,833 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:36,834 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:36,836 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:36,836 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:37,090 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:37,091 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:37,099 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:09:37,099 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:09:37,100 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-01 15:09:37,100 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:09:37,101 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:09:37,102 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:09:37,104 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:37,104 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:37,106 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:37,106 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:37,108 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:37,108 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:37,160 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:37,160 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-01 15:09:37,163 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:37,163 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:37,678 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:37,679 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-01 15:09:37,681 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:37,681 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:37,756 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:37,756 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:37,759 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:09:37,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:09:37,761 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-01 15:09:37,762 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:09:37,763 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:09:37,763 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:09:37,765 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:37,766 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:37,767 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:37,768 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:37,770 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:37,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:38,209 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:38,210 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:38,211 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:38,211 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:38,214 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:38,214 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:38,216 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:38,217 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:38,239 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:38,240 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:38,241 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:38,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:38,243 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:38,243 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:38,245 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:38,245 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:38,511 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:38,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:38,512 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:38,513 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:38,526 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:38,528 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:38,531 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:38,533 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:38,554 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:38,555 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:38,555 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:38,556 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:38,558 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:38,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:38,560 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:38,561 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:39,443 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:39,443 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:39,444 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:39,445 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:39,446 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:39,447 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:39,449 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:39,449 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:39,467 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:39,468 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:39,469 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:39,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:39,471 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:39,471 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:39,473 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:39,473 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:39,624 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-12-01 15:09:39,761 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-12-01 15:09:39,947 WARN L197 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-12-01 15:09:40,106 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-12-01 15:09:40,192 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:40,193 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:40,193 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:40,194 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:40,196 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:40,196 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:40,198 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:40,199 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:40,217 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:40,218 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:40,218 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:40,219 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:40,220 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:40,221 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:40,223 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:40,223 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:40,268 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-01 15:09:40,269 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:40,429 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:40,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:40,430 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:40,430 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:40,432 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:40,432 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:40,434 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:40,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:40,452 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:40,452 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:40,453 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:40,453 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:40,455 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:40,455 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:40,457 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:40,457 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:40,511 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-01 15:09:40,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:40,534 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:40,534 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:40,535 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:40,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:40,537 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:40,537 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:40,539 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:40,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:40,558 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:40,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:40,559 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:40,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:40,561 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:40,562 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:40,564 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:40,564 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:09:40,840 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-01 15:09:40,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:40,842 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term [2020-12-01 15:09:40,842 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:40,843 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-01 15:09:40,844 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:40,952 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:40,952 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:40,954 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:09:40,955 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:09:40,956 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-01 15:09:40,956 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:09:40,957 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:09:40,958 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:09:40,960 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:40,961 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:40,963 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:40,963 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:40,966 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:40,967 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:41,027 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:41,027 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-01 15:09:41,030 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:41,030 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:41,377 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-01 15:09:41,378 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:41,379 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term [2020-12-01 15:09:41,379 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:41,380 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-01 15:09:41,381 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:41,426 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-01 15:09:41,426 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:41,470 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-01 15:09:41,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:41,532 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:41,532 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-01 15:09:41,534 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:41,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:41,579 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:09:41,579 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:09:41,581 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:09:41,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:09:41,582 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-01 15:09:41,582 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:09:41,583 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:09:41,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:09:41,586 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:41,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:41,587 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:41,587 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:41,588 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:09:41,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:09:42,384 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-12-01 15:09:42,539 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-12-01 15:09:42,705 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-12-01 15:09:42,854 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-12-01 15:09:43,461 WARN L197 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-12-01 15:09:43,785 WARN L197 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-12-01 15:09:44,475 WARN L197 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-12-01 15:09:44,788 WARN L197 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-12-01 15:09:44,797 INFO L131 LiptonReduction]: Checked pairs total: 8245 [2020-12-01 15:09:44,797 INFO L133 LiptonReduction]: Total number of compositions: 102 [2020-12-01 15:09:44,805 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 35 transitions, 90 flow [2020-12-01 15:09:45,235 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4618 states. [2020-12-01 15:09:45,237 INFO L276 IsEmpty]: Start isEmpty. Operand 4618 states. [2020-12-01 15:09:45,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-01 15:09:45,243 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:09:45,244 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-01 15:09:45,245 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:09:45,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:09:45,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1107556612, now seen corresponding path program 1 times [2020-12-01 15:09:45,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:09:45,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527548107] [2020-12-01 15:09:45,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:09:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:09:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:09:45,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527548107] [2020-12-01 15:09:45,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:09:45,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-01 15:09:45,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955190328] [2020-12-01 15:09:45,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:09:45,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:09:45,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:09:45,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:09:45,658 INFO L87 Difference]: Start difference. First operand 4618 states. Second operand 3 states. [2020-12-01 15:09:45,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:09:45,853 INFO L93 Difference]: Finished difference Result 3850 states and 15248 transitions. [2020-12-01 15:09:45,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:09:45,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-01 15:09:45,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:09:45,935 INFO L225 Difference]: With dead ends: 3850 [2020-12-01 15:09:45,935 INFO L226 Difference]: Without dead ends: 3250 [2020-12-01 15:09:45,936 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-12-01 15:09:45,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2020-12-01 15:09:46,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 3250. [2020-12-01 15:09:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3250 states. [2020-12-01 15:09:46,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3250 states to 3250 states and 12738 transitions. [2020-12-01 15:09:46,353 INFO L78 Accepts]: Start accepts. Automaton has 3250 states and 12738 transitions. Word has length 5 [2020-12-01 15:09:46,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:09:46,354 INFO L481 AbstractCegarLoop]: Abstraction has 3250 states and 12738 transitions. [2020-12-01 15:09:46,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:09:46,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3250 states and 12738 transitions. [2020-12-01 15:09:46,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-01 15:09:46,368 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:09:46,368 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:09:46,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-01 15:09:46,369 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:09:46,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:09:46,373 INFO L82 PathProgramCache]: Analyzing trace with hash 585064176, now seen corresponding path program 1 times [2020-12-01 15:09:46,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:09:46,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146430049] [2020-12-01 15:09:46,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:09:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:09:46,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:09:46,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146430049] [2020-12-01 15:09:46,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:09:46,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-01 15:09:46,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647952231] [2020-12-01 15:09:46,540 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:09:46,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:09:46,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:09:46,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:09:46,541 INFO L87 Difference]: Start difference. First operand 3250 states and 12738 transitions. Second operand 4 states. [2020-12-01 15:09:46,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:09:46,651 INFO L93 Difference]: Finished difference Result 3450 states and 13108 transitions. [2020-12-01 15:09:46,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:09:46,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-01 15:09:46,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:09:46,691 INFO L225 Difference]: With dead ends: 3450 [2020-12-01 15:09:46,691 INFO L226 Difference]: Without dead ends: 2850 [2020-12-01 15:09:46,692 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-12-01 15:09:46,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2020-12-01 15:09:46,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 2850. [2020-12-01 15:09:46,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2850 states. [2020-12-01 15:09:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2850 states and 10998 transitions. [2020-12-01 15:09:46,850 INFO L78 Accepts]: Start accepts. Automaton has 2850 states and 10998 transitions. Word has length 12 [2020-12-01 15:09:46,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:09:46,851 INFO L481 AbstractCegarLoop]: Abstraction has 2850 states and 10998 transitions. [2020-12-01 15:09:46,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:09:46,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2850 states and 10998 transitions. [2020-12-01 15:09:46,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-01 15:09:46,855 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:09:46,856 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:09:46,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-01 15:09:46,856 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:09:46,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:09:46,868 INFO L82 PathProgramCache]: Analyzing trace with hash -578663249, now seen corresponding path program 1 times [2020-12-01 15:09:46,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:09:46,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485210137] [2020-12-01 15:09:46,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:09:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:09:47,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:09:47,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485210137] [2020-12-01 15:09:47,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:09:47,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:09:47,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945557372] [2020-12-01 15:09:47,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:09:47,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:09:47,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:09:47,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:09:47,035 INFO L87 Difference]: Start difference. First operand 2850 states and 10998 transitions. Second operand 4 states. [2020-12-01 15:09:47,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:09:47,121 INFO L93 Difference]: Finished difference Result 2682 states and 9308 transitions. [2020-12-01 15:09:47,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:09:47,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-12-01 15:09:47,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:09:47,145 INFO L225 Difference]: With dead ends: 2682 [2020-12-01 15:09:47,145 INFO L226 Difference]: Without dead ends: 2082 [2020-12-01 15:09:47,145 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-12-01 15:09:47,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2020-12-01 15:09:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 2082. [2020-12-01 15:09:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2020-12-01 15:09:47,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 7158 transitions. [2020-12-01 15:09:47,240 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 7158 transitions. Word has length 14 [2020-12-01 15:09:47,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:09:47,241 INFO L481 AbstractCegarLoop]: Abstraction has 2082 states and 7158 transitions. [2020-12-01 15:09:47,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:09:47,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 7158 transitions. [2020-12-01 15:09:47,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-01 15:09:47,246 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:09:47,246 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:09:47,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-01 15:09:47,246 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:09:47,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:09:47,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1585129171, now seen corresponding path program 1 times [2020-12-01 15:09:47,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:09:47,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879788808] [2020-12-01 15:09:47,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:09:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:09:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:09:47,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879788808] [2020-12-01 15:09:47,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:09:47,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:09:47,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494527288] [2020-12-01 15:09:47,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:09:47,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:09:47,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:09:47,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:09:47,449 INFO L87 Difference]: Start difference. First operand 2082 states and 7158 transitions. Second operand 5 states. [2020-12-01 15:09:47,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:09:47,516 INFO L93 Difference]: Finished difference Result 1610 states and 5028 transitions. [2020-12-01 15:09:47,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:09:47,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-12-01 15:09:47,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:09:47,618 INFO L225 Difference]: With dead ends: 1610 [2020-12-01 15:09:47,618 INFO L226 Difference]: Without dead ends: 1250 [2020-12-01 15:09:47,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:09:47,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-12-01 15:09:47,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2020-12-01 15:09:47,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2020-12-01 15:09:47,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 3830 transitions. [2020-12-01 15:09:47,675 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 3830 transitions. Word has length 17 [2020-12-01 15:09:47,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:09:47,676 INFO L481 AbstractCegarLoop]: Abstraction has 1250 states and 3830 transitions. [2020-12-01 15:09:47,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:09:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 3830 transitions. [2020-12-01 15:09:47,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 15:09:47,680 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:09:47,680 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:09:47,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-01 15:09:47,681 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:09:47,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:09:47,681 INFO L82 PathProgramCache]: Analyzing trace with hash 641380582, now seen corresponding path program 1 times [2020-12-01 15:09:47,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:09:47,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966451928] [2020-12-01 15:09:47,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:09:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:09:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:09:47,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966451928] [2020-12-01 15:09:47,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:09:47,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:09:47,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905322393] [2020-12-01 15:09:47,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:09:47,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:09:47,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:09:47,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:09:47,836 INFO L87 Difference]: Start difference. First operand 1250 states and 3830 transitions. Second operand 5 states. [2020-12-01 15:09:47,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:09:47,899 INFO L93 Difference]: Finished difference Result 1736 states and 5170 transitions. [2020-12-01 15:09:47,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:09:47,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-12-01 15:09:47,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:09:47,913 INFO L225 Difference]: With dead ends: 1736 [2020-12-01 15:09:47,913 INFO L226 Difference]: Without dead ends: 1316 [2020-12-01 15:09:47,914 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:09:47,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2020-12-01 15:09:47,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1250. [2020-12-01 15:09:47,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2020-12-01 15:09:47,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 3733 transitions. [2020-12-01 15:09:47,969 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 3733 transitions. Word has length 20 [2020-12-01 15:09:47,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:09:47,969 INFO L481 AbstractCegarLoop]: Abstraction has 1250 states and 3733 transitions. [2020-12-01 15:09:47,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:09:47,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 3733 transitions. [2020-12-01 15:09:47,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 15:09:47,974 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:09:47,974 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:09:47,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-01 15:09:47,974 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:09:47,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:09:47,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1249433772, now seen corresponding path program 2 times [2020-12-01 15:09:47,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:09:47,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207063238] [2020-12-01 15:09:47,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:09:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:09:48,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:09:48,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207063238] [2020-12-01 15:09:48,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:09:48,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 15:09:48,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916219024] [2020-12-01 15:09:48,159 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:09:48,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:09:48,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:09:48,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:09:48,160 INFO L87 Difference]: Start difference. First operand 1250 states and 3733 transitions. Second operand 6 states. [2020-12-01 15:09:48,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:09:48,247 INFO L93 Difference]: Finished difference Result 1026 states and 3035 transitions. [2020-12-01 15:09:48,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-01 15:09:48,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-12-01 15:09:48,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:09:48,259 INFO L225 Difference]: With dead ends: 1026 [2020-12-01 15:09:48,259 INFO L226 Difference]: Without dead ends: 914 [2020-12-01 15:09:48,260 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-12-01 15:09:48,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2020-12-01 15:09:48,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 914. [2020-12-01 15:09:48,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2020-12-01 15:09:48,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 2745 transitions. [2020-12-01 15:09:48,297 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 2745 transitions. Word has length 20 [2020-12-01 15:09:48,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:09:48,297 INFO L481 AbstractCegarLoop]: Abstraction has 914 states and 2745 transitions. [2020-12-01 15:09:48,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:09:48,297 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 2745 transitions. [2020-12-01 15:09:48,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 15:09:48,301 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:09:48,301 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:09:48,301 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-01 15:09:48,302 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:09:48,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:09:48,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1904092351, now seen corresponding path program 1 times [2020-12-01 15:09:48,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:09:48,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685635208] [2020-12-01 15:09:48,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:09:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:09:48,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:09:48,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685635208] [2020-12-01 15:09:48,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:09:48,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 15:09:48,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114213001] [2020-12-01 15:09:48,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:09:48,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:09:48,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:09:48,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:09:48,540 INFO L87 Difference]: Start difference. First operand 914 states and 2745 transitions. Second operand 6 states. [2020-12-01 15:09:48,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:09:48,787 INFO L93 Difference]: Finished difference Result 1756 states and 5013 transitions. [2020-12-01 15:09:48,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 15:09:48,788 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-12-01 15:09:48,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:09:48,802 INFO L225 Difference]: With dead ends: 1756 [2020-12-01 15:09:48,802 INFO L226 Difference]: Without dead ends: 1434 [2020-12-01 15:09:48,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-01 15:09:48,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-12-01 15:09:48,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1072. [2020-12-01 15:09:48,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2020-12-01 15:09:48,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 3148 transitions. [2020-12-01 15:09:48,851 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 3148 transitions. Word has length 24 [2020-12-01 15:09:48,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:09:48,852 INFO L481 AbstractCegarLoop]: Abstraction has 1072 states and 3148 transitions. [2020-12-01 15:09:48,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:09:48,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 3148 transitions. [2020-12-01 15:09:48,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 15:09:48,858 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:09:48,858 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:09:48,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-01 15:09:48,859 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:09:48,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:09:48,860 INFO L82 PathProgramCache]: Analyzing trace with hash 2137822849, now seen corresponding path program 2 times [2020-12-01 15:09:48,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:09:48,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494755518] [2020-12-01 15:09:48,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:09:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:09:49,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:09:49,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494755518] [2020-12-01 15:09:49,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:09:49,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:09:49,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163818201] [2020-12-01 15:09:49,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-01 15:09:49,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:09:49,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-01 15:09:49,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-01 15:09:49,108 INFO L87 Difference]: Start difference. First operand 1072 states and 3148 transitions. Second operand 8 states. [2020-12-01 15:09:49,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:09:49,440 INFO L93 Difference]: Finished difference Result 1342 states and 3793 transitions. [2020-12-01 15:09:49,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 15:09:49,440 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-12-01 15:09:49,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:09:49,452 INFO L225 Difference]: With dead ends: 1342 [2020-12-01 15:09:49,453 INFO L226 Difference]: Without dead ends: 1257 [2020-12-01 15:09:49,453 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-12-01 15:09:49,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2020-12-01 15:09:49,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1024. [2020-12-01 15:09:49,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2020-12-01 15:09:49,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 2992 transitions. [2020-12-01 15:09:49,494 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 2992 transitions. Word has length 24 [2020-12-01 15:09:49,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:09:49,495 INFO L481 AbstractCegarLoop]: Abstraction has 1024 states and 2992 transitions. [2020-12-01 15:09:49,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-01 15:09:49,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 2992 transitions. [2020-12-01 15:09:49,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 15:09:49,499 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:09:49,499 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:09:49,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-01 15:09:49,499 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:09:49,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:09:49,500 INFO L82 PathProgramCache]: Analyzing trace with hash -863779263, now seen corresponding path program 3 times [2020-12-01 15:09:49,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:09:49,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429087651] [2020-12-01 15:09:49,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:09:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:09:49,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:09:49,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429087651] [2020-12-01 15:09:49,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:09:49,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:09:49,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632034226] [2020-12-01 15:09:49,613 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 15:09:49,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:09:49,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 15:09:49,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:09:49,615 INFO L87 Difference]: Start difference. First operand 1024 states and 2992 transitions. Second operand 7 states. [2020-12-01 15:09:49,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:09:49,725 INFO L93 Difference]: Finished difference Result 981 states and 2903 transitions. [2020-12-01 15:09:49,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 15:09:49,726 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-12-01 15:09:49,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:09:49,730 INFO L225 Difference]: With dead ends: 981 [2020-12-01 15:09:49,730 INFO L226 Difference]: Without dead ends: 487 [2020-12-01 15:09:49,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-12-01 15:09:49,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2020-12-01 15:09:49,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2020-12-01 15:09:49,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2020-12-01 15:09:49,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1342 transitions. [2020-12-01 15:09:49,747 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1342 transitions. Word has length 24 [2020-12-01 15:09:49,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:09:49,748 INFO L481 AbstractCegarLoop]: Abstraction has 487 states and 1342 transitions. [2020-12-01 15:09:49,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 15:09:49,749 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1342 transitions. [2020-12-01 15:09:49,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-01 15:09:49,752 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:09:49,753 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:09:49,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-01 15:09:49,753 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:09:49,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:09:49,754 INFO L82 PathProgramCache]: Analyzing trace with hash 816534982, now seen corresponding path program 1 times [2020-12-01 15:09:49,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:09:49,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041518210] [2020-12-01 15:09:49,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:09:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:09:49,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:09:49,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041518210] [2020-12-01 15:09:49,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:09:49,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-01 15:09:49,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988088915] [2020-12-01 15:09:49,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-01 15:09:49,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:09:49,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-01 15:09:49,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-12-01 15:09:49,966 INFO L87 Difference]: Start difference. First operand 487 states and 1342 transitions. Second operand 9 states. [2020-12-01 15:09:50,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:09:50,277 INFO L93 Difference]: Finished difference Result 750 states and 2056 transitions. [2020-12-01 15:09:50,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 15:09:50,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-12-01 15:09:50,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:09:50,281 INFO L225 Difference]: With dead ends: 750 [2020-12-01 15:09:50,281 INFO L226 Difference]: Without dead ends: 543 [2020-12-01 15:09:50,281 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-12-01 15:09:50,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-12-01 15:09:50,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 515. [2020-12-01 15:09:50,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2020-12-01 15:09:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 1399 transitions. [2020-12-01 15:09:50,299 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 1399 transitions. Word has length 28 [2020-12-01 15:09:50,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:09:50,299 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 1399 transitions. [2020-12-01 15:09:50,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-01 15:09:50,300 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 1399 transitions. [2020-12-01 15:09:50,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-01 15:09:50,302 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:09:50,302 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:09:50,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-01 15:09:50,302 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:09:50,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:09:50,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1985417662, now seen corresponding path program 2 times [2020-12-01 15:09:50,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:09:50,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938291457] [2020-12-01 15:09:50,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:09:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:09:50,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:09:50,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938291457] [2020-12-01 15:09:50,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:09:50,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:09:50,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640298193] [2020-12-01 15:09:50,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:09:50,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:09:50,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:09:50,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:09:50,398 INFO L87 Difference]: Start difference. First operand 515 states and 1399 transitions. Second operand 5 states. [2020-12-01 15:09:50,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:09:50,439 INFO L93 Difference]: Finished difference Result 722 states and 1943 transitions. [2020-12-01 15:09:50,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:09:50,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-12-01 15:09:50,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:09:50,442 INFO L225 Difference]: With dead ends: 722 [2020-12-01 15:09:50,442 INFO L226 Difference]: Without dead ends: 307 [2020-12-01 15:09:50,442 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:09:50,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2020-12-01 15:09:50,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2020-12-01 15:09:50,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2020-12-01 15:09:50,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 790 transitions. [2020-12-01 15:09:50,453 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 790 transitions. Word has length 28 [2020-12-01 15:09:50,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:09:50,453 INFO L481 AbstractCegarLoop]: Abstraction has 307 states and 790 transitions. [2020-12-01 15:09:50,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:09:50,453 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 790 transitions. [2020-12-01 15:09:50,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-01 15:09:50,454 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:09:50,455 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:09:50,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-01 15:09:50,455 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:09:50,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:09:50,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1665187146, now seen corresponding path program 3 times [2020-12-01 15:09:50,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:09:50,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65236661] [2020-12-01 15:09:50,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:09:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:09:50,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:09:50,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65236661] [2020-12-01 15:09:50,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:09:50,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:09:50,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80837620] [2020-12-01 15:09:50,691 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-01 15:09:50,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:09:50,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-01 15:09:50,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-01 15:09:50,698 INFO L87 Difference]: Start difference. First operand 307 states and 790 transitions. Second operand 8 states. [2020-12-01 15:09:50,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:09:50,951 INFO L93 Difference]: Finished difference Result 540 states and 1371 transitions. [2020-12-01 15:09:50,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 15:09:50,952 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-12-01 15:09:50,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:09:50,957 INFO L225 Difference]: With dead ends: 540 [2020-12-01 15:09:50,957 INFO L226 Difference]: Without dead ends: 480 [2020-12-01 15:09:50,958 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-12-01 15:09:50,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2020-12-01 15:09:50,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 359. [2020-12-01 15:09:50,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2020-12-01 15:09:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 918 transitions. [2020-12-01 15:09:50,971 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 918 transitions. Word has length 28 [2020-12-01 15:09:50,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:09:50,973 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 918 transitions. [2020-12-01 15:09:50,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-01 15:09:50,973 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 918 transitions. [2020-12-01 15:09:50,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-01 15:09:50,975 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:09:50,976 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:09:50,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-01 15:09:50,976 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:09:50,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:09:50,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1412135050, now seen corresponding path program 4 times [2020-12-01 15:09:50,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:09:50,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504888839] [2020-12-01 15:09:50,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:09:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:09:51,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:09:51,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504888839] [2020-12-01 15:09:51,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:09:51,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-01 15:09:51,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979196691] [2020-12-01 15:09:51,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-01 15:09:51,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:09:51,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-01 15:09:51,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-01 15:09:51,355 INFO L87 Difference]: Start difference. First operand 359 states and 918 transitions. Second operand 9 states. [2020-12-01 15:09:51,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:09:51,638 INFO L93 Difference]: Finished difference Result 526 states and 1327 transitions. [2020-12-01 15:09:51,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 15:09:51,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-12-01 15:09:51,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:09:51,641 INFO L225 Difference]: With dead ends: 526 [2020-12-01 15:09:51,641 INFO L226 Difference]: Without dead ends: 357 [2020-12-01 15:09:51,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-12-01 15:09:51,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2020-12-01 15:09:51,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 257. [2020-12-01 15:09:51,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2020-12-01 15:09:51,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 628 transitions. [2020-12-01 15:09:51,657 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 628 transitions. Word has length 28 [2020-12-01 15:09:51,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:09:51,657 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 628 transitions. [2020-12-01 15:09:51,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-01 15:09:51,657 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 628 transitions. [2020-12-01 15:09:51,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-01 15:09:51,659 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:09:51,659 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:09:51,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-01 15:09:51,659 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:09:51,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:09:51,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1556957636, now seen corresponding path program 5 times [2020-12-01 15:09:51,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:09:51,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72540071] [2020-12-01 15:09:51,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:09:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:09:51,725 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:09:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:09:51,827 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:09:51,897 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:09:51,897 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-01 15:09:51,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-01 15:09:52,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 03:09:52 BasicIcfg [2020-12-01 15:09:52,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-01 15:09:52,076 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 15:09:52,076 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 15:09:52,077 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 15:09:52,077 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:09:31" (3/4) ... [2020-12-01 15:09:52,079 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 15:09:52,279 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3f589c2d-0c33-4ae8-830c-e4ed1bc00243/bin/uautomizer/witness.graphml [2020-12-01 15:09:52,280 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 15:09:52,282 INFO L168 Benchmark]: Toolchain (without parser) took 24109.32 ms. Allocated memory was 94.4 MB in the beginning and 337.6 MB in the end (delta: 243.3 MB). Free memory was 60.4 MB in the beginning and 122.9 MB in the end (delta: -62.5 MB). Peak memory consumption was 180.7 MB. Max. memory is 16.1 GB. [2020-12-01 15:09:52,283 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 69.2 MB. Free memory was 31.2 MB in the beginning and 31.2 MB in the end (delta: 33.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 15:09:52,283 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.37 ms. Allocated memory is still 94.4 MB. Free memory was 60.2 MB in the beginning and 46.1 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-01 15:09:52,284 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.19 ms. Allocated memory is still 94.4 MB. Free memory was 46.1 MB in the beginning and 43.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:09:52,284 INFO L168 Benchmark]: Boogie Preprocessor took 63.06 ms. Allocated memory is still 94.4 MB. Free memory was 43.9 MB in the beginning and 41.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:09:52,284 INFO L168 Benchmark]: RCFGBuilder took 2456.64 ms. Allocated memory was 94.4 MB in the beginning and 113.2 MB in the end (delta: 18.9 MB). Free memory was 41.5 MB in the beginning and 69.1 MB in the end (delta: -27.6 MB). Peak memory consumption was 33.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:09:52,285 INFO L168 Benchmark]: TraceAbstraction took 20492.89 ms. Allocated memory was 113.2 MB in the beginning and 337.6 MB in the end (delta: 224.4 MB). Free memory was 69.1 MB in the beginning and 148.0 MB in the end (delta: -79.0 MB). Peak memory consumption was 146.4 MB. Max. memory is 16.1 GB. [2020-12-01 15:09:52,285 INFO L168 Benchmark]: Witness Printer took 203.52 ms. Allocated memory is still 337.6 MB. Free memory was 148.0 MB in the beginning and 122.9 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2020-12-01 15:09:52,289 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.34 ms. Allocated memory is still 69.2 MB. Free memory was 31.2 MB in the beginning and 31.2 MB in the end (delta: 33.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 774.37 ms. Allocated memory is still 94.4 MB. Free memory was 60.2 MB in the beginning and 46.1 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 109.19 ms. Allocated memory is still 94.4 MB. Free memory was 46.1 MB in the beginning and 43.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 63.06 ms. Allocated memory is still 94.4 MB. Free memory was 43.9 MB in the beginning and 41.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2456.64 ms. Allocated memory was 94.4 MB in the beginning and 113.2 MB in the end (delta: 18.9 MB). Free memory was 41.5 MB in the beginning and 69.1 MB in the end (delta: -27.6 MB). Peak memory consumption was 33.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20492.89 ms. Allocated memory was 113.2 MB in the beginning and 337.6 MB in the end (delta: 224.4 MB). Free memory was 69.1 MB in the beginning and 148.0 MB in the end (delta: -79.0 MB). Peak memory consumption was 146.4 MB. Max. memory is 16.1 GB. * Witness Printer took 203.52 ms. Allocated memory is still 337.6 MB. Free memory was 148.0 MB in the beginning and 122.9 MB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 2089 VarBasedMoverChecksPositive, 88 VarBasedMoverChecksNegative, 22 SemBasedMoverChecksPositive, 66 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.3s, 241 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 12.9s, 131 PlacesBefore, 47 PlacesAfterwards, 121 TransitionsBefore, 35 TransitionsAfterwards, 2870 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 2 ChoiceCompositions, 102 TotalNumberOfCompositions, 8245 MoverChecksTotal - CounterExampleResult [Line: 18]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p3_EAX = 0; [L719] 0 int __unbuffered_p3_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff0_thd4; [L733] 0 _Bool x$r_buff1_thd0; [L734] 0 _Bool x$r_buff1_thd1; [L735] 0 _Bool x$r_buff1_thd2; [L736] 0 _Bool x$r_buff1_thd3; [L737] 0 _Bool x$r_buff1_thd4; [L738] 0 _Bool x$read_delayed; [L739] 0 int *x$read_delayed_var; [L740] 0 int x$w_buff0; [L741] 0 _Bool x$w_buff0_used; [L742] 0 int x$w_buff1; [L743] 0 _Bool x$w_buff1_used; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L862] 0 pthread_t t685; [L863] FCALL, FORK 0 pthread_create(&t685, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t686; [L865] FCALL, FORK 0 pthread_create(&t686, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L781] 2 x$w_buff1 = x$w_buff0 [L782] 2 x$w_buff0 = 1 [L783] 2 x$w_buff1_used = x$w_buff0_used [L784] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L786] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L787] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L788] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L789] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L790] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L791] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L866] 0 pthread_t t687; [L867] FCALL, FORK 0 pthread_create(&t687, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L794] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L811] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L814] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L817] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L817] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L818] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L819] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L820] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L821] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L868] 0 pthread_t t688; [L869] FCALL, FORK 0 pthread_create(&t688, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L834] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L837] 4 __unbuffered_p3_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L753] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x [L760] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L761] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L761] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L761] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L762] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L762] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L762] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L763] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L763] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L763] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L764] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L764] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L765] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L765] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L766] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L766] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L766] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L766] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EAX = x [L768] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L840] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L840] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L840] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L840] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L841] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L841] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L842] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L842] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L843] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L843] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L844] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L844] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L801] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L4] COND FALSE 0 !(!cond) [L875] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L875] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L875] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L875] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L876] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L876] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L877] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L877] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L878] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L878] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L879] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L879] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L882] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L19] COND TRUE 0 !expression [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "mix026_power.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.0s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.3s, HoareTripleCheckerStatistics: 591 SDtfs, 794 SDslu, 1704 SDs, 0 SdLazy, 569 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4618occurred 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.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 910 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 259 ConstructedInterpolants, 0 QuantifiedInterpolants, 39986 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...