./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5fa702de-5726-47f2-a198-e40b1b0a8263/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_5fa702de-5726-47f2-a198-e40b1b0a8263/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5fa702de-5726-47f2-a198-e40b1b0a8263/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5fa702de-5726-47f2-a198-e40b1b0a8263/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5fa702de-5726-47f2-a198-e40b1b0a8263/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5fa702de-5726-47f2-a198-e40b1b0a8263/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-a4ecdab [2020-11-29 19:20:38,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 19:20:38,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 19:20:38,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 19:20:38,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 19:20:38,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 19:20:38,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 19:20:38,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 19:20:38,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 19:20:38,942 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 19:20:38,943 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 19:20:38,946 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 19:20:38,946 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 19:20:38,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 19:20:38,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 19:20:38,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 19:20:38,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 19:20:38,961 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 19:20:38,968 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 19:20:38,974 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 19:20:38,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 19:20:38,979 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 19:20:38,982 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 19:20:38,983 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 19:20:38,990 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 19:20:38,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 19:20:38,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 19:20:38,993 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 19:20:38,995 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 19:20:38,996 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 19:20:38,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 19:20:38,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 19:20:39,001 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 19:20:39,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 19:20:39,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 19:20:39,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 19:20:39,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 19:20:39,006 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 19:20:39,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 19:20:39,008 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 19:20:39,009 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 19:20:39,010 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5fa702de-5726-47f2-a198-e40b1b0a8263/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 19:20:39,059 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 19:20:39,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 19:20:39,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 19:20:39,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 19:20:39,063 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 19:20:39,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 19:20:39,063 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 19:20:39,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 19:20:39,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 19:20:39,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 19:20:39,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 19:20:39,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 19:20:39,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 19:20:39,066 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 19:20:39,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 19:20:39,067 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 19:20:39,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 19:20:39,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 19:20:39,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 19:20:39,068 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 19:20:39,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 19:20:39,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 19:20:39,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 19:20:39,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 19:20:39,069 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 19:20:39,069 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 19:20:39,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 19:20:39,070 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 19:20:39,070 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 19:20:39,071 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_5fa702de-5726-47f2-a198-e40b1b0a8263/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_5fa702de-5726-47f2-a198-e40b1b0a8263/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9d7a623e411fb4971fc7232c2724b3b3d780dc56 [2020-11-29 19:20:39,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 19:20:39,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 19:20:39,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 19:20:39,474 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 19:20:39,475 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 19:20:39,476 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5fa702de-5726-47f2-a198-e40b1b0a8263/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe029_power.opt.i [2020-11-29 19:20:39,553 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5fa702de-5726-47f2-a198-e40b1b0a8263/bin/uautomizer/data/fbe32cdf8/e9c83fb049224534a09b8c831573b052/FLAG6c4e920a9 [2020-11-29 19:20:40,123 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 19:20:40,129 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5fa702de-5726-47f2-a198-e40b1b0a8263/sv-benchmarks/c/pthread-wmm/safe029_power.opt.i [2020-11-29 19:20:40,146 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5fa702de-5726-47f2-a198-e40b1b0a8263/bin/uautomizer/data/fbe32cdf8/e9c83fb049224534a09b8c831573b052/FLAG6c4e920a9 [2020-11-29 19:20:40,394 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5fa702de-5726-47f2-a198-e40b1b0a8263/bin/uautomizer/data/fbe32cdf8/e9c83fb049224534a09b8c831573b052 [2020-11-29 19:20:40,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 19:20:40,399 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 19:20:40,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 19:20:40,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 19:20:40,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 19:20:40,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:20:40" (1/1) ... [2020-11-29 19:20:40,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ec54dba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:20:40, skipping insertion in model container [2020-11-29 19:20:40,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:20:40" (1/1) ... [2020-11-29 19:20:40,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 19:20:40,498 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 19:20:40,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:20:40,995 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 19:20:41,077 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:20:41,192 INFO L208 MainTranslator]: Completed translation [2020-11-29 19:20:41,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:20:41 WrapperNode [2020-11-29 19:20:41,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 19:20:41,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 19:20:41,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 19:20:41,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 19:20:41,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:20:41" (1/1) ... [2020-11-29 19:20:41,251 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:20:41" (1/1) ... [2020-11-29 19:20:41,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 19:20:41,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 19:20:41,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 19:20:41,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 19:20:41,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:20:41" (1/1) ... [2020-11-29 19:20:41,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:20:41" (1/1) ... [2020-11-29 19:20:41,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:20:41" (1/1) ... [2020-11-29 19:20:41,379 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:20:41" (1/1) ... [2020-11-29 19:20:41,391 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:20:41" (1/1) ... [2020-11-29 19:20:41,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:20:41" (1/1) ... [2020-11-29 19:20:41,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:20:41" (1/1) ... [2020-11-29 19:20:41,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 19:20:41,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 19:20:41,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 19:20:41,427 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 19:20:41,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:20:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5fa702de-5726-47f2-a198-e40b1b0a8263/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 19:20:41,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 19:20:41,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-29 19:20:41,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 19:20:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 19:20:41,552 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-29 19:20:41,552 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-29 19:20:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-29 19:20:41,553 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-29 19:20:41,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 19:20:41,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-29 19:20:41,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 19:20:41,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 19:20:41,557 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-29 19:20:44,201 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 19:20:44,201 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-29 19:20:44,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:20:44 BoogieIcfgContainer [2020-11-29 19:20:44,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 19:20:44,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 19:20:44,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 19:20:44,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 19:20:44,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:20:40" (1/3) ... [2020-11-29 19:20:44,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a78a497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:20:44, skipping insertion in model container [2020-11-29 19:20:44,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:20:41" (2/3) ... [2020-11-29 19:20:44,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a78a497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:20:44, skipping insertion in model container [2020-11-29 19:20:44,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:20:44" (3/3) ... [2020-11-29 19:20:44,214 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.opt.i [2020-11-29 19:20:44,231 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-29 19:20:44,231 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 19:20:44,237 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-29 19:20:44,238 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-29 19:20:44,286 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,287 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,287 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,287 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,290 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,290 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,291 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,292 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,294 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,295 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,296 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,297 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,301 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,302 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,309 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,310 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,310 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 19:20:44,315 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-29 19:20:44,330 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-11-29 19:20:44,370 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 19:20:44,370 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 19:20:44,370 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 19:20:44,370 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 19:20:44,371 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 19:20:44,371 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 19:20:44,371 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 19:20:44,371 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 19:20:44,393 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-29 19:20:44,395 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 83 transitions, 176 flow [2020-11-29 19:20:44,400 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 83 transitions, 176 flow [2020-11-29 19:20:44,402 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 176 flow [2020-11-29 19:20:44,464 INFO L129 PetriNetUnfolder]: 3/81 cut-off events. [2020-11-29 19:20:44,464 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-29 19:20:44,469 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-11-29 19:20:44,476 INFO L116 LiptonReduction]: Number of co-enabled transitions 1038 [2020-11-29 19:20:44,882 WARN L193 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-29 19:20:45,052 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-29 19:20:45,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 19:20:45,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:45,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-29 19:20:45,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:45,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-29 19:20:45,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:45,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 19:20:45,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 19:20:45,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 19:20:45,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:45,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:45,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:45,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 19:20:45,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:45,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:45,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:45,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:45,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:20:45,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:45,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:20:45,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:45,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:20:45,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 19:20:45,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:45,660 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-11-29 19:20:45,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:45,664 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-11-29 19:20:45,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:46,083 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-11-29 19:20:46,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-29 19:20:46,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:46,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-29 19:20:46,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:46,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-29 19:20:46,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:46,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-29 19:20:46,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:46,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:46,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:46,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-29 19:20:46,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:46,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:46,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:46,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:46,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:20:46,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:46,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:20:46,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:46,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:20:46,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 19:20:46,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:46,498 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-11-29 19:20:46,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:46,505 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-11-29 19:20:46,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:46,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-29 19:20:46,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:46,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-29 19:20:46,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:46,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 19:20:46,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 19:20:46,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 19:20:46,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:46,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:46,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:46,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:46,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:46,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:46,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:20:46,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:20:46,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:20:46,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:20:46,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:46,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:46,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:46,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:46,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:20:46,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:20:46,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:20:46,992 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:20:46,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:46,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:46,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:46,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:46,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:20:46,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:20:46,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:20:47,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:47,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:47,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:47,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:47,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:47,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:20:47,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:20:47,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:20:47,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:47,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:47,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:47,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:47,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:47,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:47,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:20:47,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:47,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:47,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:47,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:47,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:47,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:47,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:20:47,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:20:47,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:20:47,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-29 19:20:47,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:47,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-29 19:20:47,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:47,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-29 19:20:47,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:47,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-29 19:20:47,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:47,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 19:20:47,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:47,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:20:47,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:47,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:47,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:47,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:47,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:47,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:20:47,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:47,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:20:47,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:47,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:47,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:47,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:47,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:20:47,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:20:47,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:20:47,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-29 19:20:47,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:47,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-29 19:20:47,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:47,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-29 19:20:47,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:47,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-29 19:20:47,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:49,038 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-11-29 19:20:49,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-11-29 19:20:49,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:49,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-29 19:20:49,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:50,206 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 143 DAG size of output: 113 [2020-11-29 19:20:51,374 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 227 DAG size of output: 187 [2020-11-29 19:20:51,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-11-29 19:20:51,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:51,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-29 19:20:51,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:52,407 WARN L193 SmtUtils]: Spent 976.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 106 [2020-11-29 19:20:52,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:20:52,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:52,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:52,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:52,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:52,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:20:52,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:20:52,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:20:52,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:52,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:52,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:52,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:52,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:52,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:52,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:20:52,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:52,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:52,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:52,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:52,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:52,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:52,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:20:52,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:20:52,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:20:52,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:52,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:52,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:52,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:52,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:52,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:52,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:20:52,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:52,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:20:52,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:52,682 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:52,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:52,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:52,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:52,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:20:52,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 19:20:52,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:52,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:52,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:52,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:52,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 19:20:52,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:20:52,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 19:20:52,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 19:20:53,349 WARN L193 SmtUtils]: Spent 460.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-11-29 19:20:53,675 WARN L193 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-11-29 19:20:53,902 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-11-29 19:20:54,393 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-11-29 19:20:54,682 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-11-29 19:20:55,233 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-11-29 19:20:55,561 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-11-29 19:20:56,046 WARN L193 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2020-11-29 19:20:56,279 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-11-29 19:20:56,347 INFO L131 LiptonReduction]: Checked pairs total: 2666 [2020-11-29 19:20:56,347 INFO L133 LiptonReduction]: Total number of compositions: 78 [2020-11-29 19:20:56,353 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 20 transitions, 50 flow [2020-11-29 19:20:56,377 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 162 states. [2020-11-29 19:20:56,378 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2020-11-29 19:20:56,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-29 19:20:56,391 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:20:56,392 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-29 19:20:56,392 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:20:56,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:20:56,398 INFO L82 PathProgramCache]: Analyzing trace with hash 907060207, now seen corresponding path program 1 times [2020-11-29 19:20:56,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:20:56,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331423132] [2020-11-29 19:20:56,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:20:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:20:56,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:20:56,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331423132] [2020-11-29 19:20:56,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:20:56,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-29 19:20:56,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438974311] [2020-11-29 19:20:56,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:20:56,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:20:56,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:20:56,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:20:56,761 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 3 states. [2020-11-29 19:20:56,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:20:56,871 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-11-29 19:20:56,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:20:56,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-29 19:20:56,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:20:56,896 INFO L225 Difference]: With dead ends: 137 [2020-11-29 19:20:56,896 INFO L226 Difference]: Without dead ends: 112 [2020-11-29 19:20:56,898 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-11-29 19:20:56,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-29 19:20:56,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-11-29 19:20:56,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-29 19:20:56,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-11-29 19:20:56,984 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 5 [2020-11-29 19:20:56,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:20:56,984 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-11-29 19:20:56,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:20:56,985 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-11-29 19:20:56,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-29 19:20:56,986 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:20:56,986 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:20:56,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 19:20:56,986 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:20:56,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:20:56,992 INFO L82 PathProgramCache]: Analyzing trace with hash -193428177, now seen corresponding path program 1 times [2020-11-29 19:20:56,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:20:56,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063704198] [2020-11-29 19:20:56,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:20:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:20:57,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:20:57,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063704198] [2020-11-29 19:20:57,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:20:57,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-29 19:20:57,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465190346] [2020-11-29 19:20:57,087 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:20:57,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:20:57,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:20:57,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:20:57,088 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 3 states. [2020-11-29 19:20:57,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:20:57,111 INFO L93 Difference]: Finished difference Result 110 states and 249 transitions. [2020-11-29 19:20:57,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:20:57,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-29 19:20:57,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:20:57,114 INFO L225 Difference]: With dead ends: 110 [2020-11-29 19:20:57,115 INFO L226 Difference]: Without dead ends: 110 [2020-11-29 19:20:57,115 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-11-29 19:20:57,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-11-29 19:20:57,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-11-29 19:20:57,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-11-29 19:20:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 249 transitions. [2020-11-29 19:20:57,132 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 249 transitions. Word has length 7 [2020-11-29 19:20:57,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:20:57,132 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 249 transitions. [2020-11-29 19:20:57,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:20:57,132 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 249 transitions. [2020-11-29 19:20:57,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-29 19:20:57,133 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:20:57,133 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:20:57,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 19:20:57,134 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:20:57,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:20:57,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2141230383, now seen corresponding path program 1 times [2020-11-29 19:20:57,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:20:57,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392481087] [2020-11-29 19:20:57,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:20:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:20:57,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:20:57,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392481087] [2020-11-29 19:20:57,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:20:57,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-29 19:20:57,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442447715] [2020-11-29 19:20:57,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:20:57,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:20:57,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:20:57,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:20:57,276 INFO L87 Difference]: Start difference. First operand 110 states and 249 transitions. Second operand 3 states. [2020-11-29 19:20:57,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:20:57,329 INFO L93 Difference]: Finished difference Result 106 states and 238 transitions. [2020-11-29 19:20:57,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:20:57,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-11-29 19:20:57,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:20:57,337 INFO L225 Difference]: With dead ends: 106 [2020-11-29 19:20:57,337 INFO L226 Difference]: Without dead ends: 106 [2020-11-29 19:20:57,337 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-11-29 19:20:57,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-11-29 19:20:57,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-11-29 19:20:57,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-11-29 19:20:57,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 238 transitions. [2020-11-29 19:20:57,353 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 238 transitions. Word has length 8 [2020-11-29 19:20:57,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:20:57,353 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 238 transitions. [2020-11-29 19:20:57,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:20:57,354 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 238 transitions. [2020-11-29 19:20:57,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-29 19:20:57,354 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:20:57,355 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:20:57,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 19:20:57,355 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:20:57,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:20:57,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1953631552, now seen corresponding path program 1 times [2020-11-29 19:20:57,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:20:57,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759567073] [2020-11-29 19:20:57,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:20:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:20:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:20:57,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759567073] [2020-11-29 19:20:57,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:20:57,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:20:57,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968413234] [2020-11-29 19:20:57,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:20:57,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:20:57,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:20:57,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:20:57,579 INFO L87 Difference]: Start difference. First operand 106 states and 238 transitions. Second operand 5 states. [2020-11-29 19:20:57,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:20:57,698 INFO L93 Difference]: Finished difference Result 101 states and 223 transitions. [2020-11-29 19:20:57,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:20:57,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-11-29 19:20:57,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:20:57,700 INFO L225 Difference]: With dead ends: 101 [2020-11-29 19:20:57,700 INFO L226 Difference]: Without dead ends: 101 [2020-11-29 19:20:57,701 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:20:57,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-11-29 19:20:57,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-11-29 19:20:57,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-11-29 19:20:57,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 223 transitions. [2020-11-29 19:20:57,711 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 223 transitions. Word has length 9 [2020-11-29 19:20:57,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:20:57,711 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 223 transitions. [2020-11-29 19:20:57,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:20:57,711 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 223 transitions. [2020-11-29 19:20:57,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-29 19:20:57,713 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:20:57,713 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:20:57,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 19:20:57,713 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:20:57,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:20:57,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1426394591, now seen corresponding path program 1 times [2020-11-29 19:20:57,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:20:57,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875912644] [2020-11-29 19:20:57,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:20:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:20:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:20:57,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875912644] [2020-11-29 19:20:57,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:20:57,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 19:20:57,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389904386] [2020-11-29 19:20:57,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:20:57,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:20:57,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:20:57,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:20:57,790 INFO L87 Difference]: Start difference. First operand 101 states and 223 transitions. Second operand 3 states. [2020-11-29 19:20:57,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:20:57,807 INFO L93 Difference]: Finished difference Result 141 states and 300 transitions. [2020-11-29 19:20:57,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:20:57,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-29 19:20:57,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:20:57,810 INFO L225 Difference]: With dead ends: 141 [2020-11-29 19:20:57,810 INFO L226 Difference]: Without dead ends: 105 [2020-11-29 19:20:57,810 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-11-29 19:20:57,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-11-29 19:20:57,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2020-11-29 19:20:57,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-11-29 19:20:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 206 transitions. [2020-11-29 19:20:57,819 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 206 transitions. Word has length 10 [2020-11-29 19:20:57,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:20:57,820 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 206 transitions. [2020-11-29 19:20:57,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:20:57,820 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 206 transitions. [2020-11-29 19:20:57,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-29 19:20:57,821 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:20:57,821 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:20:57,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 19:20:57,822 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:20:57,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:20:57,822 INFO L82 PathProgramCache]: Analyzing trace with hash 539156191, now seen corresponding path program 1 times [2020-11-29 19:20:57,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:20:57,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936922444] [2020-11-29 19:20:57,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:20:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:20:58,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:20:58,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936922444] [2020-11-29 19:20:58,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:20:58,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:20:58,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715714563] [2020-11-29 19:20:58,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 19:20:58,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:20:58,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 19:20:58,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 19:20:58,042 INFO L87 Difference]: Start difference. First operand 99 states and 206 transitions. Second operand 6 states. [2020-11-29 19:20:58,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:20:58,186 INFO L93 Difference]: Finished difference Result 132 states and 256 transitions. [2020-11-29 19:20:58,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:20:58,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-11-29 19:20:58,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:20:58,188 INFO L225 Difference]: With dead ends: 132 [2020-11-29 19:20:58,188 INFO L226 Difference]: Without dead ends: 102 [2020-11-29 19:20:58,189 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 19:20:58,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-11-29 19:20:58,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2020-11-29 19:20:58,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-11-29 19:20:58,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 187 transitions. [2020-11-29 19:20:58,196 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 187 transitions. Word has length 11 [2020-11-29 19:20:58,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:20:58,197 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 187 transitions. [2020-11-29 19:20:58,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 19:20:58,197 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 187 transitions. [2020-11-29 19:20:58,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-29 19:20:58,198 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:20:58,199 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:20:58,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-29 19:20:58,199 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:20:58,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:20:58,200 INFO L82 PathProgramCache]: Analyzing trace with hash 538320121, now seen corresponding path program 2 times [2020-11-29 19:20:58,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:20:58,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521134437] [2020-11-29 19:20:58,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:20:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:20:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:20:58,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521134437] [2020-11-29 19:20:58,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:20:58,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:20:58,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761402847] [2020-11-29 19:20:58,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 19:20:58,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:20:58,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 19:20:58,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 19:20:58,450 INFO L87 Difference]: Start difference. First operand 96 states and 187 transitions. Second operand 6 states. [2020-11-29 19:20:58,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:20:58,553 INFO L93 Difference]: Finished difference Result 104 states and 197 transitions. [2020-11-29 19:20:58,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:20:58,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-11-29 19:20:58,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:20:58,555 INFO L225 Difference]: With dead ends: 104 [2020-11-29 19:20:58,555 INFO L226 Difference]: Without dead ends: 95 [2020-11-29 19:20:58,556 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 19:20:58,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-11-29 19:20:58,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-11-29 19:20:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-11-29 19:20:58,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 182 transitions. [2020-11-29 19:20:58,562 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 182 transitions. Word has length 11 [2020-11-29 19:20:58,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:20:58,563 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 182 transitions. [2020-11-29 19:20:58,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 19:20:58,563 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 182 transitions. [2020-11-29 19:20:58,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-29 19:20:58,571 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:20:58,571 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:20:58,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-29 19:20:58,572 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:20:58,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:20:58,572 INFO L82 PathProgramCache]: Analyzing trace with hash 538294081, now seen corresponding path program 3 times [2020-11-29 19:20:58,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:20:58,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863631017] [2020-11-29 19:20:58,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:20:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:20:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:20:58,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863631017] [2020-11-29 19:20:58,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:20:58,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:20:58,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084305158] [2020-11-29 19:20:58,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 19:20:58,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:20:58,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 19:20:58,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 19:20:58,770 INFO L87 Difference]: Start difference. First operand 95 states and 182 transitions. Second operand 6 states. [2020-11-29 19:20:58,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:20:58,928 INFO L93 Difference]: Finished difference Result 97 states and 183 transitions. [2020-11-29 19:20:58,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:20:58,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-11-29 19:20:58,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:20:58,929 INFO L225 Difference]: With dead ends: 97 [2020-11-29 19:20:58,929 INFO L226 Difference]: Without dead ends: 79 [2020-11-29 19:20:58,930 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-11-29 19:20:58,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-29 19:20:58,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-11-29 19:20:58,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-11-29 19:20:58,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 148 transitions. [2020-11-29 19:20:58,934 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 148 transitions. Word has length 11 [2020-11-29 19:20:58,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:20:58,934 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 148 transitions. [2020-11-29 19:20:58,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 19:20:58,934 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 148 transitions. [2020-11-29 19:20:58,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-29 19:20:58,935 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:20:58,935 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:20:58,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 19:20:58,936 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:20:58,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:20:58,936 INFO L82 PathProgramCache]: Analyzing trace with hash 475759021, now seen corresponding path program 4 times [2020-11-29 19:20:58,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:20:58,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486951351] [2020-11-29 19:20:58,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:20:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:20:59,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:20:59,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486951351] [2020-11-29 19:20:59,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:20:59,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 19:20:59,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792373055] [2020-11-29 19:20:59,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 19:20:59,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:20:59,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 19:20:59,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-29 19:20:59,119 INFO L87 Difference]: Start difference. First operand 79 states and 148 transitions. Second operand 7 states. [2020-11-29 19:20:59,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:20:59,189 INFO L93 Difference]: Finished difference Result 75 states and 140 transitions. [2020-11-29 19:20:59,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:20:59,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-11-29 19:20:59,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:20:59,191 INFO L225 Difference]: With dead ends: 75 [2020-11-29 19:20:59,191 INFO L226 Difference]: Without dead ends: 63 [2020-11-29 19:20:59,191 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-29 19:20:59,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-11-29 19:20:59,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-11-29 19:20:59,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-29 19:20:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 122 transitions. [2020-11-29 19:20:59,194 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 122 transitions. Word has length 11 [2020-11-29 19:20:59,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:20:59,194 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 122 transitions. [2020-11-29 19:20:59,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 19:20:59,194 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 122 transitions. [2020-11-29 19:20:59,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-29 19:20:59,195 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:20:59,195 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:20:59,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 19:20:59,195 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:20:59,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:20:59,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1268585729, now seen corresponding path program 1 times [2020-11-29 19:20:59,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:20:59,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965984967] [2020-11-29 19:20:59,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:20:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:20:59,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:20:59,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965984967] [2020-11-29 19:20:59,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:20:59,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:20:59,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837000233] [2020-11-29 19:20:59,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:20:59,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:20:59,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:20:59,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:20:59,297 INFO L87 Difference]: Start difference. First operand 63 states and 122 transitions. Second operand 4 states. [2020-11-29 19:20:59,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:20:59,332 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2020-11-29 19:20:59,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:20:59,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-29 19:20:59,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:20:59,333 INFO L225 Difference]: With dead ends: 57 [2020-11-29 19:20:59,333 INFO L226 Difference]: Without dead ends: 40 [2020-11-29 19:20:59,333 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-11-29 19:20:59,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-11-29 19:20:59,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-11-29 19:20:59,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-29 19:20:59,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2020-11-29 19:20:59,335 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 11 [2020-11-29 19:20:59,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:20:59,335 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2020-11-29 19:20:59,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:20:59,335 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2020-11-29 19:20:59,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-29 19:20:59,336 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:20:59,336 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:20:59,336 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-29 19:20:59,336 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:20:59,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:20:59,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1119968960, now seen corresponding path program 1 times [2020-11-29 19:20:59,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:20:59,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540985561] [2020-11-29 19:20:59,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:20:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:20:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:20:59,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540985561] [2020-11-29 19:20:59,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:20:59,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:20:59,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636070288] [2020-11-29 19:20:59,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:20:59,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:20:59,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:20:59,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:20:59,452 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 5 states. [2020-11-29 19:20:59,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:20:59,502 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2020-11-29 19:20:59,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 19:20:59,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-29 19:20:59,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:20:59,504 INFO L225 Difference]: With dead ends: 31 [2020-11-29 19:20:59,504 INFO L226 Difference]: Without dead ends: 20 [2020-11-29 19:20:59,504 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-11-29 19:20:59,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-11-29 19:20:59,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-11-29 19:20:59,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-11-29 19:20:59,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-11-29 19:20:59,505 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2020-11-29 19:20:59,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:20:59,506 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-11-29 19:20:59,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:20:59,506 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-11-29 19:20:59,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-29 19:20:59,506 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:20:59,506 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:20:59,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 19:20:59,506 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:20:59,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:20:59,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1283443941, now seen corresponding path program 1 times [2020-11-29 19:20:59,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:20:59,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125062209] [2020-11-29 19:20:59,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:20:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:20:59,573 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:20:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:20:59,613 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:20:59,663 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:20:59,663 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 19:20:59,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-29 19:20:59,665 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-11-29 19:20:59,674 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] L3-->L804: Formula: (let ((.cse6 (= (mod ~x$r_buff0_thd0~0_In344773436 256) 0)) (.cse7 (= (mod ~x$w_buff0_used~0_In344773436 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In344773436 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In344773436 256) 0))) (let ((.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse5 (or .cse8 .cse9)) (.cse2 (or .cse6 .cse7)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (or (and (= ~x$w_buff0_used~0_Out344773436 0) .cse0 .cse1) (and (= ~x$w_buff0_used~0_In344773436 ~x$w_buff0_used~0_Out344773436) .cse2)) (= ~x$r_buff0_thd0~0_In344773436 ~x$r_buff0_thd0~0_Out344773436) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In344773436 0)) (= ~x$r_buff1_thd0~0_In344773436 ~x$r_buff1_thd0~0_Out344773436) (or (and .cse3 .cse4 (= ~x$w_buff1_used~0_Out344773436 0)) (and (= ~x$w_buff1_used~0_In344773436 ~x$w_buff1_used~0_Out344773436) .cse5)) (or (and (or (and (= ~x$w_buff1~0_In344773436 ~x~0_Out344773436) .cse3 .cse4) (and (= ~x~0_In344773436 ~x~0_Out344773436) .cse5)) .cse2) (and .cse0 .cse1 (= ~x$w_buff0~0_In344773436 ~x~0_Out344773436)))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In344773436, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In344773436, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In344773436, ~x$w_buff1~0=~x$w_buff1~0_In344773436, ~x$w_buff1_used~0=~x$w_buff1_used~0_In344773436, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In344773436, ~x~0=~x~0_In344773436, ~x$w_buff0_used~0=~x$w_buff0_used~0_In344773436} OutVars{~x$w_buff0~0=~x$w_buff0~0_In344773436, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out344773436, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out344773436|, ~x$w_buff1~0=~x$w_buff1~0_In344773436, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out344773436|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out344773436, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out344773436, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out344773436|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out344773436|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out344773436|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out344773436, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out344773436|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In344773436, ~x~0=~x~0_Out344773436} 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-11-29 19:20:59,680 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-11-29 19:20:59,681 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [753] [2020-11-29 19:20:59,684 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-11-29 19:20:59,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,684 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-11-29 19:20:59,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,685 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-11-29 19:20:59,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,685 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-11-29 19:20:59,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,685 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-11-29 19:20:59,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,687 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-11-29 19:20:59,687 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,688 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-11-29 19:20:59,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,688 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-11-29 19:20:59,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,688 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-11-29 19:20:59,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,689 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-11-29 19:20:59,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,689 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-11-29 19:20:59,689 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,691 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-11-29 19:20:59,691 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,691 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-11-29 19:20:59,691 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,692 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-11-29 19:20:59,692 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,692 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-11-29 19:20:59,692 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,692 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-11-29 19:20:59,692 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,693 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-11-29 19:20:59,693 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,693 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-11-29 19:20:59,693 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,699 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-11-29 19:20:59,700 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,700 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-11-29 19:20:59,700 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,700 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-11-29 19:20:59,700 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 07:20:59 BasicIcfg [2020-11-29 19:20:59,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 19:20:59,762 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 19:20:59,763 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 19:20:59,763 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 19:20:59,763 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:20:44" (3/4) ... [2020-11-29 19:20:59,765 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 19:20:59,770 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] L3-->L804: Formula: (let ((.cse6 (= (mod ~x$r_buff0_thd0~0_In344773436 256) 0)) (.cse7 (= (mod ~x$w_buff0_used~0_In344773436 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In344773436 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In344773436 256) 0))) (let ((.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse5 (or .cse8 .cse9)) (.cse2 (or .cse6 .cse7)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (or (and (= ~x$w_buff0_used~0_Out344773436 0) .cse0 .cse1) (and (= ~x$w_buff0_used~0_In344773436 ~x$w_buff0_used~0_Out344773436) .cse2)) (= ~x$r_buff0_thd0~0_In344773436 ~x$r_buff0_thd0~0_Out344773436) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In344773436 0)) (= ~x$r_buff1_thd0~0_In344773436 ~x$r_buff1_thd0~0_Out344773436) (or (and .cse3 .cse4 (= ~x$w_buff1_used~0_Out344773436 0)) (and (= ~x$w_buff1_used~0_In344773436 ~x$w_buff1_used~0_Out344773436) .cse5)) (or (and (or (and (= ~x$w_buff1~0_In344773436 ~x~0_Out344773436) .cse3 .cse4) (and (= ~x~0_In344773436 ~x~0_Out344773436) .cse5)) .cse2) (and .cse0 .cse1 (= ~x$w_buff0~0_In344773436 ~x~0_Out344773436)))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In344773436, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In344773436, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In344773436, ~x$w_buff1~0=~x$w_buff1~0_In344773436, ~x$w_buff1_used~0=~x$w_buff1_used~0_In344773436, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In344773436, ~x~0=~x~0_In344773436, ~x$w_buff0_used~0=~x$w_buff0_used~0_In344773436} OutVars{~x$w_buff0~0=~x$w_buff0~0_In344773436, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out344773436, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out344773436|, ~x$w_buff1~0=~x$w_buff1~0_In344773436, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out344773436|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out344773436, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out344773436, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out344773436|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out344773436|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out344773436|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out344773436, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out344773436|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In344773436, ~x~0=~x~0_Out344773436} 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-11-29 19:20:59,777 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-11-29 19:20:59,777 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [753] [2020-11-29 19:20:59,777 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-11-29 19:20:59,778 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,778 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-11-29 19:20:59,778 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,778 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-11-29 19:20:59,778 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,778 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-11-29 19:20:59,778 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,778 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-11-29 19:20:59,779 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,779 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-11-29 19:20:59,779 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,779 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-11-29 19:20:59,779 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,779 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-11-29 19:20:59,779 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,779 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-11-29 19:20:59,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,780 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-11-29 19:20:59,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,780 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-11-29 19:20:59,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,781 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-11-29 19:20:59,781 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,781 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-11-29 19:20:59,781 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,783 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-11-29 19:20:59,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,783 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-11-29 19:20:59,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,783 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-11-29 19:20:59,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,783 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-11-29 19:20:59,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,784 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-11-29 19:20:59,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,784 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-11-29 19:20:59,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,784 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-11-29 19:20:59,784 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,784 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-11-29 19:20:59,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 19:20:59,903 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5fa702de-5726-47f2-a198-e40b1b0a8263/bin/uautomizer/witness.graphml [2020-11-29 19:20:59,903 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 19:20:59,904 INFO L168 Benchmark]: Toolchain (without parser) took 19504.56 ms. Allocated memory was 86.0 MB in the beginning and 251.7 MB in the end (delta: 165.7 MB). Free memory was 48.5 MB in the beginning and 155.4 MB in the end (delta: -106.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 16.1 GB. [2020-11-29 19:20:59,904 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 86.0 MB. Free memory is still 66.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:20:59,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 792.74 ms. Allocated memory is still 86.0 MB. Free memory was 48.4 MB in the beginning and 38.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-29 19:20:59,905 INFO L168 Benchmark]: Boogie Procedure Inliner took 136.54 ms. Allocated memory is still 86.0 MB. Free memory was 38.9 MB in the beginning and 36.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:20:59,905 INFO L168 Benchmark]: Boogie Preprocessor took 86.75 ms. Allocated memory is still 86.0 MB. Free memory was 36.1 MB in the beginning and 34.0 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:20:59,906 INFO L168 Benchmark]: RCFGBuilder took 2781.18 ms. Allocated memory was 86.0 MB in the beginning and 125.8 MB in the end (delta: 39.8 MB). Free memory was 34.0 MB in the beginning and 97.2 MB in the end (delta: -63.2 MB). Peak memory consumption was 39.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:20:59,906 INFO L168 Benchmark]: TraceAbstraction took 15557.03 ms. Allocated memory was 125.8 MB in the beginning and 251.7 MB in the end (delta: 125.8 MB). Free memory was 96.2 MB in the beginning and 164.9 MB in the end (delta: -68.7 MB). Peak memory consumption was 59.3 MB. Max. memory is 16.1 GB. [2020-11-29 19:20:59,907 INFO L168 Benchmark]: Witness Printer took 140.42 ms. Allocated memory is still 251.7 MB. Free memory was 164.9 MB in the beginning and 155.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-29 19:20:59,909 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.33 ms. Allocated memory is still 86.0 MB. Free memory is still 66.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 792.74 ms. Allocated memory is still 86.0 MB. Free memory was 48.4 MB in the beginning and 38.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 136.54 ms. Allocated memory is still 86.0 MB. Free memory was 38.9 MB in the beginning and 36.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 86.75 ms. Allocated memory is still 86.0 MB. Free memory was 36.1 MB in the beginning and 34.0 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 2781.18 ms. Allocated memory was 86.0 MB in the beginning and 125.8 MB in the end (delta: 39.8 MB). Free memory was 34.0 MB in the beginning and 97.2 MB in the end (delta: -63.2 MB). Peak memory consumption was 39.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15557.03 ms. Allocated memory was 125.8 MB in the beginning and 251.7 MB in the end (delta: 125.8 MB). Free memory was 96.2 MB in the beginning and 164.9 MB in the end (delta: -68.7 MB). Peak memory consumption was 59.3 MB. Max. memory is 16.1 GB. * Witness Printer took 140.42 ms. Allocated memory is still 251.7 MB. Free memory was 164.9 MB in the beginning and 155.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 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.8s, 68 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 11.9s, 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.2s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.0s, HoareTripleCheckerStatistics: 170 SDtfs, 106 SDslu, 218 SDs, 0 SdLazy, 211 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 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, 11 MinimizatonAttempts, 12 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 7339 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...