./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix044_rmo.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_ccce5259-c2e7-4240-bf94-8b36a674a54a/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_ccce5259-c2e7-4240-bf94-8b36a674a54a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ccce5259-c2e7-4240-bf94-8b36a674a54a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ccce5259-c2e7-4240-bf94-8b36a674a54a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix044_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ccce5259-c2e7-4240-bf94-8b36a674a54a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ccce5259-c2e7-4240-bf94-8b36a674a54a/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 8accfd2316880493be3cab55de0cda1ff0dcb0af ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-28 03:01:38,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:01:38,252 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:01:38,329 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:01:38,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:01:38,364 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:01:38,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:01:38,369 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:01:38,372 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:01:38,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:01:38,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:01:38,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:01:38,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:01:38,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:01:38,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:01:38,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:01:38,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:01:38,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:01:38,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:01:38,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:01:38,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:01:38,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:01:38,428 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:01:38,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:01:38,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:01:38,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:01:38,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:01:38,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:01:38,444 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:01:38,446 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:01:38,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:01:38,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:01:38,450 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:01:38,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:01:38,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:01:38,455 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:01:38,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:01:38,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:01:38,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:01:38,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:01:38,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:01:38,464 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ccce5259-c2e7-4240-bf94-8b36a674a54a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 03:01:38,515 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:01:38,515 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:01:38,518 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:01:38,518 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:01:38,518 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:01:38,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:01:38,519 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:01:38,519 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:01:38,520 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:01:38,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:01:38,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 03:01:38,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 03:01:38,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 03:01:38,522 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:01:38,523 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:01:38,523 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:01:38,523 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 03:01:38,524 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:01:38,524 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:01:38,524 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 03:01:38,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 03:01:38,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 03:01:38,525 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:01:38,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 03:01:38,525 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 03:01:38,526 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:01:38,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 03:01:38,526 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 03:01:38,527 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:01:38,527 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_ccce5259-c2e7-4240-bf94-8b36a674a54a/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_ccce5259-c2e7-4240-bf94-8b36a674a54a/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 -> 8accfd2316880493be3cab55de0cda1ff0dcb0af [2020-11-28 03:01:38,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:01:38,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:01:38,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:01:38,893 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:01:38,894 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:01:38,896 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ccce5259-c2e7-4240-bf94-8b36a674a54a/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix044_rmo.opt.i [2020-11-28 03:01:38,994 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ccce5259-c2e7-4240-bf94-8b36a674a54a/bin/uautomizer/data/291a2c2af/1e593827e1354fca98070e7521b349a4/FLAGe617eb2da [2020-11-28 03:01:39,699 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:01:39,700 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ccce5259-c2e7-4240-bf94-8b36a674a54a/sv-benchmarks/c/pthread-wmm/mix044_rmo.opt.i [2020-11-28 03:01:39,735 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ccce5259-c2e7-4240-bf94-8b36a674a54a/bin/uautomizer/data/291a2c2af/1e593827e1354fca98070e7521b349a4/FLAGe617eb2da [2020-11-28 03:01:39,924 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ccce5259-c2e7-4240-bf94-8b36a674a54a/bin/uautomizer/data/291a2c2af/1e593827e1354fca98070e7521b349a4 [2020-11-28 03:01:39,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:01:39,930 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:01:39,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:01:39,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:01:39,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:01:39,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:01:39" (1/1) ... [2020-11-28 03:01:39,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24676c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:39, skipping insertion in model container [2020-11-28 03:01:39,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:01:39" (1/1) ... [2020-11-28 03:01:39,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:01:40,018 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:01:40,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:01:40,594 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:01:40,670 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:01:40,809 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:01:40,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:40 WrapperNode [2020-11-28 03:01:40,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:01:40,816 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:01:40,816 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:01:40,816 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:01:40,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:40" (1/1) ... [2020-11-28 03:01:40,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:40" (1/1) ... [2020-11-28 03:01:40,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:01:40,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:01:40,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:01:40,912 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:01:40,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:40" (1/1) ... [2020-11-28 03:01:40,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:40" (1/1) ... [2020-11-28 03:01:40,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:40" (1/1) ... [2020-11-28 03:01:40,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:40" (1/1) ... [2020-11-28 03:01:40,947 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:40" (1/1) ... [2020-11-28 03:01:40,952 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:40" (1/1) ... [2020-11-28 03:01:40,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:40" (1/1) ... [2020-11-28 03:01:40,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:01:40,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:01:40,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:01:40,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:01:40,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ccce5259-c2e7-4240-bf94-8b36a674a54a/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-28 03:01:41,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 03:01:41,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-28 03:01:41,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:01:41,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 03:01:41,078 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-28 03:01:41,079 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-28 03:01:41,079 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-28 03:01:41,079 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-28 03:01:41,079 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-28 03:01:41,079 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-28 03:01:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-28 03:01:41,080 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-28 03:01:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:01:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-28 03:01:41,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:01:41,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:01:41,082 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-28 03:01:44,016 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:01:44,016 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-28 03:01:44,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:01:44 BoogieIcfgContainer [2020-11-28 03:01:44,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:01:44,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 03:01:44,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 03:01:44,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 03:01:44,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:01:39" (1/3) ... [2020-11-28 03:01:44,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63cb282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:01:44, skipping insertion in model container [2020-11-28 03:01:44,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:40" (2/3) ... [2020-11-28 03:01:44,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63cb282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:01:44, skipping insertion in model container [2020-11-28 03:01:44,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:01:44" (3/3) ... [2020-11-28 03:01:44,033 INFO L111 eAbstractionObserver]: Analyzing ICFG mix044_rmo.opt.i [2020-11-28 03:01:44,048 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-28 03:01:44,048 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 03:01:44,054 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-28 03:01:44,055 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-28 03:01:44,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,120 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,120 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,122 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,123 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,123 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,124 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,125 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,126 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,126 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,127 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,132 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,133 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,133 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,136 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,144 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,145 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,148 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,148 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,149 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,149 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,151 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,151 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,151 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,157 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,158 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,161 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,161 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,162 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,162 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 03:01:44,165 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-28 03:01:44,181 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-28 03:01:44,218 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 03:01:44,218 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 03:01:44,218 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 03:01:44,219 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:01:44,219 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:01:44,219 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 03:01:44,219 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:01:44,220 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 03:01:44,247 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-28 03:01:44,256 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 121 transitions, 262 flow [2020-11-28 03:01:44,261 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 121 transitions, 262 flow [2020-11-28 03:01:44,264 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 131 places, 121 transitions, 262 flow [2020-11-28 03:01:44,371 INFO L129 PetriNetUnfolder]: 3/117 cut-off events. [2020-11-28 03:01:44,371 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-28 03:01:44,378 INFO L80 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-11-28 03:01:44,388 INFO L116 LiptonReduction]: Number of co-enabled transitions 2830 [2020-11-28 03:01:44,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 03:01:44,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:44,782 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-11-28 03:01:45,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:01:45,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:45,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:01:45,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:45,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:01:45,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:01:45,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:01:45,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:01:45,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:01:45,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:45,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:01:45,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:45,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:01:45,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:01:45,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:01:45,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:01:45,774 WARN L193 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-28 03:01:45,913 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-28 03:01:46,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:01:46,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:46,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:01:46,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:46,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:01:46,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:01:46,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:01:46,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:01:46,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:01:46,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:46,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:01:46,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:46,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:01:46,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:01:46,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:01:46,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:01:46,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 03:01:46,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:46,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 03:01:46,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:46,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 03:01:46,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:46,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 03:01:46,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:48,211 WARN L193 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-11-28 03:01:48,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-11-28 03:01:48,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:48,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 03:01:48,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:49,503 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 148 DAG size of output: 127 [2020-11-28 03:01:50,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 03:01:50,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:50,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 03:01:50,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:50,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-28 03:01:50,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:50,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-28 03:01:50,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 03:01:50,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:01:50,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:50,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:01:50,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:50,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:01:50,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:01:50,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:01:50,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:01:50,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:01:50,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:50,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:01:50,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:50,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:01:50,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:01:50,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:01:50,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:01:51,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:01:51,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:51,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:01:51,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:51,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:01:51,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:01:51,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:01:51,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:01:51,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:01:51,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:51,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:01:51,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:51,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 03:01:51,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:01:51,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 03:01:51,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 03:01:51,439 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-28 03:01:51,568 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-28 03:01:51,977 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-11-28 03:01:52,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 03:01:52,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 03:01:53,065 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-11-28 03:01:53,600 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-11-28 03:01:54,243 WARN L193 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-11-28 03:01:54,552 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-11-28 03:01:54,562 INFO L131 LiptonReduction]: Checked pairs total: 7226 [2020-11-28 03:01:54,563 INFO L133 LiptonReduction]: Total number of compositions: 103 [2020-11-28 03:01:54,570 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2020-11-28 03:01:55,006 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3562 states. [2020-11-28 03:01:55,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3562 states. [2020-11-28 03:01:55,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-28 03:01:55,025 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:55,026 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:55,026 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:55,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:55,042 INFO L82 PathProgramCache]: Analyzing trace with hash 961632752, now seen corresponding path program 1 times [2020-11-28 03:01:55,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:55,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884251974] [2020-11-28 03:01:55,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:55,534 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-28 03:01:55,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884251974] [2020-11-28 03:01:55,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:55,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 03:01:55,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675578821] [2020-11-28 03:01:55,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:01:55,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:55,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:01:55,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:55,578 INFO L87 Difference]: Start difference. First operand 3562 states. Second operand 3 states. [2020-11-28 03:01:55,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:55,791 INFO L93 Difference]: Finished difference Result 3082 states and 12048 transitions. [2020-11-28 03:01:55,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:01:55,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-28 03:01:55,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:55,876 INFO L225 Difference]: With dead ends: 3082 [2020-11-28 03:01:55,876 INFO L226 Difference]: Without dead ends: 2602 [2020-11-28 03:01:55,878 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-28 03:01:55,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2020-11-28 03:01:56,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2020-11-28 03:01:56,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2020-11-28 03:01:56,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2020-11-28 03:01:56,216 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2020-11-28 03:01:56,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:56,218 INFO L481 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2020-11-28 03:01:56,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:01:56,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2020-11-28 03:01:56,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-28 03:01:56,234 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:56,235 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:56,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 03:01:56,235 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:56,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:56,240 INFO L82 PathProgramCache]: Analyzing trace with hash 570752080, now seen corresponding path program 1 times [2020-11-28 03:01:56,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:56,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613749740] [2020-11-28 03:01:56,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:56,574 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-28 03:01:56,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613749740] [2020-11-28 03:01:56,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:56,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:01:56,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125514273] [2020-11-28 03:01:56,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:01:56,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:56,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:01:56,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:01:56,578 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 5 states. [2020-11-28 03:01:56,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:56,833 INFO L93 Difference]: Finished difference Result 3062 states and 11482 transitions. [2020-11-28 03:01:56,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:01:56,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-28 03:01:56,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:56,873 INFO L225 Difference]: With dead ends: 3062 [2020-11-28 03:01:56,873 INFO L226 Difference]: Without dead ends: 2582 [2020-11-28 03:01:56,874 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:01:56,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2020-11-28 03:01:57,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 2582. [2020-11-28 03:01:57,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2582 states. [2020-11-28 03:01:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 9968 transitions. [2020-11-28 03:01:57,134 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 9968 transitions. Word has length 12 [2020-11-28 03:01:57,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:57,135 INFO L481 AbstractCegarLoop]: Abstraction has 2582 states and 9968 transitions. [2020-11-28 03:01:57,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:01:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 9968 transitions. [2020-11-28 03:01:57,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 03:01:57,138 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:57,138 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:57,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 03:01:57,139 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:57,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:57,140 INFO L82 PathProgramCache]: Analyzing trace with hash 66316442, now seen corresponding path program 1 times [2020-11-28 03:01:57,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:57,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156290563] [2020-11-28 03:01:57,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:57,326 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-28 03:01:57,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156290563] [2020-11-28 03:01:57,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:57,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:01:57,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540467976] [2020-11-28 03:01:57,328 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:01:57,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:57,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:01:57,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:01:57,329 INFO L87 Difference]: Start difference. First operand 2582 states and 9968 transitions. Second operand 4 states. [2020-11-28 03:01:57,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:57,485 INFO L93 Difference]: Finished difference Result 2862 states and 10732 transitions. [2020-11-28 03:01:57,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:01:57,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-28 03:01:57,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:57,524 INFO L225 Difference]: With dead ends: 2862 [2020-11-28 03:01:57,524 INFO L226 Difference]: Without dead ends: 2442 [2020-11-28 03:01:57,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:01:57,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2020-11-28 03:01:57,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2442. [2020-11-28 03:01:57,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2442 states. [2020-11-28 03:01:57,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 9376 transitions. [2020-11-28 03:01:57,688 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 9376 transitions. Word has length 13 [2020-11-28 03:01:57,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:57,689 INFO L481 AbstractCegarLoop]: Abstraction has 2442 states and 9376 transitions. [2020-11-28 03:01:57,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:01:57,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 9376 transitions. [2020-11-28 03:01:57,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 03:01:57,692 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:57,692 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:57,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 03:01:57,693 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:57,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:57,694 INFO L82 PathProgramCache]: Analyzing trace with hash 522004274, now seen corresponding path program 1 times [2020-11-28 03:01:57,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:57,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473285922] [2020-11-28 03:01:57,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:57,867 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-28 03:01:57,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473285922] [2020-11-28 03:01:57,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:57,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:01:57,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218597910] [2020-11-28 03:01:57,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:01:57,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:57,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:01:57,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:01:57,870 INFO L87 Difference]: Start difference. First operand 2442 states and 9376 transitions. Second operand 5 states. [2020-11-28 03:01:58,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:58,093 INFO L93 Difference]: Finished difference Result 2742 states and 10206 transitions. [2020-11-28 03:01:58,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:01:58,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-28 03:01:58,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:58,130 INFO L225 Difference]: With dead ends: 2742 [2020-11-28 03:01:58,130 INFO L226 Difference]: Without dead ends: 2342 [2020-11-28 03:01:58,131 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:01:58,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2020-11-28 03:01:58,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 2342. [2020-11-28 03:01:58,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2342 states. [2020-11-28 03:01:58,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2342 states to 2342 states and 8916 transitions. [2020-11-28 03:01:58,342 INFO L78 Accepts]: Start accepts. Automaton has 2342 states and 8916 transitions. Word has length 13 [2020-11-28 03:01:58,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:58,343 INFO L481 AbstractCegarLoop]: Abstraction has 2342 states and 8916 transitions. [2020-11-28 03:01:58,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:01:58,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2342 states and 8916 transitions. [2020-11-28 03:01:58,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 03:01:58,347 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:58,348 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:58,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 03:01:58,348 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:58,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:58,349 INFO L82 PathProgramCache]: Analyzing trace with hash 2064368680, now seen corresponding path program 1 times [2020-11-28 03:01:58,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:58,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887404942] [2020-11-28 03:01:58,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:58,553 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-28 03:01:58,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887404942] [2020-11-28 03:01:58,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:58,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:01:58,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405236523] [2020-11-28 03:01:58,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:01:58,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:58,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:01:58,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:01:58,556 INFO L87 Difference]: Start difference. First operand 2342 states and 8916 transitions. Second operand 6 states. [2020-11-28 03:01:58,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:58,778 INFO L93 Difference]: Finished difference Result 2732 states and 10108 transitions. [2020-11-28 03:01:58,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:01:58,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-11-28 03:01:58,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:58,825 INFO L225 Difference]: With dead ends: 2732 [2020-11-28 03:01:58,826 INFO L226 Difference]: Without dead ends: 2354 [2020-11-28 03:01:58,826 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:01:58,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2020-11-28 03:01:58,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 2354. [2020-11-28 03:01:58,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2354 states. [2020-11-28 03:01:58,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 2354 states and 8896 transitions. [2020-11-28 03:01:58,971 INFO L78 Accepts]: Start accepts. Automaton has 2354 states and 8896 transitions. Word has length 14 [2020-11-28 03:01:58,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:58,972 INFO L481 AbstractCegarLoop]: Abstraction has 2354 states and 8896 transitions. [2020-11-28 03:01:58,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:01:58,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 8896 transitions. [2020-11-28 03:01:58,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-28 03:01:58,977 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:58,977 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:58,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 03:01:58,977 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:58,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:58,978 INFO L82 PathProgramCache]: Analyzing trace with hash -429123293, now seen corresponding path program 1 times [2020-11-28 03:01:58,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:58,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193165079] [2020-11-28 03:01:58,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:59,173 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-28 03:01:59,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193165079] [2020-11-28 03:01:59,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:59,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:01:59,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637226149] [2020-11-28 03:01:59,175 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:01:59,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:59,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:01:59,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:01:59,176 INFO L87 Difference]: Start difference. First operand 2354 states and 8896 transitions. Second operand 6 states. [2020-11-28 03:01:59,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:59,374 INFO L93 Difference]: Finished difference Result 2522 states and 9290 transitions. [2020-11-28 03:01:59,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:01:59,375 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-28 03:01:59,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:59,412 INFO L225 Difference]: With dead ends: 2522 [2020-11-28 03:01:59,413 INFO L226 Difference]: Without dead ends: 2242 [2020-11-28 03:01:59,413 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:01:59,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2020-11-28 03:01:59,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2242. [2020-11-28 03:01:59,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2242 states. [2020-11-28 03:01:59,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 8400 transitions. [2020-11-28 03:01:59,575 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 8400 transitions. Word has length 15 [2020-11-28 03:01:59,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:59,576 INFO L481 AbstractCegarLoop]: Abstraction has 2242 states and 8400 transitions. [2020-11-28 03:01:59,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:01:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 8400 transitions. [2020-11-28 03:01:59,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-28 03:01:59,583 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:59,583 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:59,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 03:01:59,584 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:59,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:59,584 INFO L82 PathProgramCache]: Analyzing trace with hash -857925543, now seen corresponding path program 1 times [2020-11-28 03:01:59,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:59,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74910106] [2020-11-28 03:01:59,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:59,751 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-28 03:01:59,752 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74910106] [2020-11-28 03:01:59,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:59,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:01:59,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493477667] [2020-11-28 03:01:59,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:01:59,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:59,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:01:59,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:01:59,754 INFO L87 Difference]: Start difference. First operand 2242 states and 8400 transitions. Second operand 5 states. [2020-11-28 03:01:59,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:59,836 INFO L93 Difference]: Finished difference Result 2326 states and 8590 transitions. [2020-11-28 03:01:59,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:01:59,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-11-28 03:01:59,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:59,852 INFO L225 Difference]: With dead ends: 2326 [2020-11-28 03:01:59,853 INFO L226 Difference]: Without dead ends: 2186 [2020-11-28 03:01:59,853 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:01:59,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2186 states. [2020-11-28 03:01:59,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2186 to 2090. [2020-11-28 03:01:59,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2020-11-28 03:01:59,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7828 transitions. [2020-11-28 03:01:59,968 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7828 transitions. Word has length 17 [2020-11-28 03:01:59,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:59,968 INFO L481 AbstractCegarLoop]: Abstraction has 2090 states and 7828 transitions. [2020-11-28 03:01:59,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:01:59,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7828 transitions. [2020-11-28 03:01:59,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-28 03:01:59,979 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:59,979 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:59,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 03:01:59,979 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:59,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:59,980 INFO L82 PathProgramCache]: Analyzing trace with hash -793569295, now seen corresponding path program 1 times [2020-11-28 03:01:59,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:59,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641754756] [2020-11-28 03:01:59,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:02:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:02:00,210 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-28 03:02:00,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641754756] [2020-11-28 03:02:00,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:02:00,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:02:00,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183301279] [2020-11-28 03:02:00,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:02:00,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:02:00,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:02:00,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:02:00,213 INFO L87 Difference]: Start difference. First operand 2090 states and 7828 transitions. Second operand 7 states. [2020-11-28 03:02:00,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:02:00,431 INFO L93 Difference]: Finished difference Result 2618 states and 9758 transitions. [2020-11-28 03:02:00,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:02:00,432 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-11-28 03:02:00,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:02:00,448 INFO L225 Difference]: With dead ends: 2618 [2020-11-28 03:02:00,448 INFO L226 Difference]: Without dead ends: 2450 [2020-11-28 03:02:00,449 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-28 03:02:00,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2020-11-28 03:02:00,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2250. [2020-11-28 03:02:00,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2250 states. [2020-11-28 03:02:00,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 8484 transitions. [2020-11-28 03:02:00,568 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 8484 transitions. Word has length 17 [2020-11-28 03:02:00,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:02:00,569 INFO L481 AbstractCegarLoop]: Abstraction has 2250 states and 8484 transitions. [2020-11-28 03:02:00,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:02:00,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 8484 transitions. [2020-11-28 03:02:00,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-28 03:02:00,576 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:02:00,576 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:02:00,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 03:02:00,577 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:02:00,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:02:00,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1058113375, now seen corresponding path program 2 times [2020-11-28 03:02:00,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:02:00,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341913395] [2020-11-28 03:02:00,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:02:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:02:00,797 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-28 03:02:00,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341913395] [2020-11-28 03:02:00,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:02:00,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:02:00,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985814066] [2020-11-28 03:02:00,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:02:00,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:02:00,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:02:00,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:02:00,800 INFO L87 Difference]: Start difference. First operand 2250 states and 8484 transitions. Second operand 7 states. [2020-11-28 03:02:01,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:02:01,109 INFO L93 Difference]: Finished difference Result 2706 states and 10018 transitions. [2020-11-28 03:02:01,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:02:01,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-11-28 03:02:01,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:02:01,125 INFO L225 Difference]: With dead ends: 2706 [2020-11-28 03:02:01,125 INFO L226 Difference]: Without dead ends: 2482 [2020-11-28 03:02:01,126 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-11-28 03:02:01,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2482 states. [2020-11-28 03:02:01,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2482 to 2322. [2020-11-28 03:02:01,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2322 states. [2020-11-28 03:02:01,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 8636 transitions. [2020-11-28 03:02:01,251 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 8636 transitions. Word has length 17 [2020-11-28 03:02:01,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:02:01,252 INFO L481 AbstractCegarLoop]: Abstraction has 2322 states and 8636 transitions. [2020-11-28 03:02:01,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:02:01,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 8636 transitions. [2020-11-28 03:02:01,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-28 03:02:01,260 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:02:01,260 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:02:01,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 03:02:01,261 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:02:01,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:02:01,261 INFO L82 PathProgramCache]: Analyzing trace with hash -71966300, now seen corresponding path program 1 times [2020-11-28 03:02:01,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:02:01,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349404411] [2020-11-28 03:02:01,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:02:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:02:01,408 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-28 03:02:01,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349404411] [2020-11-28 03:02:01,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:02:01,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:02:01,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037057094] [2020-11-28 03:02:01,409 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:02:01,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:02:01,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:02:01,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:02:01,410 INFO L87 Difference]: Start difference. First operand 2322 states and 8636 transitions. Second operand 4 states. [2020-11-28 03:02:01,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:02:01,500 INFO L93 Difference]: Finished difference Result 2400 states and 8145 transitions. [2020-11-28 03:02:01,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:02:01,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-11-28 03:02:01,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:02:01,511 INFO L225 Difference]: With dead ends: 2400 [2020-11-28 03:02:01,511 INFO L226 Difference]: Without dead ends: 1824 [2020-11-28 03:02:01,512 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-28 03:02:01,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2020-11-28 03:02:01,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1824. [2020-11-28 03:02:01,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2020-11-28 03:02:01,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 6146 transitions. [2020-11-28 03:02:01,597 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 6146 transitions. Word has length 17 [2020-11-28 03:02:01,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:02:01,598 INFO L481 AbstractCegarLoop]: Abstraction has 1824 states and 6146 transitions. [2020-11-28 03:02:01,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:02:01,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 6146 transitions. [2020-11-28 03:02:01,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-28 03:02:01,604 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:02:01,604 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:02:01,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 03:02:01,605 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:02:01,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:02:01,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1706288293, now seen corresponding path program 1 times [2020-11-28 03:02:01,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:02:01,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652617554] [2020-11-28 03:02:01,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:02:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:02:01,733 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-28 03:02:01,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652617554] [2020-11-28 03:02:01,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:02:01,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:02:01,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653730474] [2020-11-28 03:02:01,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:02:01,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:02:01,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:02:01,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:02:01,736 INFO L87 Difference]: Start difference. First operand 1824 states and 6146 transitions. Second operand 5 states. [2020-11-28 03:02:01,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:02:01,820 INFO L93 Difference]: Finished difference Result 1531 states and 4708 transitions. [2020-11-28 03:02:01,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:02:01,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-11-28 03:02:01,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:02:01,827 INFO L225 Difference]: With dead ends: 1531 [2020-11-28 03:02:01,828 INFO L226 Difference]: Without dead ends: 1162 [2020-11-28 03:02:01,828 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-28 03:02:01,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2020-11-28 03:02:01,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1162. [2020-11-28 03:02:01,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1162 states. [2020-11-28 03:02:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 3498 transitions. [2020-11-28 03:02:01,878 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 3498 transitions. Word has length 18 [2020-11-28 03:02:01,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:02:01,879 INFO L481 AbstractCegarLoop]: Abstraction has 1162 states and 3498 transitions. [2020-11-28 03:02:01,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:02:01,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 3498 transitions. [2020-11-28 03:02:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-28 03:02:01,884 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:02:01,884 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:02:01,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 03:02:01,884 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:02:01,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:02:01,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1034534510, now seen corresponding path program 1 times [2020-11-28 03:02:01,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:02:01,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525697896] [2020-11-28 03:02:01,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:02:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:02:02,192 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-28 03:02:02,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525697896] [2020-11-28 03:02:02,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:02:02,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-28 03:02:02,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544045826] [2020-11-28 03:02:02,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-28 03:02:02,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:02:02,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-28 03:02:02,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-28 03:02:02,194 INFO L87 Difference]: Start difference. First operand 1162 states and 3498 transitions. Second operand 9 states. [2020-11-28 03:02:02,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:02:02,571 INFO L93 Difference]: Finished difference Result 1704 states and 5082 transitions. [2020-11-28 03:02:02,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 03:02:02,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-11-28 03:02:02,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:02:02,578 INFO L225 Difference]: With dead ends: 1704 [2020-11-28 03:02:02,578 INFO L226 Difference]: Without dead ends: 1160 [2020-11-28 03:02:02,578 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-11-28 03:02:02,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2020-11-28 03:02:02,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1160. [2020-11-28 03:02:02,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2020-11-28 03:02:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 3424 transitions. [2020-11-28 03:02:02,627 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 3424 transitions. Word has length 20 [2020-11-28 03:02:02,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:02:02,627 INFO L481 AbstractCegarLoop]: Abstraction has 1160 states and 3424 transitions. [2020-11-28 03:02:02,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-28 03:02:02,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 3424 transitions. [2020-11-28 03:02:02,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-28 03:02:02,632 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:02:02,632 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:02:02,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 03:02:02,633 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:02:02,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:02:02,634 INFO L82 PathProgramCache]: Analyzing trace with hash 156009029, now seen corresponding path program 1 times [2020-11-28 03:02:02,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:02:02,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260705903] [2020-11-28 03:02:02,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:02:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:02:02,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-28 03:02:02,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260705903] [2020-11-28 03:02:02,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:02:02,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:02:02,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233965706] [2020-11-28 03:02:02,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:02:02,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:02:02,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:02:02,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:02:02,770 INFO L87 Difference]: Start difference. First operand 1160 states and 3424 transitions. Second operand 6 states. [2020-11-28 03:02:02,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:02:02,885 INFO L93 Difference]: Finished difference Result 964 states and 2804 transitions. [2020-11-28 03:02:02,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:02:02,887 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-11-28 03:02:02,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:02:02,890 INFO L225 Difference]: With dead ends: 964 [2020-11-28 03:02:02,891 INFO L226 Difference]: Without dead ends: 842 [2020-11-28 03:02:02,891 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:02:02,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2020-11-28 03:02:02,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2020-11-28 03:02:02,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 842 states. [2020-11-28 03:02:02,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 2480 transitions. [2020-11-28 03:02:02,925 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 2480 transitions. Word has length 20 [2020-11-28 03:02:02,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:02:02,925 INFO L481 AbstractCegarLoop]: Abstraction has 842 states and 2480 transitions. [2020-11-28 03:02:02,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:02:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 2480 transitions. [2020-11-28 03:02:02,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-28 03:02:02,930 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:02:02,930 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:02:02,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-28 03:02:02,931 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:02:02,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:02:02,931 INFO L82 PathProgramCache]: Analyzing trace with hash -976237470, now seen corresponding path program 1 times [2020-11-28 03:02:02,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:02:02,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825154023] [2020-11-28 03:02:02,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:02:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:02:03,116 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-28 03:02:03,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825154023] [2020-11-28 03:02:03,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:02:03,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:02:03,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881547904] [2020-11-28 03:02:03,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:02:03,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:02:03,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:02:03,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:02:03,119 INFO L87 Difference]: Start difference. First operand 842 states and 2480 transitions. Second operand 6 states. [2020-11-28 03:02:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:02:03,227 INFO L93 Difference]: Finished difference Result 1177 states and 3349 transitions. [2020-11-28 03:02:03,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:02:03,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-11-28 03:02:03,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:02:03,232 INFO L225 Difference]: With dead ends: 1177 [2020-11-28 03:02:03,232 INFO L226 Difference]: Without dead ends: 844 [2020-11-28 03:02:03,234 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-28 03:02:03,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2020-11-28 03:02:03,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 804. [2020-11-28 03:02:03,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-11-28 03:02:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 2234 transitions. [2020-11-28 03:02:03,267 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 2234 transitions. Word has length 23 [2020-11-28 03:02:03,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:02:03,269 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 2234 transitions. [2020-11-28 03:02:03,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:02:03,269 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 2234 transitions. [2020-11-28 03:02:03,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-28 03:02:03,275 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:02:03,275 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:02:03,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-28 03:02:03,275 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:02:03,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:02:03,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1733612712, now seen corresponding path program 2 times [2020-11-28 03:02:03,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:02:03,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834750976] [2020-11-28 03:02:03,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:02:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:02:03,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:02:03,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834750976] [2020-11-28 03:02:03,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:02:03,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:02:03,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629103738] [2020-11-28 03:02:03,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:02:03,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:02:03,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:02:03,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:02:03,450 INFO L87 Difference]: Start difference. First operand 804 states and 2234 transitions. Second operand 7 states. [2020-11-28 03:02:03,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:02:03,576 INFO L93 Difference]: Finished difference Result 1045 states and 2835 transitions. [2020-11-28 03:02:03,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:02:03,577 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-11-28 03:02:03,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:02:03,580 INFO L225 Difference]: With dead ends: 1045 [2020-11-28 03:02:03,580 INFO L226 Difference]: Without dead ends: 689 [2020-11-28 03:02:03,583 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-11-28 03:02:03,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2020-11-28 03:02:03,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 629. [2020-11-28 03:02:03,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2020-11-28 03:02:03,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1650 transitions. [2020-11-28 03:02:03,612 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1650 transitions. Word has length 23 [2020-11-28 03:02:03,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:02:03,613 INFO L481 AbstractCegarLoop]: Abstraction has 629 states and 1650 transitions. [2020-11-28 03:02:03,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:02:03,613 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1650 transitions. [2020-11-28 03:02:03,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-28 03:02:03,619 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:02:03,620 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:02:03,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-28 03:02:03,620 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:02:03,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:02:03,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1592607910, now seen corresponding path program 3 times [2020-11-28 03:02:03,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:02:03,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854776967] [2020-11-28 03:02:03,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:02:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:02:03,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-28 03:02:03,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854776967] [2020-11-28 03:02:03,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:02:03,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 03:02:03,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015112903] [2020-11-28 03:02:03,789 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-28 03:02:03,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:02:03,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-28 03:02:03,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:02:03,790 INFO L87 Difference]: Start difference. First operand 629 states and 1650 transitions. Second operand 7 states. [2020-11-28 03:02:03,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:02:03,936 INFO L93 Difference]: Finished difference Result 591 states and 1574 transitions. [2020-11-28 03:02:03,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 03:02:03,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-11-28 03:02:03,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:02:03,938 INFO L225 Difference]: With dead ends: 591 [2020-11-28 03:02:03,939 INFO L226 Difference]: Without dead ends: 209 [2020-11-28 03:02:03,939 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:02:03,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-11-28 03:02:03,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 185. [2020-11-28 03:02:03,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-11-28 03:02:03,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 455 transitions. [2020-11-28 03:02:03,951 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 455 transitions. Word has length 23 [2020-11-28 03:02:03,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:02:03,951 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 455 transitions. [2020-11-28 03:02:03,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-28 03:02:03,952 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 455 transitions. [2020-11-28 03:02:03,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-28 03:02:03,953 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:02:03,953 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:02:03,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-28 03:02:03,954 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:02:03,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:02:03,954 INFO L82 PathProgramCache]: Analyzing trace with hash 955261625, now seen corresponding path program 1 times [2020-11-28 03:02:03,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:02:03,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957010641] [2020-11-28 03:02:03,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:02:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:02:04,234 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-28 03:02:04,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957010641] [2020-11-28 03:02:04,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:02:04,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-28 03:02:04,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983904880] [2020-11-28 03:02:04,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-28 03:02:04,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:02:04,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-28 03:02:04,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-11-28 03:02:04,244 INFO L87 Difference]: Start difference. First operand 185 states and 455 transitions. Second operand 11 states. [2020-11-28 03:02:04,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:02:04,773 INFO L93 Difference]: Finished difference Result 314 states and 762 transitions. [2020-11-28 03:02:04,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-28 03:02:04,774 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-11-28 03:02:04,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:02:04,774 INFO L225 Difference]: With dead ends: 314 [2020-11-28 03:02:04,775 INFO L226 Difference]: Without dead ends: 224 [2020-11-28 03:02:04,777 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2020-11-28 03:02:04,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-11-28 03:02:04,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 209. [2020-11-28 03:02:04,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-11-28 03:02:04,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 504 transitions. [2020-11-28 03:02:04,785 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 504 transitions. Word has length 27 [2020-11-28 03:02:04,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:02:04,786 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 504 transitions. [2020-11-28 03:02:04,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-28 03:02:04,786 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 504 transitions. [2020-11-28 03:02:04,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-28 03:02:04,787 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:02:04,788 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:02:04,788 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-28 03:02:04,788 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:02:04,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:02:04,789 INFO L82 PathProgramCache]: Analyzing trace with hash 631774201, now seen corresponding path program 2 times [2020-11-28 03:02:04,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:02:04,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301038314] [2020-11-28 03:02:04,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:02:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:02:05,036 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-28 03:02:05,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301038314] [2020-11-28 03:02:05,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:02:05,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-28 03:02:05,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795271136] [2020-11-28 03:02:05,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-28 03:02:05,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:02:05,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-28 03:02:05,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-11-28 03:02:05,039 INFO L87 Difference]: Start difference. First operand 209 states and 504 transitions. Second operand 11 states. [2020-11-28 03:02:05,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:02:05,314 INFO L93 Difference]: Finished difference Result 272 states and 631 transitions. [2020-11-28 03:02:05,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-28 03:02:05,315 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-11-28 03:02:05,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:02:05,317 INFO L225 Difference]: With dead ends: 272 [2020-11-28 03:02:05,317 INFO L226 Difference]: Without dead ends: 255 [2020-11-28 03:02:05,318 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-11-28 03:02:05,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-11-28 03:02:05,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 223. [2020-11-28 03:02:05,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-11-28 03:02:05,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 524 transitions. [2020-11-28 03:02:05,328 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 524 transitions. Word has length 27 [2020-11-28 03:02:05,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:02:05,328 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 524 transitions. [2020-11-28 03:02:05,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-28 03:02:05,329 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 524 transitions. [2020-11-28 03:02:05,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-28 03:02:05,335 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:02:05,335 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:02:05,336 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-28 03:02:05,336 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:02:05,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:02:05,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1814196601, now seen corresponding path program 3 times [2020-11-28 03:02:05,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:02:05,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829954340] [2020-11-28 03:02:05,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:02:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:02:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:02:05,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829954340] [2020-11-28 03:02:05,740 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:02:05,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-28 03:02:05,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918302077] [2020-11-28 03:02:05,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-28 03:02:05,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:02:05,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-28 03:02:05,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-11-28 03:02:05,742 INFO L87 Difference]: Start difference. First operand 223 states and 524 transitions. Second operand 11 states. [2020-11-28 03:02:06,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:02:06,004 INFO L93 Difference]: Finished difference Result 269 states and 616 transitions. [2020-11-28 03:02:06,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-28 03:02:06,005 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-11-28 03:02:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:02:06,006 INFO L225 Difference]: With dead ends: 269 [2020-11-28 03:02:06,006 INFO L226 Difference]: Without dead ends: 172 [2020-11-28 03:02:06,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-11-28 03:02:06,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-11-28 03:02:06,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 133. [2020-11-28 03:02:06,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-11-28 03:02:06,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 303 transitions. [2020-11-28 03:02:06,012 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 303 transitions. Word has length 27 [2020-11-28 03:02:06,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:02:06,013 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 303 transitions. [2020-11-28 03:02:06,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-28 03:02:06,013 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 303 transitions. [2020-11-28 03:02:06,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-28 03:02:06,014 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:02:06,014 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:02:06,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-28 03:02:06,014 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:02:06,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:02:06,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1748049593, now seen corresponding path program 4 times [2020-11-28 03:02:06,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:02:06,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17253476] [2020-11-28 03:02:06,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:02:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:02:06,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:02:06,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17253476] [2020-11-28 03:02:06,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:02:06,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 03:02:06,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375154775] [2020-11-28 03:02:06,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-28 03:02:06,253 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:02:06,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-28 03:02:06,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:02:06,254 INFO L87 Difference]: Start difference. First operand 133 states and 303 transitions. Second operand 8 states. [2020-11-28 03:02:06,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:02:06,454 INFO L93 Difference]: Finished difference Result 172 states and 384 transitions. [2020-11-28 03:02:06,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:02:06,458 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-11-28 03:02:06,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:02:06,459 INFO L225 Difference]: With dead ends: 172 [2020-11-28 03:02:06,459 INFO L226 Difference]: Without dead ends: 85 [2020-11-28 03:02:06,459 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-11-28 03:02:06,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-11-28 03:02:06,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-11-28 03:02:06,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-11-28 03:02:06,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 171 transitions. [2020-11-28 03:02:06,462 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 171 transitions. Word has length 27 [2020-11-28 03:02:06,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:02:06,463 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 171 transitions. [2020-11-28 03:02:06,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-28 03:02:06,463 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 171 transitions. [2020-11-28 03:02:06,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-28 03:02:06,464 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:02:06,464 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:02:06,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-28 03:02:06,464 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:02:06,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:02:06,465 INFO L82 PathProgramCache]: Analyzing trace with hash -370388729, now seen corresponding path program 5 times [2020-11-28 03:02:06,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:02:06,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300225149] [2020-11-28 03:02:06,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:02:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:02:06,514 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:02:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:02:06,561 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:02:06,612 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:02:06,613 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 03:02:06,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-28 03:02:06,646 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-28 03:02:06,647 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,647 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-28 03:02:06,647 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [801] [2020-11-28 03:02:06,650 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-28 03:02:06,650 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,650 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-28 03:02:06,650 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,651 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-28 03:02:06,651 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,651 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-28 03:02:06,651 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,652 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-28 03:02:06,652 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,652 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-28 03:02:06,652 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,653 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-28 03:02:06,653 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,653 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-28 03:02:06,653 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,654 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-28 03:02:06,654 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,654 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-28 03:02:06,654 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,655 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-28 03:02:06,656 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,656 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-28 03:02:06,656 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,656 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-28 03:02:06,656 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,657 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-28 03:02:06,657 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,657 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-28 03:02:06,657 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,658 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-28 03:02:06,658 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,658 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-28 03:02:06,658 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,659 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-28 03:02:06,659 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,659 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-28 03:02:06,659 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,660 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-28 03:02:06,660 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,660 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-28 03:02:06,660 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,660 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-28 03:02:06,661 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,661 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-28 03:02:06,661 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,661 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-28 03:02:06,662 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,662 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-28 03:02:06,662 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,662 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-28 03:02:06,662 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,663 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-28 03:02:06,663 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:02:06 BasicIcfg [2020-11-28 03:02:06,776 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 03:02:06,777 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:02:06,777 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:02:06,777 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:02:06,778 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:01:44" (3/4) ... [2020-11-28 03:02:06,781 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 03:02:06,803 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-28 03:02:06,804 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,804 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-28 03:02:06,804 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [801] [2020-11-28 03:02:06,806 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-28 03:02:06,806 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,807 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-28 03:02:06,807 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,807 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-28 03:02:06,807 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,807 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-28 03:02:06,808 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,808 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-28 03:02:06,808 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,808 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-28 03:02:06,809 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,809 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-28 03:02:06,809 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,809 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-28 03:02:06,809 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,809 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-28 03:02:06,810 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,810 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-28 03:02:06,810 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,811 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:02:06,811 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,811 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:02:06,811 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,811 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:02:06,812 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,812 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:02:06,812 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,812 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:02:06,812 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,812 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:02:06,813 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,813 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:02:06,813 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,813 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:02:06,814 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,814 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:02:06,814 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,814 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:02:06,814 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,814 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:02:06,815 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,815 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:02:06,815 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,815 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:02:06,815 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,816 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:02:06,816 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,816 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:02:06,816 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,816 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:02:06,817 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:06,817 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 03:02:06,817 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 03:02:07,006 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ccce5259-c2e7-4240-bf94-8b36a674a54a/bin/uautomizer/witness.graphml [2020-11-28 03:02:07,006 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:02:07,008 INFO L168 Benchmark]: Toolchain (without parser) took 27077.21 ms. Allocated memory was 119.5 MB in the beginning and 325.1 MB in the end (delta: 205.5 MB). Free memory was 87.8 MB in the beginning and 214.1 MB in the end (delta: -126.3 MB). Peak memory consumption was 77.8 MB. Max. memory is 16.1 GB. [2020-11-28 03:02:07,009 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 77.6 MB. Free memory was 35.9 MB in the beginning and 35.8 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:02:07,009 INFO L168 Benchmark]: CACSL2BoogieTranslator took 879.59 ms. Allocated memory is still 119.5 MB. Free memory was 87.8 MB in the beginning and 72.0 MB in the end (delta: 15.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-28 03:02:07,009 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.73 ms. Allocated memory is still 119.5 MB. Free memory was 72.0 MB in the beginning and 68.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-28 03:02:07,010 INFO L168 Benchmark]: Boogie Preprocessor took 71.39 ms. Allocated memory is still 119.5 MB. Free memory was 68.4 MB in the beginning and 66.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:02:07,011 INFO L168 Benchmark]: RCFGBuilder took 3035.75 ms. Allocated memory was 119.5 MB in the beginning and 153.1 MB in the end (delta: 33.6 MB). Free memory was 66.3 MB in the beginning and 79.5 MB in the end (delta: -13.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 16.1 GB. [2020-11-28 03:02:07,011 INFO L168 Benchmark]: TraceAbstraction took 22755.11 ms. Allocated memory was 153.1 MB in the beginning and 325.1 MB in the end (delta: 172.0 MB). Free memory was 78.4 MB in the beginning and 235.1 MB in the end (delta: -156.6 MB). Peak memory consumption was 15.3 MB. Max. memory is 16.1 GB. [2020-11-28 03:02:07,012 INFO L168 Benchmark]: Witness Printer took 229.69 ms. Allocated memory is still 325.1 MB. Free memory was 235.1 MB in the beginning and 214.1 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-28 03:02:07,015 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.32 ms. Allocated memory is still 77.6 MB. Free memory was 35.9 MB in the beginning and 35.8 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 879.59 ms. Allocated memory is still 119.5 MB. Free memory was 87.8 MB in the beginning and 72.0 MB in the end (delta: 15.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 94.73 ms. Allocated memory is still 119.5 MB. Free memory was 72.0 MB in the beginning and 68.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 71.39 ms. Allocated memory is still 119.5 MB. Free memory was 68.4 MB in the beginning and 66.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3035.75 ms. Allocated memory was 119.5 MB in the beginning and 153.1 MB in the end (delta: 33.6 MB). Free memory was 66.3 MB in the beginning and 79.5 MB in the end (delta: -13.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 22755.11 ms. Allocated memory was 153.1 MB in the beginning and 325.1 MB in the end (delta: 172.0 MB). Free memory was 78.4 MB in the beginning and 235.1 MB in the end (delta: -156.6 MB). Peak memory consumption was 15.3 MB. Max. memory is 16.1 GB. * Witness Printer took 229.69 ms. Allocated memory is still 325.1 MB. Free memory was 235.1 MB in the beginning and 214.1 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1889 VarBasedMoverChecksPositive, 69 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 46 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 238 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.3s, 131 PlacesBefore, 46 PlacesAfterwards, 121 TransitionsBefore, 34 TransitionsAfterwards, 2830 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 103 TotalNumberOfCompositions, 7226 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1181; [L847] FCALL, FORK 0 pthread_create(&t1181, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1182; [L849] FCALL, FORK 0 pthread_create(&t1182, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1183; [L851] FCALL, FORK 0 pthread_create(&t1183, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1184; [L853] FCALL, FORK 0 pthread_create(&t1184, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L18] COND TRUE 4 !expression [L17] COND FALSE 4 !(0) [L17] 4 __assert_fail ("0", "mix044_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L782] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix044_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 22.3s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.7s, HoareTripleCheckerStatistics: 843 SDtfs, 1175 SDslu, 2396 SDs, 0 SdLazy, 1197 SolverSat, 229 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3562occurred 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: 1.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 666 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 406 NumberOfCodeBlocks, 406 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 359 ConstructedInterpolants, 0 QuantifiedInterpolants, 51116 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...