./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe029_power.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/safe029_power.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 9d7a623e411fb4971fc7232c2724b3b3d780dc56 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:03,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 00:33:03,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 00:33:03,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 00:33:03,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 00:33:03,329 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 00:33:03,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 00:33:03,334 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 00:33:03,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 00:33:03,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 00:33:03,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 00:33:03,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 00:33:03,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 00:33:03,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 00:33:03,344 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 00:33:03,345 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 00:33:03,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 00:33:03,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 00:33:03,350 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 00:33:03,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 00:33:03,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 00:33:03,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 00:33:03,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 00:33:03,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 00:33:03,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 00:33:03,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 00:33:03,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 00:33:03,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 00:33:03,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 00:33:03,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 00:33:03,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 00:33:03,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 00:33:03,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 00:33:03,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 00:33:03,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 00:33:03,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 00:33:03,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 00:33:03,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 00:33:03,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 00:33:03,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 00:33:03,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 00:33:03,392 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:03,422 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 00:33:03,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 00:33:03,424 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 00:33:03,425 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 00:33:03,425 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 00:33:03,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 00:33:03,427 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 00:33:03,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 00:33:03,427 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 00:33:03,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 00:33:03,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-26 00:33:03,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-26 00:33:03,429 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-26 00:33:03,430 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 00:33:03,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 00:33:03,430 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 00:33:03,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-26 00:33:03,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 00:33:03,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 00:33:03,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-26 00:33:03,431 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-26 00:33:03,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 00:33:03,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 00:33:03,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-26 00:33:03,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-26 00:33:03,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 00:33:03,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-26 00:33:03,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-26 00:33:03,434 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 00:33:03,434 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 -> 9d7a623e411fb4971fc7232c2724b3b3d780dc56 [2020-10-26 00:33:03,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 00:33:03,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 00:33:03,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 00:33:03,952 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 00:33:03,954 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 00:33:03,955 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe029_power.opt.i [2020-10-26 00:33:04,054 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/518cedc30/3430fe1176d94271bb99c0823e4b95ea/FLAGc17aad343 [2020-10-26 00:33:04,851 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 00:33:04,853 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_power.opt.i [2020-10-26 00:33:04,879 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/518cedc30/3430fe1176d94271bb99c0823e4b95ea/FLAGc17aad343 [2020-10-26 00:33:05,087 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/518cedc30/3430fe1176d94271bb99c0823e4b95ea [2020-10-26 00:33:05,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 00:33:05,096 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 00:33:05,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 00:33:05,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 00:33:05,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 00:33:05,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 12:33:05" (1/1) ... [2020-10-26 00:33:05,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@81a4b85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:05, skipping insertion in model container [2020-10-26 00:33:05,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 12:33:05" (1/1) ... [2020-10-26 00:33:05,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 00:33:05,189 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 00:33:05,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 00:33:05,729 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 00:33:05,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 00:33:05,961 INFO L208 MainTranslator]: Completed translation [2020-10-26 00:33:05,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:05 WrapperNode [2020-10-26 00:33:05,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 00:33:05,963 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 00:33:05,963 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 00:33:05,963 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 00:33:05,973 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:05" (1/1) ... [2020-10-26 00:33:05,993 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:05" (1/1) ... [2020-10-26 00:33:06,033 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 00:33:06,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 00:33:06,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 00:33:06,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 00:33:06,051 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:05" (1/1) ... [2020-10-26 00:33:06,051 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:05" (1/1) ... [2020-10-26 00:33:06,056 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:05" (1/1) ... [2020-10-26 00:33:06,056 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:05" (1/1) ... [2020-10-26 00:33:06,066 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:05" (1/1) ... [2020-10-26 00:33:06,071 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:05" (1/1) ... [2020-10-26 00:33:06,075 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:05" (1/1) ... [2020-10-26 00:33:06,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 00:33:06,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 00:33:06,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 00:33:06,087 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 00:33:06,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:05" (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:06,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 00:33:06,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-26 00:33:06,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 00:33:06,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 00:33:06,201 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-26 00:33:06,202 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-26 00:33:06,202 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-26 00:33:06,203 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-26 00:33:06,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 00:33:06,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-26 00:33:06,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 00:33:06,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 00:33:06,207 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:08,776 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 00:33:08,776 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-26 00:33:08,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:33:08 BoogieIcfgContainer [2020-10-26 00:33:08,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 00:33:08,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-26 00:33:08,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-26 00:33:08,786 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-26 00:33:08,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 12:33:05" (1/3) ... [2020-10-26 00:33:08,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60127838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 12:33:08, skipping insertion in model container [2020-10-26 00:33:08,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:33:05" (2/3) ... [2020-10-26 00:33:08,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60127838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 12:33:08, skipping insertion in model container [2020-10-26 00:33:08,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:33:08" (3/3) ... [2020-10-26 00:33:08,790 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.opt.i [2020-10-26 00:33:08,804 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-26 00:33:08,804 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-26 00:33:08,811 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-26 00:33:08,812 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-26 00:33:08,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,845 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,846 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,846 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,847 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,848 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,849 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,849 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,850 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,851 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,851 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,851 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,852 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,853 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,853 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,854 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,855 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,856 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,857 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,860 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,861 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,862 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,862 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,862 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,867 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,867 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,868 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,869 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,869 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,870 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,870 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,870 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:33:08,875 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-26 00:33:08,890 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-26 00:33:08,915 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-26 00:33:08,916 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-26 00:33:08,916 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-26 00:33:08,916 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 00:33:08,917 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 00:33:08,917 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-26 00:33:08,917 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 00:33:08,917 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-26 00:33:08,931 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-26 00:33:08,934 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 83 transitions, 176 flow [2020-10-26 00:33:08,938 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 83 transitions, 176 flow [2020-10-26 00:33:08,940 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 176 flow [2020-10-26 00:33:08,989 INFO L129 PetriNetUnfolder]: 3/81 cut-off events. [2020-10-26 00:33:08,989 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-26 00:33:08,994 INFO L80 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 3/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2020-10-26 00:33:08,997 INFO L116 LiptonReduction]: Number of co-enabled transitions 1038 [2020-10-26 00:33:09,394 WARN L193 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-26 00:33:09,546 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-26 00:33:09,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-26 00:33:09,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:09,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:33:09,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:09,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-26 00:33:09,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:09,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:33:09,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-26 00:33:09,901 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:33:09,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:09,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:09,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:10,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:10,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:10,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:10,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:10,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:10,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:10,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:10,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:10,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:10,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:10,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:33:10,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:10,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:10,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:10,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:10,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:10,376 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-26 00:33:10,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:10,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:10,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-26 00:33:10,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:10,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:10,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:10,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-26 00:33:10,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:10,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:10,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:10,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:10,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:10,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:10,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:10,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:10,760 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:10,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:10,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:10,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:10,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:33:10,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:33:10,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:10,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:10,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:10,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-26 00:33:10,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:10,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:33:10,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:10,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-26 00:33:10,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:10,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:33:10,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-26 00:33:10,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:33:10,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:10,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:10,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:10,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:10,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:10,993 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:10,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:10,996 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:10,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:11,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:11,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:11,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:11,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:11,019 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:11,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:11,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:11,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:11,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:11,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:11,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:11,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:11,171 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:11,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:11,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:11,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:11,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:11,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:11,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:11,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:11,201 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:11,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:11,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:11,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:11,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:11,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:11,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:11,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:11,404 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:11,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:11,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:11,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:11,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:11,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:11,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:11,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:11,425 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:11,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:11,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:11,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:11,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:11,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:11,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-26 00:33:11,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:11,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:11,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:11,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-26 00:33:11,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:11,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-26 00:33:11,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:11,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:11,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:11,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:11,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:11,802 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:11,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:11,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:11,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:11,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:11,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:11,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:11,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:11,820 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:11,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:11,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:11,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:11,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:11,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:11,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-26 00:33:11,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:11,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:33:11,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:11,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-26 00:33:11,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:13,328 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-26 00:33:13,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-26 00:33:13,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:13,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-26 00:33:13,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:14,596 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 143 DAG size of output: 113 [2020-10-26 00:33:15,979 WARN L193 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 227 DAG size of output: 187 [2020-10-26 00:33:16,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-26 00:33:16,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:16,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-26 00:33:16,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:17,199 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 142 DAG size of output: 106 [2020-10-26 00:33:17,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:17,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:17,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:17,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:17,290 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:17,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:17,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:17,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:17,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:17,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:17,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:17,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:17,310 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:17,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:17,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:17,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:17,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:17,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:17,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:17,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:17,377 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:17,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:17,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:17,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:17,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:17,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:17,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:17,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:17,400 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:17,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:17,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:17,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:17,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:17,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:17,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:17,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:17,440 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:17,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:17,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:17,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:33:17,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:17,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:17,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:33:17,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:33:17,461 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:17,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:17,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:33:17,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:33:18,085 WARN L193 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-10-26 00:33:18,463 WARN L193 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-10-26 00:33:18,676 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-10-26 00:33:19,230 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-10-26 00:33:19,569 WARN L193 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-10-26 00:33:19,823 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-10-26 00:33:20,212 WARN L193 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-26 00:33:20,603 WARN L193 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-26 00:33:21,138 WARN L193 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2020-10-26 00:33:21,373 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-10-26 00:33:21,441 INFO L131 LiptonReduction]: Checked pairs total: 2666 [2020-10-26 00:33:21,442 INFO L133 LiptonReduction]: Total number of compositions: 78 [2020-10-26 00:33:21,448 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 20 transitions, 50 flow [2020-10-26 00:33:21,465 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 162 states. [2020-10-26 00:33:21,467 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2020-10-26 00:33:21,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-26 00:33:21,481 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:21,482 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-26 00:33:21,482 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:21,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:21,488 INFO L82 PathProgramCache]: Analyzing trace with hash 907060207, now seen corresponding path program 1 times [2020-10-26 00:33:21,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:21,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979035301] [2020-10-26 00:33:21,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:21,746 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:21,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979035301] [2020-10-26 00:33:21,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:21,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-26 00:33:21,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744956931] [2020-10-26 00:33:21,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:33:21,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:21,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:33:21,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:33:21,782 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 3 states. [2020-10-26 00:33:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:21,874 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-10-26 00:33:21,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:33:21,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-26 00:33:21,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:21,890 INFO L225 Difference]: With dead ends: 137 [2020-10-26 00:33:21,890 INFO L226 Difference]: Without dead ends: 112 [2020-10-26 00:33:21,892 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:21,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-26 00:33:21,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-26 00:33:21,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-26 00:33:21,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-10-26 00:33:21,946 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 5 [2020-10-26 00:33:21,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:21,946 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-10-26 00:33:21,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:33:21,947 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-10-26 00:33:21,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-26 00:33:21,948 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:21,948 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:21,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-26 00:33:21,949 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:21,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:21,950 INFO L82 PathProgramCache]: Analyzing trace with hash -193428177, now seen corresponding path program 1 times [2020-10-26 00:33:21,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:21,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948179895] [2020-10-26 00:33:21,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:22,106 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:22,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948179895] [2020-10-26 00:33:22,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:22,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-26 00:33:22,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096106957] [2020-10-26 00:33:22,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:33:22,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:22,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:33:22,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:33:22,116 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 3 states. [2020-10-26 00:33:22,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:22,132 INFO L93 Difference]: Finished difference Result 110 states and 249 transitions. [2020-10-26 00:33:22,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:33:22,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-26 00:33:22,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:22,135 INFO L225 Difference]: With dead ends: 110 [2020-10-26 00:33:22,136 INFO L226 Difference]: Without dead ends: 110 [2020-10-26 00:33:22,136 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:22,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-26 00:33:22,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-10-26 00:33:22,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-26 00:33:22,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 249 transitions. [2020-10-26 00:33:22,150 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 249 transitions. Word has length 7 [2020-10-26 00:33:22,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:22,151 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 249 transitions. [2020-10-26 00:33:22,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:33:22,151 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 249 transitions. [2020-10-26 00:33:22,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-26 00:33:22,152 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:22,152 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:22,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-26 00:33:22,153 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:22,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:22,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2141230383, now seen corresponding path program 1 times [2020-10-26 00:33:22,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:22,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365848824] [2020-10-26 00:33:22,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:22,251 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:22,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365848824] [2020-10-26 00:33:22,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:22,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-26 00:33:22,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085256006] [2020-10-26 00:33:22,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:33:22,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:22,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:33:22,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:33:22,255 INFO L87 Difference]: Start difference. First operand 110 states and 249 transitions. Second operand 3 states. [2020-10-26 00:33:22,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:22,321 INFO L93 Difference]: Finished difference Result 106 states and 238 transitions. [2020-10-26 00:33:22,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:33:22,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-10-26 00:33:22,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:22,326 INFO L225 Difference]: With dead ends: 106 [2020-10-26 00:33:22,326 INFO L226 Difference]: Without dead ends: 106 [2020-10-26 00:33:22,326 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:22,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-26 00:33:22,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-10-26 00:33:22,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-26 00:33:22,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 238 transitions. [2020-10-26 00:33:22,343 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 238 transitions. Word has length 8 [2020-10-26 00:33:22,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:22,344 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 238 transitions. [2020-10-26 00:33:22,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:33:22,344 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 238 transitions. [2020-10-26 00:33:22,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-26 00:33:22,346 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:22,346 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:22,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-26 00:33:22,347 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:22,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:22,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1953631552, now seen corresponding path program 1 times [2020-10-26 00:33:22,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:22,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720660066] [2020-10-26 00:33:22,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:22,533 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:22,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720660066] [2020-10-26 00:33:22,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:22,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 00:33:22,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374375652] [2020-10-26 00:33:22,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 00:33:22,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:22,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 00:33:22,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:33:22,536 INFO L87 Difference]: Start difference. First operand 106 states and 238 transitions. Second operand 5 states. [2020-10-26 00:33:22,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:22,606 INFO L93 Difference]: Finished difference Result 113 states and 249 transitions. [2020-10-26 00:33:22,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 00:33:22,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-26 00:33:22,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:22,611 INFO L225 Difference]: With dead ends: 113 [2020-10-26 00:33:22,611 INFO L226 Difference]: Without dead ends: 113 [2020-10-26 00:33:22,611 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:33:22,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-26 00:33:22,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2020-10-26 00:33:22,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-10-26 00:33:22,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 249 transitions. [2020-10-26 00:33:22,622 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 249 transitions. Word has length 9 [2020-10-26 00:33:22,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:22,622 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 249 transitions. [2020-10-26 00:33:22,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 00:33:22,622 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 249 transitions. [2020-10-26 00:33:22,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-26 00:33:22,623 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:22,623 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:22,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-26 00:33:22,624 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:22,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:22,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1426394591, now seen corresponding path program 1 times [2020-10-26 00:33:22,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:22,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072057094] [2020-10-26 00:33:22,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:22,707 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:22,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072057094] [2020-10-26 00:33:22,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:22,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 00:33:22,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353896945] [2020-10-26 00:33:22,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 00:33:22,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:22,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 00:33:22,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:33:22,710 INFO L87 Difference]: Start difference. First operand 113 states and 249 transitions. Second operand 5 states. [2020-10-26 00:33:22,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:22,796 INFO L93 Difference]: Finished difference Result 153 states and 326 transitions. [2020-10-26 00:33:22,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 00:33:22,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-26 00:33:22,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:22,798 INFO L225 Difference]: With dead ends: 153 [2020-10-26 00:33:22,799 INFO L226 Difference]: Without dead ends: 95 [2020-10-26 00:33:22,799 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-26 00:33:22,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-10-26 00:33:22,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2020-10-26 00:33:22,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-26 00:33:22,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 182 transitions. [2020-10-26 00:33:22,807 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 182 transitions. Word has length 10 [2020-10-26 00:33:22,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:22,808 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 182 transitions. [2020-10-26 00:33:22,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 00:33:22,808 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 182 transitions. [2020-10-26 00:33:22,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-26 00:33:22,809 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:22,809 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:22,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-26 00:33:22,810 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:22,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:22,810 INFO L82 PathProgramCache]: Analyzing trace with hash 539156191, now seen corresponding path program 1 times [2020-10-26 00:33:22,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:22,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852550610] [2020-10-26 00:33:22,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:22,970 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:22,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852550610] [2020-10-26 00:33:22,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:22,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 00:33:22,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458325101] [2020-10-26 00:33:22,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 00:33:22,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:22,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 00:33:22,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-26 00:33:22,973 INFO L87 Difference]: Start difference. First operand 89 states and 182 transitions. Second operand 6 states. [2020-10-26 00:33:23,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:23,138 INFO L93 Difference]: Finished difference Result 109 states and 212 transitions. [2020-10-26 00:33:23,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 00:33:23,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-26 00:33:23,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:23,141 INFO L225 Difference]: With dead ends: 109 [2020-10-26 00:33:23,141 INFO L226 Difference]: Without dead ends: 69 [2020-10-26 00:33:23,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-26 00:33:23,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-10-26 00:33:23,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2020-10-26 00:33:23,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-26 00:33:23,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 122 transitions. [2020-10-26 00:33:23,147 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 122 transitions. Word has length 11 [2020-10-26 00:33:23,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:23,147 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 122 transitions. [2020-10-26 00:33:23,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 00:33:23,148 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 122 transitions. [2020-10-26 00:33:23,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-26 00:33:23,149 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:23,149 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:23,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-26 00:33:23,149 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:23,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:23,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1268585729, now seen corresponding path program 1 times [2020-10-26 00:33:23,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:23,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283966658] [2020-10-26 00:33:23,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:23,324 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:23,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283966658] [2020-10-26 00:33:23,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:23,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 00:33:23,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486678484] [2020-10-26 00:33:23,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 00:33:23,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:23,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 00:33:23,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:33:23,340 INFO L87 Difference]: Start difference. First operand 63 states and 122 transitions. Second operand 4 states. [2020-10-26 00:33:23,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:23,412 INFO L93 Difference]: Finished difference Result 78 states and 141 transitions. [2020-10-26 00:33:23,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 00:33:23,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-26 00:33:23,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:23,414 INFO L225 Difference]: With dead ends: 78 [2020-10-26 00:33:23,414 INFO L226 Difference]: Without dead ends: 61 [2020-10-26 00:33:23,414 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 2 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:23,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-10-26 00:33:23,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-10-26 00:33:23,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-26 00:33:23,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 118 transitions. [2020-10-26 00:33:23,427 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 118 transitions. Word has length 11 [2020-10-26 00:33:23,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:23,427 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 118 transitions. [2020-10-26 00:33:23,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 00:33:23,428 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 118 transitions. [2020-10-26 00:33:23,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-26 00:33:23,429 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:23,429 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:23,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-26 00:33:23,429 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:23,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:23,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1626460929, now seen corresponding path program 2 times [2020-10-26 00:33:23,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:23,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099240406] [2020-10-26 00:33:23,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:23,788 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:23,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099240406] [2020-10-26 00:33:23,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:23,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 00:33:23,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040179116] [2020-10-26 00:33:23,789 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 00:33:23,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:23,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 00:33:23,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-26 00:33:23,790 INFO L87 Difference]: Start difference. First operand 61 states and 118 transitions. Second operand 6 states. [2020-10-26 00:33:23,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:23,979 INFO L93 Difference]: Finished difference Result 80 states and 151 transitions. [2020-10-26 00:33:23,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 00:33:23,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-26 00:33:23,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:23,982 INFO L225 Difference]: With dead ends: 80 [2020-10-26 00:33:23,982 INFO L226 Difference]: Without dead ends: 70 [2020-10-26 00:33:23,982 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-26 00:33:23,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-26 00:33:23,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2020-10-26 00:33:23,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-26 00:33:23,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 117 transitions. [2020-10-26 00:33:23,988 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 117 transitions. Word has length 11 [2020-10-26 00:33:23,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:23,988 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 117 transitions. [2020-10-26 00:33:23,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 00:33:23,989 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 117 transitions. [2020-10-26 00:33:23,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-26 00:33:23,990 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:23,990 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:23,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-26 00:33:23,990 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:23,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:23,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1628420439, now seen corresponding path program 3 times [2020-10-26 00:33:23,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:23,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652570501] [2020-10-26 00:33:23,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:24,070 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:24,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652570501] [2020-10-26 00:33:24,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:24,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 00:33:24,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117146862] [2020-10-26 00:33:24,071 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 00:33:24,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:24,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 00:33:24,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:33:24,072 INFO L87 Difference]: Start difference. First operand 62 states and 117 transitions. Second operand 4 states. [2020-10-26 00:33:24,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:24,106 INFO L93 Difference]: Finished difference Result 57 states and 88 transitions. [2020-10-26 00:33:24,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 00:33:24,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-26 00:33:24,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:24,109 INFO L225 Difference]: With dead ends: 57 [2020-10-26 00:33:24,109 INFO L226 Difference]: Without dead ends: 41 [2020-10-26 00:33:24,109 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:24,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-10-26 00:33:24,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2020-10-26 00:33:24,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-26 00:33:24,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2020-10-26 00:33:24,112 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 11 [2020-10-26 00:33:24,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:24,112 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2020-10-26 00:33:24,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 00:33:24,112 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2020-10-26 00:33:24,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-26 00:33:24,113 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:24,113 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:24,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-26 00:33:24,113 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:24,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:24,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1119968960, now seen corresponding path program 1 times [2020-10-26 00:33:24,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:24,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650889214] [2020-10-26 00:33:24,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:33:24,258 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:24,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650889214] [2020-10-26 00:33:24,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:33:24,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 00:33:24,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577832322] [2020-10-26 00:33:24,259 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 00:33:24,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:33:24,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 00:33:24,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:33:24,260 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 5 states. [2020-10-26 00:33:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:33:24,309 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2020-10-26 00:33:24,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 00:33:24,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-26 00:33:24,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:33:24,311 INFO L225 Difference]: With dead ends: 31 [2020-10-26 00:33:24,311 INFO L226 Difference]: Without dead ends: 20 [2020-10-26 00:33:24,312 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:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-10-26 00:33:24,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-26 00:33:24,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-26 00:33:24,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-10-26 00:33:24,313 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2020-10-26 00:33:24,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:33:24,314 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-10-26 00:33:24,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 00:33:24,314 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-10-26 00:33:24,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-26 00:33:24,314 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:33:24,314 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:33:24,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-26 00:33:24,315 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:33:24,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:33:24,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1283443941, now seen corresponding path program 1 times [2020-10-26 00:33:24,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:33:24,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156870814] [2020-10-26 00:33:24,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:33:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 00:33:24,374 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 00:33:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 00:33:24,439 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 00:33:24,495 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 00:33:24,495 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-26 00:33:24,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-26 00:33:24,497 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-26 00:33:24,510 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] L3-->L804: Formula: (let ((.cse7 (= (mod ~x$w_buff1_used~0_In1243794057 256) 0)) (.cse6 (= (mod ~x$r_buff1_thd0~0_In1243794057 256) 0)) (.cse8 (= (mod ~x$r_buff0_thd0~0_In1243794057 256) 0)) (.cse9 (= (mod ~x$w_buff0_used~0_In1243794057 256) 0))) (let ((.cse2 (or .cse8 .cse9)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse3 (or .cse6 .cse7))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_In1243794057 0)) (= ~x$r_buff0_thd0~0_In1243794057 ~x$r_buff0_thd0~0_Out1243794057) (= ~x$r_buff1_thd0~0_Out1243794057 ~x$r_buff1_thd0~0_In1243794057) (or (and .cse0 .cse1 (= ~x$w_buff0_used~0_Out1243794057 0)) (and (= ~x$w_buff0_used~0_Out1243794057 ~x$w_buff0_used~0_In1243794057) .cse2)) (or (and .cse2 (or (and .cse3 (= ~x~0_Out1243794057 ~x~0_In1243794057)) (and (= ~x~0_Out1243794057 ~x$w_buff1~0_In1243794057) .cse4 .cse5))) (and .cse0 (= ~x~0_Out1243794057 ~x$w_buff0~0_In1243794057) .cse1)) (or (and .cse4 (= 0 ~x$w_buff1_used~0_Out1243794057) .cse5) (and .cse3 (= ~x$w_buff1_used~0_In1243794057 ~x$w_buff1_used~0_Out1243794057)))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1243794057, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1243794057, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1243794057, ~x$w_buff1~0=~x$w_buff1~0_In1243794057, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1243794057, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1243794057, ~x~0=~x~0_In1243794057, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1243794057} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1243794057, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out1243794057, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1243794057|, ~x$w_buff1~0=~x$w_buff1~0_In1243794057, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1243794057|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1243794057, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1243794057, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1243794057|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1243794057|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1243794057|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1243794057, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1243794057|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1243794057, ~x~0=~x~0_Out1243794057} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ~x~0, ULTIMATE.start_main_#t~ite22, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-26 00:33:24,517 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:24,518 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [753] [2020-10-26 00:33:24,520 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:24,520 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,521 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:24,521 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,521 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:24,521 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,521 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:24,521 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,521 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:24,522 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,523 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:24,523 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,523 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:24,523 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,524 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:24,524 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,524 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:24,524 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,524 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:24,525 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,525 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:24,525 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,526 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:24,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,527 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:24,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,527 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:24,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,527 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:24,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,528 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:24,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,528 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:24,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,528 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:24,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,534 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:24,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,534 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:24,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,535 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:24,535 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 12:33:24 BasicIcfg [2020-10-26 00:33:24,594 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-26 00:33:24,594 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 00:33:24,595 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 00:33:24,595 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 00:33:24,595 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:08" (3/4) ... [2020-10-26 00:33:24,598 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-26 00:33:24,627 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] L3-->L804: Formula: (let ((.cse7 (= (mod ~x$w_buff1_used~0_In1243794057 256) 0)) (.cse6 (= (mod ~x$r_buff1_thd0~0_In1243794057 256) 0)) (.cse8 (= (mod ~x$r_buff0_thd0~0_In1243794057 256) 0)) (.cse9 (= (mod ~x$w_buff0_used~0_In1243794057 256) 0))) (let ((.cse2 (or .cse8 .cse9)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse3 (or .cse6 .cse7))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_In1243794057 0)) (= ~x$r_buff0_thd0~0_In1243794057 ~x$r_buff0_thd0~0_Out1243794057) (= ~x$r_buff1_thd0~0_Out1243794057 ~x$r_buff1_thd0~0_In1243794057) (or (and .cse0 .cse1 (= ~x$w_buff0_used~0_Out1243794057 0)) (and (= ~x$w_buff0_used~0_Out1243794057 ~x$w_buff0_used~0_In1243794057) .cse2)) (or (and .cse2 (or (and .cse3 (= ~x~0_Out1243794057 ~x~0_In1243794057)) (and (= ~x~0_Out1243794057 ~x$w_buff1~0_In1243794057) .cse4 .cse5))) (and .cse0 (= ~x~0_Out1243794057 ~x$w_buff0~0_In1243794057) .cse1)) (or (and .cse4 (= 0 ~x$w_buff1_used~0_Out1243794057) .cse5) (and .cse3 (= ~x$w_buff1_used~0_In1243794057 ~x$w_buff1_used~0_Out1243794057)))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1243794057, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1243794057, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1243794057, ~x$w_buff1~0=~x$w_buff1~0_In1243794057, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1243794057, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1243794057, ~x~0=~x~0_In1243794057, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1243794057} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1243794057, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out1243794057, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1243794057|, ~x$w_buff1~0=~x$w_buff1~0_In1243794057, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1243794057|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1243794057, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1243794057, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1243794057|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1243794057|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1243794057|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1243794057, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1243794057|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In1243794057, ~x~0=~x~0_Out1243794057} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ~x~0, ULTIMATE.start_main_#t~ite22, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-26 00:33:24,629 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:24,629 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [753] [2020-10-26 00:33:24,629 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:24,630 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,630 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:24,630 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,630 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:24,630 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,630 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:24,630 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,630 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:24,630 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,631 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:24,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,631 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:24,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,631 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:24,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,631 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:24,632 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,632 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:24,632 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,632 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:24,632 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,632 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:24,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,633 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:24,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,633 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:24,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,633 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:24,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,633 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:24,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,634 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:24,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,634 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:24,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,634 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:24,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,634 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:24,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,635 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:24,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:33:24,761 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-26 00:33:24,762 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 00:33:24,763 INFO L168 Benchmark]: Toolchain (without parser) took 19671.45 ms. Allocated memory was 37.7 MB in the beginning and 247.5 MB in the end (delta: 209.7 MB). Free memory was 21.4 MB in the beginning and 211.6 MB in the end (delta: -190.3 MB). Peak memory consumption was 129.3 MB. Max. memory is 16.1 GB. [2020-10-26 00:33:24,764 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 37.7 MB. Free memory was 25.3 MB in the beginning and 25.2 MB in the end (delta: 33.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 00:33:24,764 INFO L168 Benchmark]: CACSL2BoogieTranslator took 864.40 ms. Allocated memory was 37.7 MB in the beginning and 46.1 MB in the end (delta: 8.4 MB). Free memory was 20.8 MB in the beginning and 21.6 MB in the end (delta: -794.9 kB). Peak memory consumption was 12.1 MB. Max. memory is 16.1 GB. [2020-10-26 00:33:24,765 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.37 ms. Allocated memory is still 46.1 MB. Free memory was 21.4 MB in the beginning and 18.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 00:33:24,765 INFO L168 Benchmark]: Boogie Preprocessor took 46.75 ms. Allocated memory is still 46.1 MB. Free memory was 18.7 MB in the beginning and 26.7 MB in the end (delta: -8.0 MB). Peak memory consumption was 2.4 MB. Max. memory is 16.1 GB. [2020-10-26 00:33:24,766 INFO L168 Benchmark]: RCFGBuilder took 2694.06 ms. Allocated memory was 46.1 MB in the beginning and 92.3 MB in the end (delta: 46.1 MB). Free memory was 26.7 MB in the beginning and 66.0 MB in the end (delta: -39.3 MB). Peak memory consumption was 28.4 MB. Max. memory is 16.1 GB. [2020-10-26 00:33:24,766 INFO L168 Benchmark]: TraceAbstraction took 15812.81 ms. Allocated memory was 92.3 MB in the beginning and 205.5 MB in the end (delta: 113.2 MB). Free memory was 65.4 MB in the beginning and 63.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 116.2 MB. Max. memory is 16.1 GB. [2020-10-26 00:33:24,767 INFO L168 Benchmark]: Witness Printer took 167.50 ms. Allocated memory was 205.5 MB in the beginning and 247.5 MB in the end (delta: 41.9 MB). Free memory was 63.4 MB in the beginning and 211.6 MB in the end (delta: -148.2 MB). Peak memory consumption was 3.8 MB. Max. memory is 16.1 GB. [2020-10-26 00:33:24,770 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.35 ms. Allocated memory is still 37.7 MB. Free memory was 25.3 MB in the beginning and 25.2 MB in the end (delta: 33.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 864.40 ms. Allocated memory was 37.7 MB in the beginning and 46.1 MB in the end (delta: 8.4 MB). Free memory was 20.8 MB in the beginning and 21.6 MB in the end (delta: -794.9 kB). Peak memory consumption was 12.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 70.37 ms. Allocated memory is still 46.1 MB. Free memory was 21.4 MB in the beginning and 18.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 46.75 ms. Allocated memory is still 46.1 MB. Free memory was 18.7 MB in the beginning and 26.7 MB in the end (delta: -8.0 MB). Peak memory consumption was 2.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2694.06 ms. Allocated memory was 46.1 MB in the beginning and 92.3 MB in the end (delta: 46.1 MB). Free memory was 26.7 MB in the beginning and 66.0 MB in the end (delta: -39.3 MB). Peak memory consumption was 28.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15812.81 ms. Allocated memory was 92.3 MB in the beginning and 205.5 MB in the end (delta: 113.2 MB). Free memory was 65.4 MB in the beginning and 63.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 116.2 MB. Max. memory is 16.1 GB. * Witness Printer took 167.50 ms. Allocated memory was 205.5 MB in the beginning and 247.5 MB in the end (delta: 41.9 MB). Free memory was 63.4 MB in the beginning and 211.6 MB in the end (delta: -148.2 MB). Peak memory consumption was 3.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 694 VarBasedMoverChecksPositive, 62 VarBasedMoverChecksNegative, 22 SemBasedMoverChecksPositive, 40 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 68 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 12.5s, 87 PlacesBefore, 26 PlacesAfterwards, 83 TransitionsBefore, 20 TransitionsAfterwards, 1038 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 78 TotalNumberOfCompositions, 2666 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t2476; [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L813] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L813] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe029_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 81 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.5s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.5s, HoareTripleCheckerStatistics: 141 SDtfs, 121 SDslu, 159 SDs, 0 SdLazy, 216 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 21 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 5907 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...