./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe031_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe031_pso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 792fb416799c35a0198c30afe0d8ffd8aea5a7fb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-26 00:33:29,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 00:33:29,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 00:33:29,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 00:33:29,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 00:33:29,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 00:33:29,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 00:33:29,098 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 00:33:29,106 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 00:33:29,107 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 00:33:29,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 00:33:29,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 00:33:29,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 00:33:29,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 00:33:29,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 00:33:29,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 00:33:29,128 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 00:33:29,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 00:33:29,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 00:33:29,136 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 00:33:29,140 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 00:33:29,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 00:33:29,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 00:33:29,147 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 00:33:29,153 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 00:33:29,154 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 00:33:29,155 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 00:33:29,157 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 00:33:29,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 00:33:29,159 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 00:33:29,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 00:33:29,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 00:33:29,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 00:33:29,163 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 00:33:29,164 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 00:33:29,165 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 00:33:29,165 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 00:33:29,166 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 00:33:29,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 00:33:29,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 00:33:29,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 00:33:29,170 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-26 00:33:29,226 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 00:33:29,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 00:33:29,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 00:33:29,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 00:33:29,231 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 00:33:29,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 00:33:29,231 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 00:33:29,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 00:33:29,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 00:33:29,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 00:33:29,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-26 00:33:29,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-26 00:33:29,234 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-26 00:33:29,234 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 00:33:29,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 00:33:29,234 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 00:33:29,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-26 00:33:29,235 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 00:33:29,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 00:33:29,235 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-26 00:33:29,235 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-26 00:33:29,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 00:33:29,236 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 00:33:29,236 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-26 00:33:29,236 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-26 00:33:29,236 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 00:33:29,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-26 00:33:29,237 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-26 00:33:29,237 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 00:33:29,237 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 792fb416799c35a0198c30afe0d8ffd8aea5a7fb [2020-10-26 00:33:29,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 00:33:29,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 00:33:29,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 00:33:29,699 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 00:33:29,700 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 00:33:29,701 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe031_pso.opt.i [2020-10-26 00:33:29,788 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a4a18695/3db11b0ab9174d7ea033de0810dec995/FLAG4a2126902 [2020-10-26 00:33:30,556 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 00:33:30,562 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe031_pso.opt.i [2020-10-26 00:33:30,596 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a4a18695/3db11b0ab9174d7ea033de0810dec995/FLAG4a2126902 [2020-10-26 00:33:30,743 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a4a18695/3db11b0ab9174d7ea033de0810dec995 [2020-10-26 00:33:30,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 00:33:30,755 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 00:33:30,760 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 00:33:30,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 00:33:30,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 00:33:30,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 12:33:30" (1/1) ... [2020-10-26 00:33:30,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@557f8fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:30, skipping insertion in model container [2020-10-26 00:33:30,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 12:33:30" (1/1) ... [2020-10-26 00:33:30,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 00:33:30,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 00:33:31,266 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 00:33:31,282 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 00:33:31,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 00:33:31,527 INFO L208 MainTranslator]: Completed translation [2020-10-26 00:33:31,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:31 WrapperNode [2020-10-26 00:33:31,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 00:33:31,529 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 00:33:31,530 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 00:33:31,530 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 00:33:31,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:31" (1/1) ... [2020-10-26 00:33:31,559 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:31" (1/1) ... [2020-10-26 00:33:31,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 00:33:31,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 00:33:31,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 00:33:31,623 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 00:33:31,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:31" (1/1) ... [2020-10-26 00:33:31,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:31" (1/1) ... [2020-10-26 00:33:31,638 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:31" (1/1) ... [2020-10-26 00:33:31,638 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:31" (1/1) ... [2020-10-26 00:33:31,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:31" (1/1) ... [2020-10-26 00:33:31,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:31" (1/1) ... [2020-10-26 00:33:31,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:31" (1/1) ... [2020-10-26 00:33:31,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 00:33:31,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 00:33:31,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 00:33:31,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 00:33:31,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 00:33:31,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 00:33:31,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-26 00:33:31,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 00:33:31,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 00:33:31,769 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-26 00:33:31,769 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-26 00:33:31,770 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-26 00:33:31,770 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-26 00:33:31,770 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-26 00:33:31,771 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-26 00:33:31,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 00:33:31,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-26 00:33:31,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 00:33:31,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 00:33:31,775 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-26 00:33:34,192 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 00:33:34,192 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-26 00:33:34,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:33:34 BoogieIcfgContainer [2020-10-26 00:33:34,194 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 00:33:34,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-26 00:33:34,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-26 00:33:34,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-26 00:33:34,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 12:33:30" (1/3) ... [2020-10-26 00:33:34,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e1e72d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 12:33:34, skipping insertion in model container [2020-10-26 00:33:34,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:31" (2/3) ... [2020-10-26 00:33:34,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e1e72d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 12:33:34, skipping insertion in model container [2020-10-26 00:33:34,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:33:34" (3/3) ... [2020-10-26 00:33:34,204 INFO L111 eAbstractionObserver]: Analyzing ICFG safe031_pso.opt.i [2020-10-26 00:33:34,217 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-26 00:33:34,217 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-26 00:33:34,223 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-26 00:33:34,224 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-26 00:33:34,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,272 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,272 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,273 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,273 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,276 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,276 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,277 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,278 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,280 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,280 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,282 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,283 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,283 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,283 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,283 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,283 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,284 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,284 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,284 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,284 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,284 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,284 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,289 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,289 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,291 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,291 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:34,294 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-26 00:33:34,309 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-26 00:33:34,334 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-26 00:33:34,334 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-26 00:33:34,334 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-26 00:33:34,334 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 00:33:34,335 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 00:33:34,335 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-26 00:33:34,335 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 00:33:34,335 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-26 00:33:34,350 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-26 00:33:34,352 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 100 transitions, 215 flow [2020-10-26 00:33:34,356 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 100 transitions, 215 flow [2020-10-26 00:33:34,358 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 107 places, 100 transitions, 215 flow [2020-10-26 00:33:34,409 INFO L129 PetriNetUnfolder]: 3/97 cut-off events. [2020-10-26 00:33:34,410 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-26 00:33:34,414 INFO L80 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-10-26 00:33:34,418 INFO L116 LiptonReduction]: Number of co-enabled transitions 1746 [2020-10-26 00:33:34,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:34,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:34,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:34,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:34,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:34,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:34,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:34,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:34,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:34,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:34,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:34,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:34,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:34,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:34,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:34,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:34,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:34,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:34,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:34,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:34,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:33:34,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:34,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:33:34,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:34,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:33:34,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:34,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:33:34,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:34,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:34,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:34,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-26 00:33:34,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-26 00:33:34,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:33:34,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:35,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:35,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-26 00:33:35,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:35,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:35,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:35,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-10-26 00:33:35,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:35,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:35,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:35,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:35,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-26 00:33:35,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-26 00:33:35,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:35,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:35,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:35,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:35,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:33:35,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:35,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-26 00:33:35,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-26 00:33:35,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:33:35,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:35,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:35,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:35,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:35,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:35,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:35,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:35,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:35,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:35,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:35,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:33:35,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:33:35,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:33:35,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:35,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:35,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:35,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:35,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,915 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-10-26 00:33:35,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:35,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:35,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:35,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:36,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:33:36,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:36,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-26 00:33:36,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:36,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:36,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:36,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:36,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:36,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:36,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:36,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:36,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:36,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:36,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:36,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:36,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:36,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:33:36,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:36,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:33:36,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:36,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:33:36,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:36,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:33:36,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:36,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:36,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:36,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-26 00:33:36,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-26 00:33:36,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:33:36,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:36,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:36,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:36,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:36,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:36,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:36,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:36,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:36,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:36,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-26 00:33:36,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:37,089 WARN L193 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-26 00:33:37,218 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-26 00:33:37,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-10-26 00:33:37,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:37,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:37,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:37,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:37,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:37,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:37,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:37,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:37,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:37,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-26 00:33:37,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:37,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-26 00:33:37,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:37,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-26 00:33:37,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:37,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:37,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:37,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:37,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:37,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:37,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:37,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:37,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:37,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:37,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:37,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:37,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:37,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:37,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:37,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:37,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:37,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:37,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:37,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:37,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:37,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:37,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:37,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:37,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:37,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:37,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:37,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:37,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:37,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:37,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:37,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:37,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:37,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:37,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:37,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:37,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:37,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:37,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:37,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:37,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:39,978 WARN L193 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-10-26 00:33:39,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-26 00:33:39,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:40,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-26 00:33:40,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:40,961 WARN L193 SmtUtils]: Spent 958.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-10-26 00:33:42,513 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2020-10-26 00:33:42,882 WARN L193 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-26 00:33:43,702 WARN L193 SmtUtils]: Spent 813.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2020-10-26 00:33:44,060 WARN L193 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-26 00:33:44,168 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-26 00:33:44,284 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-26 00:33:45,552 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-10-26 00:33:45,971 WARN L193 SmtUtils]: Spent 416.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-26 00:33:46,419 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2020-10-26 00:33:46,573 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-10-26 00:33:47,097 WARN L193 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-10-26 00:33:47,341 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-26 00:33:47,369 INFO L131 LiptonReduction]: Checked pairs total: 4721 [2020-10-26 00:33:47,369 INFO L133 LiptonReduction]: Total number of compositions: 93 [2020-10-26 00:33:47,376 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 67 flow [2020-10-26 00:33:47,420 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-10-26 00:33:47,422 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-10-26 00:33:47,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-26 00:33:47,428 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:47,429 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:47,429 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:47,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:47,436 INFO L82 PathProgramCache]: Analyzing trace with hash 117480453, now seen corresponding path program 1 times [2020-10-26 00:33:47,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:47,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084638630] [2020-10-26 00:33:47,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:47,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:33:47,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084638630] [2020-10-26 00:33:47,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:47,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-26 00:33:47,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248257435] [2020-10-26 00:33:47,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:33:47,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:47,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:33:47,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:33:47,831 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-10-26 00:33:47,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:47,968 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-10-26 00:33:47,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:33:47,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-26 00:33:47,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:48,006 INFO L225 Difference]: With dead ends: 550 [2020-10-26 00:33:48,006 INFO L226 Difference]: Without dead ends: 450 [2020-10-26 00:33:48,008 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:33:48,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-26 00:33:48,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-10-26 00:33:48,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-26 00:33:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-10-26 00:33:48,144 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-10-26 00:33:48,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:48,145 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-10-26 00:33:48,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:33:48,146 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-10-26 00:33:48,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-26 00:33:48,148 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:48,148 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:48,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-26 00:33:48,149 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:48,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:48,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1229600893, now seen corresponding path program 1 times [2020-10-26 00:33:48,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:48,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69358498] [2020-10-26 00:33:48,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:48,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:33:48,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69358498] [2020-10-26 00:33:48,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:48,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-26 00:33:48,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593729644] [2020-10-26 00:33:48,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:33:48,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:48,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:33:48,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:33:48,339 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-10-26 00:33:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:48,353 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2020-10-26 00:33:48,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:33:48,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-26 00:33:48,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:48,359 INFO L225 Difference]: With dead ends: 440 [2020-10-26 00:33:48,359 INFO L226 Difference]: Without dead ends: 440 [2020-10-26 00:33:48,360 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:33:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-10-26 00:33:48,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-10-26 00:33:48,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-10-26 00:33:48,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2020-10-26 00:33:48,384 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 9 [2020-10-26 00:33:48,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:48,385 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2020-10-26 00:33:48,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:33:48,385 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2020-10-26 00:33:48,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-26 00:33:48,389 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:48,389 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:48,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-26 00:33:48,390 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:48,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:48,391 INFO L82 PathProgramCache]: Analyzing trace with hash -537078871, now seen corresponding path program 1 times [2020-10-26 00:33:48,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:48,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74680151] [2020-10-26 00:33:48,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33: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-10-26 00:33:48,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74680151] [2020-10-26 00:33:48,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:48,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-26 00:33:48,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240430300] [2020-10-26 00:33:48,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:33:48,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:48,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:33:48,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:33:48,546 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 3 states. [2020-10-26 00:33:48,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:48,593 INFO L93 Difference]: Finished difference Result 434 states and 1298 transitions. [2020-10-26 00:33:48,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:33:48,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-26 00:33:48,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:48,599 INFO L225 Difference]: With dead ends: 434 [2020-10-26 00:33:48,600 INFO L226 Difference]: Without dead ends: 434 [2020-10-26 00:33:48,601 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:33:48,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-10-26 00:33:48,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-10-26 00:33:48,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-10-26 00:33:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1298 transitions. [2020-10-26 00:33:48,618 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1298 transitions. Word has length 10 [2020-10-26 00:33:48,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:48,618 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1298 transitions. [2020-10-26 00:33:48,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:33:48,619 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1298 transitions. [2020-10-26 00:33:48,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-26 00:33:48,627 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:48,627 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:48,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-26 00:33:48,628 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:48,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:48,629 INFO L82 PathProgramCache]: Analyzing trace with hash 530435755, now seen corresponding path program 1 times [2020-10-26 00:33:48,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:48,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096984444] [2020-10-26 00:33:48,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:48,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:33:48,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096984444] [2020-10-26 00:33:48,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:48,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 00:33:48,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2356198] [2020-10-26 00:33:48,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:33:48,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:48,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:33:48,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:33:48,731 INFO L87 Difference]: Start difference. First operand 434 states and 1298 transitions. Second operand 3 states. [2020-10-26 00:33:48,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:48,751 INFO L93 Difference]: Finished difference Result 599 states and 1720 transitions. [2020-10-26 00:33:48,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:33:48,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-26 00:33:48,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:48,755 INFO L225 Difference]: With dead ends: 599 [2020-10-26 00:33:48,755 INFO L226 Difference]: Without dead ends: 464 [2020-10-26 00:33:48,756 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:33:48,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-10-26 00:33:48,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 419. [2020-10-26 00:33:48,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2020-10-26 00:33:48,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 1201 transitions. [2020-10-26 00:33:48,774 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 1201 transitions. Word has length 11 [2020-10-26 00:33:48,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:48,775 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 1201 transitions. [2020-10-26 00:33:48,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:33:48,775 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 1201 transitions. [2020-10-26 00:33:48,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-26 00:33:48,776 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:48,777 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:48,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-26 00:33:48,777 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:48,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:48,777 INFO L82 PathProgramCache]: Analyzing trace with hash 530436747, now seen corresponding path program 1 times [2020-10-26 00:33:48,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:48,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785607296] [2020-10-26 00:33:48,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:48,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:33:48,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785607296] [2020-10-26 00:33:48,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:48,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 00:33:48,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167392556] [2020-10-26 00:33:48,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 00:33:48,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:48,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 00:33:48,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:33:48,957 INFO L87 Difference]: Start difference. First operand 419 states and 1201 transitions. Second operand 5 states. [2020-10-26 00:33:49,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:49,048 INFO L93 Difference]: Finished difference Result 407 states and 1157 transitions. [2020-10-26 00:33:49,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 00:33:49,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-26 00:33:49,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:49,055 INFO L225 Difference]: With dead ends: 407 [2020-10-26 00:33:49,056 INFO L226 Difference]: Without dead ends: 407 [2020-10-26 00:33:49,056 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-26 00:33:49,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2020-10-26 00:33:49,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2020-10-26 00:33:49,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-10-26 00:33:49,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1157 transitions. [2020-10-26 00:33:49,070 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1157 transitions. Word has length 11 [2020-10-26 00:33:49,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:49,070 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 1157 transitions. [2020-10-26 00:33:49,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 00:33:49,070 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1157 transitions. [2020-10-26 00:33:49,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-26 00:33:49,071 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:49,072 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:49,072 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-26 00:33:49,072 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:49,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:49,072 INFO L82 PathProgramCache]: Analyzing trace with hash -769299944, now seen corresponding path program 1 times [2020-10-26 00:33:49,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:49,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048969552] [2020-10-26 00:33:49,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:49,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:33:49,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048969552] [2020-10-26 00:33:49,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:49,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 00:33:49,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163615918] [2020-10-26 00:33:49,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 00:33:49,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:49,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 00:33:49,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:33:49,196 INFO L87 Difference]: Start difference. First operand 407 states and 1157 transitions. Second operand 5 states. [2020-10-26 00:33:49,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:49,279 INFO L93 Difference]: Finished difference Result 402 states and 1138 transitions. [2020-10-26 00:33:49,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 00:33:49,280 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-26 00:33:49,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:49,283 INFO L225 Difference]: With dead ends: 402 [2020-10-26 00:33:49,284 INFO L226 Difference]: Without dead ends: 402 [2020-10-26 00:33:49,284 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-26 00:33:49,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2020-10-26 00:33:49,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 398. [2020-10-26 00:33:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-10-26 00:33:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1127 transitions. [2020-10-26 00:33:49,297 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1127 transitions. Word has length 12 [2020-10-26 00:33:49,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:49,298 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 1127 transitions. [2020-10-26 00:33:49,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 00:33:49,298 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1127 transitions. [2020-10-26 00:33:49,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-26 00:33:49,299 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:49,299 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:49,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-26 00:33:49,300 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:49,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:49,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1921518076, now seen corresponding path program 1 times [2020-10-26 00:33:49,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:49,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801418418] [2020-10-26 00:33:49,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:33:49,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801418418] [2020-10-26 00:33:49,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:49,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 00:33:49,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824310194] [2020-10-26 00:33:49,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 00:33:49,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:49,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 00:33:49,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-26 00:33:49,414 INFO L87 Difference]: Start difference. First operand 398 states and 1127 transitions. Second operand 6 states. [2020-10-26 00:33:49,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:49,582 INFO L93 Difference]: Finished difference Result 440 states and 1227 transitions. [2020-10-26 00:33:49,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 00:33:49,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-26 00:33:49,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:49,587 INFO L225 Difference]: With dead ends: 440 [2020-10-26 00:33:49,588 INFO L226 Difference]: Without dead ends: 392 [2020-10-26 00:33:49,588 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-26 00:33:49,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2020-10-26 00:33:49,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2020-10-26 00:33:49,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-10-26 00:33:49,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1086 transitions. [2020-10-26 00:33:49,603 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1086 transitions. Word has length 13 [2020-10-26 00:33:49,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:49,604 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 1086 transitions. [2020-10-26 00:33:49,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 00:33:49,604 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1086 transitions. [2020-10-26 00:33:49,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-26 00:33:49,606 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:49,606 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:49,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-26 00:33:49,606 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:49,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:49,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1352377110, now seen corresponding path program 1 times [2020-10-26 00:33:49,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:49,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189539414] [2020-10-26 00:33:49,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:33:49,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189539414] [2020-10-26 00:33:49,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:49,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 00:33:49,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219382270] [2020-10-26 00:33:49,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 00:33:49,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:49,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 00:33:49,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:33:49,745 INFO L87 Difference]: Start difference. First operand 392 states and 1086 transitions. Second operand 4 states. [2020-10-26 00:33:49,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:49,790 INFO L93 Difference]: Finished difference Result 384 states and 935 transitions. [2020-10-26 00:33:49,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 00:33:49,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-26 00:33:49,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:49,794 INFO L225 Difference]: With dead ends: 384 [2020-10-26 00:33:49,794 INFO L226 Difference]: Without dead ends: 280 [2020-10-26 00:33:49,797 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:33:49,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-10-26 00:33:49,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2020-10-26 00:33:49,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-10-26 00:33:49,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 662 transitions. [2020-10-26 00:33:49,807 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 662 transitions. Word has length 13 [2020-10-26 00:33:49,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:49,807 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 662 transitions. [2020-10-26 00:33:49,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 00:33:49,808 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 662 transitions. [2020-10-26 00:33:49,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-26 00:33:49,809 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:49,809 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:49,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-26 00:33:49,809 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:49,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:49,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1882145435, now seen corresponding path program 1 times [2020-10-26 00:33:49,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:49,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220241064] [2020-10-26 00:33:49,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:33:49,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220241064] [2020-10-26 00:33:49,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:49,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 00:33:49,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965862099] [2020-10-26 00:33:49,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 00:33:49,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:49,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 00:33:49,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:33:49,968 INFO L87 Difference]: Start difference. First operand 280 states and 662 transitions. Second operand 5 states. [2020-10-26 00:33:50,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:50,030 INFO L93 Difference]: Finished difference Result 230 states and 495 transitions. [2020-10-26 00:33:50,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 00:33:50,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-26 00:33:50,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:50,032 INFO L225 Difference]: With dead ends: 230 [2020-10-26 00:33:50,032 INFO L226 Difference]: Without dead ends: 176 [2020-10-26 00:33:50,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-26 00:33:50,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-26 00:33:50,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2020-10-26 00:33:50,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-10-26 00:33:50,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 368 transitions. [2020-10-26 00:33:50,039 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 368 transitions. Word has length 14 [2020-10-26 00:33:50,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:50,040 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 368 transitions. [2020-10-26 00:33:50,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 00:33:50,040 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 368 transitions. [2020-10-26 00:33:50,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-26 00:33:50,041 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:50,041 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:50,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-26 00:33:50,041 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:50,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:50,042 INFO L82 PathProgramCache]: Analyzing trace with hash 573655817, now seen corresponding path program 1 times [2020-10-26 00:33:50,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:50,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494126055] [2020-10-26 00:33:50,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:50,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:33:50,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494126055] [2020-10-26 00:33:50,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:50,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 00:33:50,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195397589] [2020-10-26 00:33:50,159 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 00:33:50,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:50,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 00:33:50,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-26 00:33:50,160 INFO L87 Difference]: Start difference. First operand 176 states and 368 transitions. Second operand 6 states. [2020-10-26 00:33:50,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:50,232 INFO L93 Difference]: Finished difference Result 157 states and 329 transitions. [2020-10-26 00:33:50,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 00:33:50,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-26 00:33:50,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:50,233 INFO L225 Difference]: With dead ends: 157 [2020-10-26 00:33:50,234 INFO L226 Difference]: Without dead ends: 97 [2020-10-26 00:33:50,234 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-26 00:33:50,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-26 00:33:50,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2020-10-26 00:33:50,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-26 00:33:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 176 transitions. [2020-10-26 00:33:50,238 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 176 transitions. Word has length 16 [2020-10-26 00:33:50,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:50,238 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 176 transitions. [2020-10-26 00:33:50,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 00:33:50,238 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 176 transitions. [2020-10-26 00:33:50,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-26 00:33:50,239 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:50,239 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-10-26 00:33:50,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-26 00:33:50,239 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:50,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:50,239 INFO L82 PathProgramCache]: Analyzing trace with hash -2071543388, now seen corresponding path program 1 times [2020-10-26 00:33:50,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:50,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510311655] [2020-10-26 00:33:50,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:50,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:33:50,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510311655] [2020-10-26 00:33:50,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:50,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 00:33:50,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504496261] [2020-10-26 00:33:50,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 00:33:50,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:50,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 00:33:50,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-26 00:33:50,372 INFO L87 Difference]: Start difference. First operand 87 states and 176 transitions. Second operand 6 states. [2020-10-26 00:33:50,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:50,472 INFO L93 Difference]: Finished difference Result 141 states and 289 transitions. [2020-10-26 00:33:50,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 00:33:50,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-26 00:33:50,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:50,474 INFO L225 Difference]: With dead ends: 141 [2020-10-26 00:33:50,474 INFO L226 Difference]: Without dead ends: 75 [2020-10-26 00:33:50,475 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-26 00:33:50,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-10-26 00:33:50,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-10-26 00:33:50,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-26 00:33:50,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 152 transitions. [2020-10-26 00:33:50,478 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 152 transitions. Word has length 20 [2020-10-26 00:33:50,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:50,480 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 152 transitions. [2020-10-26 00:33:50,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 00:33:50,480 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 152 transitions. [2020-10-26 00:33:50,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-26 00:33:50,481 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:50,481 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-10-26 00:33:50,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-26 00:33:50,481 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:50,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:50,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1943956750, now seen corresponding path program 2 times [2020-10-26 00:33:50,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:50,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233193894] [2020-10-26 00:33:50,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:50,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:33:50,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233193894] [2020-10-26 00:33:50,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:50,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 00:33:50,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680279932] [2020-10-26 00:33:50,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 00:33:50,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:50,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 00:33:50,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:33:50,550 INFO L87 Difference]: Start difference. First operand 75 states and 152 transitions. Second operand 4 states. [2020-10-26 00:33:50,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:50,572 INFO L93 Difference]: Finished difference Result 101 states and 200 transitions. [2020-10-26 00:33:50,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 00:33:50,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-26 00:33:50,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:50,573 INFO L225 Difference]: With dead ends: 101 [2020-10-26 00:33:50,573 INFO L226 Difference]: Without dead ends: 47 [2020-10-26 00:33:50,574 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:33:50,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-26 00:33:50,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-26 00:33:50,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-26 00:33:50,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 80 transitions. [2020-10-26 00:33:50,577 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 80 transitions. Word has length 20 [2020-10-26 00:33:50,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:50,577 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 80 transitions. [2020-10-26 00:33:50,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 00:33:50,577 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2020-10-26 00:33:50,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-26 00:33:50,578 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:50,579 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-10-26 00:33:50,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-26 00:33:50,579 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:50,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:50,579 INFO L82 PathProgramCache]: Analyzing trace with hash -7896946, now seen corresponding path program 3 times [2020-10-26 00:33:50,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:50,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59826678] [2020-10-26 00:33:50,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 00:33:50,662 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 00:33:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 00:33:50,720 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 00:33:50,783 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 00:33:50,783 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-26 00:33:50,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-26 00:33:50,785 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-26 00:33:50,802 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L2-->L831: Formula: (let ((.cse6 (= (mod ~y$r_buff1_thd0~0_In-283423579 256) 0)) (.cse7 (= (mod ~y$w_buff1_used~0_In-283423579 256) 0)) (.cse8 (= (mod ~y$w_buff0_used~0_In-283423579 256) 0)) (.cse9 (= (mod ~y$r_buff0_thd0~0_In-283423579 256) 0))) (let ((.cse3 (or .cse8 .cse9)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse0 (not .cse7)) (.cse1 (not .cse6)) (.cse2 (or .cse6 .cse7))) (and (= ULTIMATE.start_assume_abort_if_not_~cond_Out-283423579 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-283423579|) (or (and (or (and .cse0 (= ~y~0_Out-283423579 ~y$w_buff1~0_In-283423579) .cse1) (and (= ~y~0_Out-283423579 ~y~0_In-283423579) .cse2)) .cse3) (and .cse4 .cse5 (= ~y~0_Out-283423579 ~y$w_buff0~0_In-283423579))) (= ~y$r_buff1_thd0~0_Out-283423579 ~y$r_buff1_thd0~0_In-283423579) (or (and (= ~y$w_buff0_used~0_Out-283423579 ~y$w_buff0_used~0_In-283423579) .cse3) (and .cse4 .cse5 (= ~y$w_buff0_used~0_Out-283423579 0))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-283423579 0)) (or (and (= ~y$w_buff1_used~0_Out-283423579 0) .cse0 .cse1) (and .cse2 (= ~y$w_buff1_used~0_Out-283423579 ~y$w_buff1_used~0_In-283423579))) (= ~y$r_buff0_thd0~0_In-283423579 ~y$r_buff0_thd0~0_Out-283423579)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-283423579|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-283423579, ~y$w_buff1~0=~y$w_buff1~0_In-283423579, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-283423579, ~y$w_buff0~0=~y$w_buff0~0_In-283423579, ~y~0=~y~0_In-283423579, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-283423579, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-283423579} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-283423579, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-283423579|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-283423579|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-283423579|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-283423579|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-283423579|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-283423579|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-283423579|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-283423579, ~y$w_buff1~0=~y$w_buff1~0_In-283423579, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-283423579, ~y$w_buff0~0=~y$w_buff0~0_In-283423579, ~y~0=~y~0_Out-283423579, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-283423579, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-283423579} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-26 00:33:50,811 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,811 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,812 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,812 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [777] [2020-10-26 00:33:50,813 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,813 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,814 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,815 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,815 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,815 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,815 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,815 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,815 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,815 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,816 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,816 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,816 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,816 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,817 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,817 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,817 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,817 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,817 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,817 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,817 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,818 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,818 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,818 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,818 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,818 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,819 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,819 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,819 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,819 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,819 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,819 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,824 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,825 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,825 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,825 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,825 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,825 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,825 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,825 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,825 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,825 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,825 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,826 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 12:33:50 BasicIcfg [2020-10-26 00:33:50,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-26 00:33:50,890 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 00:33:50,891 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 00:33:50,891 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 00:33:50,891 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:33:34" (3/4) ... [2020-10-26 00:33:50,894 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-26 00:33:50,903 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L2-->L831: Formula: (let ((.cse6 (= (mod ~y$r_buff1_thd0~0_In-283423579 256) 0)) (.cse7 (= (mod ~y$w_buff1_used~0_In-283423579 256) 0)) (.cse8 (= (mod ~y$w_buff0_used~0_In-283423579 256) 0)) (.cse9 (= (mod ~y$r_buff0_thd0~0_In-283423579 256) 0))) (let ((.cse3 (or .cse8 .cse9)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse0 (not .cse7)) (.cse1 (not .cse6)) (.cse2 (or .cse6 .cse7))) (and (= ULTIMATE.start_assume_abort_if_not_~cond_Out-283423579 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-283423579|) (or (and (or (and .cse0 (= ~y~0_Out-283423579 ~y$w_buff1~0_In-283423579) .cse1) (and (= ~y~0_Out-283423579 ~y~0_In-283423579) .cse2)) .cse3) (and .cse4 .cse5 (= ~y~0_Out-283423579 ~y$w_buff0~0_In-283423579))) (= ~y$r_buff1_thd0~0_Out-283423579 ~y$r_buff1_thd0~0_In-283423579) (or (and (= ~y$w_buff0_used~0_Out-283423579 ~y$w_buff0_used~0_In-283423579) .cse3) (and .cse4 .cse5 (= ~y$w_buff0_used~0_Out-283423579 0))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-283423579 0)) (or (and (= ~y$w_buff1_used~0_Out-283423579 0) .cse0 .cse1) (and .cse2 (= ~y$w_buff1_used~0_Out-283423579 ~y$w_buff1_used~0_In-283423579))) (= ~y$r_buff0_thd0~0_In-283423579 ~y$r_buff0_thd0~0_Out-283423579)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-283423579|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-283423579, ~y$w_buff1~0=~y$w_buff1~0_In-283423579, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-283423579, ~y$w_buff0~0=~y$w_buff0~0_In-283423579, ~y~0=~y~0_In-283423579, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-283423579, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-283423579} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-283423579, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-283423579|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-283423579|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-283423579|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-283423579|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-283423579|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-283423579|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-283423579|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-283423579, ~y$w_buff1~0=~y$w_buff1~0_In-283423579, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-283423579, ~y$w_buff0~0=~y$w_buff0~0_In-283423579, ~y~0=~y~0_Out-283423579, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-283423579, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-283423579} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-26 00:33:50,905 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,905 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,905 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,905 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [777] [2020-10-26 00:33:50,906 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,906 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,906 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,906 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,906 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,906 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,907 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,907 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,907 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,907 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,907 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,907 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,907 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,907 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,907 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,907 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,908 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,908 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,908 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,908 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,908 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,908 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,908 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,908 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,909 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,909 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,909 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,909 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,909 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,909 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,909 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,909 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,909 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,909 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,910 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,910 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,910 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,910 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,910 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,910 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,910 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,910 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:50,910 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-26 00:33:50,910 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:51,017 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-26 00:33:51,017 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 00:33:51,021 INFO L168 Benchmark]: Toolchain (without parser) took 20270.28 ms. Allocated memory was 41.9 MB in the beginning and 264.2 MB in the end (delta: 222.3 MB). Free memory was 25.8 MB in the beginning and 104.5 MB in the end (delta: -78.6 MB). Peak memory consumption was 142.7 MB. Max. memory is 16.1 GB. [2020-10-26 00:33:51,024 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 41.9 MB. Free memory is still 24.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 00:33:51,025 INFO L168 Benchmark]: CACSL2BoogieTranslator took 768.89 ms. Allocated memory was 41.9 MB in the beginning and 52.4 MB in the end (delta: 10.5 MB). Free memory was 25.2 MB in the beginning and 21.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 16.1 GB. [2020-10-26 00:33:51,025 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.54 ms. Allocated memory is still 52.4 MB. Free memory was 21.9 MB in the beginning and 33.0 MB in the end (delta: -11.1 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. [2020-10-26 00:33:51,026 INFO L168 Benchmark]: Boogie Preprocessor took 43.19 ms. Allocated memory is still 52.4 MB. Free memory was 33.0 MB in the beginning and 30.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 00:33:51,026 INFO L168 Benchmark]: RCFGBuilder took 2530.02 ms. Allocated memory was 52.4 MB in the beginning and 79.7 MB in the end (delta: 27.3 MB). Free memory was 30.6 MB in the beginning and 26.1 MB in the end (delta: 4.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 16.1 GB. [2020-10-26 00:33:51,027 INFO L168 Benchmark]: TraceAbstraction took 16693.67 ms. Allocated memory was 79.7 MB in the beginning and 264.2 MB in the end (delta: 184.5 MB). Free memory was 25.5 MB in the beginning and 118.1 MB in the end (delta: -92.6 MB). Peak memory consumption was 92.2 MB. Max. memory is 16.1 GB. [2020-10-26 00:33:51,028 INFO L168 Benchmark]: Witness Printer took 127.04 ms. Allocated memory is still 264.2 MB. Free memory was 118.1 MB in the beginning and 104.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-10-26 00:33:51,034 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.28 ms. Allocated memory is still 41.9 MB. Free memory is still 24.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 768.89 ms. Allocated memory was 41.9 MB in the beginning and 52.4 MB in the end (delta: 10.5 MB). Free memory was 25.2 MB in the beginning and 21.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 15.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 90.54 ms. Allocated memory is still 52.4 MB. Free memory was 21.9 MB in the beginning and 33.0 MB in the end (delta: -11.1 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 43.19 ms. Allocated memory is still 52.4 MB. Free memory was 33.0 MB in the beginning and 30.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2530.02 ms. Allocated memory was 52.4 MB in the beginning and 79.7 MB in the end (delta: 27.3 MB). Free memory was 30.6 MB in the beginning and 26.1 MB in the end (delta: 4.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 16693.67 ms. Allocated memory was 79.7 MB in the beginning and 264.2 MB in the end (delta: 184.5 MB). Free memory was 25.5 MB in the beginning and 118.1 MB in the end (delta: -92.6 MB). Peak memory consumption was 92.2 MB. Max. memory is 16.1 GB. * Witness Printer took 127.04 ms. Allocated memory is still 264.2 MB. Free memory was 118.1 MB in the beginning and 104.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1270 VarBasedMoverChecksPositive, 73 VarBasedMoverChecksNegative, 28 SemBasedMoverChecksPositive, 45 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 109 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 13.0s, 107 PlacesBefore, 35 PlacesAfterwards, 100 TransitionsBefore, 26 TransitionsAfterwards, 1746 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 93 TotalNumberOfCompositions, 4721 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2522; [L816] FCALL, FORK 0 pthread_create(&t2522, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t2523; [L818] FCALL, FORK 0 pthread_create(&t2523, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L819] 0 pthread_t t2524; [L820] FCALL, FORK 0 pthread_create(&t2524, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L18] COND TRUE 3 !expression [L17] COND FALSE 3 !(0) [L17] 3 __assert_fail ("0", "safe031_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L758] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 3 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L837] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L838] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L838] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L839] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L839] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L840] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L840] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L841] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L841] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L842] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L843] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe031_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.4s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.0s, HoareTripleCheckerStatistics: 274 SDtfs, 262 SDslu, 367 SDs, 0 SdLazy, 212 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred 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.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 59 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 10119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...