./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix057_tso.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_9f34c147-ba88-46be-b862-83f30f97fa78/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_9f34c147-ba88-46be-b862-83f30f97fa78/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9f34c147-ba88-46be-b862-83f30f97fa78/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9f34c147-ba88-46be-b862-83f30f97fa78/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix057_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9f34c147-ba88-46be-b862-83f30f97fa78/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9f34c147-ba88-46be-b862-83f30f97fa78/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 d418f4c235d4e249cca49982294bc62a0d9b5e97 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-30 00:55:31,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:55:31,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:55:31,739 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:55:31,739 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:55:31,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:55:31,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:55:31,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:55:31,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:55:31,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:55:31,771 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:55:31,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:55:31,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:55:31,779 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:55:31,781 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:55:31,784 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:55:31,786 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:55:31,791 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:55:31,795 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:55:31,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:55:31,807 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:55:31,808 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:55:31,809 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:55:31,811 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:55:31,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:55:31,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:55:31,815 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:55:31,816 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:55:31,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:55:31,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:55:31,818 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:55:31,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:55:31,820 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:55:31,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:55:31,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:55:31,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:55:31,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:55:31,823 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:55:31,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:55:31,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:55:31,824 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:55:31,827 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9f34c147-ba88-46be-b862-83f30f97fa78/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 00:55:31,853 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:55:31,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:55:31,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:55:31,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:55:31,855 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:55:31,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:55:31,855 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:55:31,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:55:31,856 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:55:31,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:55:31,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 00:55:31,856 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 00:55:31,856 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 00:55:31,857 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:55:31,857 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:55:31,857 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:55:31,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 00:55:31,858 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:55:31,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:55:31,858 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 00:55:31,858 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 00:55:31,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:55:31,859 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:55:31,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 00:55:31,859 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 00:55:31,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:55:31,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 00:55:31,860 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 00:55:31,860 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:55:31,860 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_9f34c147-ba88-46be-b862-83f30f97fa78/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_9f34c147-ba88-46be-b862-83f30f97fa78/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 -> d418f4c235d4e249cca49982294bc62a0d9b5e97 [2020-11-30 00:55:32,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:55:32,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:55:32,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:55:32,189 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:55:32,192 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:55:32,193 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9f34c147-ba88-46be-b862-83f30f97fa78/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix057_tso.opt.i [2020-11-30 00:55:32,292 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9f34c147-ba88-46be-b862-83f30f97fa78/bin/uautomizer/data/f7e972816/8b44b0e6880a4d25b92a4fd5615b5f5d/FLAGd2891bf1e [2020-11-30 00:55:32,846 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:55:32,851 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9f34c147-ba88-46be-b862-83f30f97fa78/sv-benchmarks/c/pthread-wmm/mix057_tso.opt.i [2020-11-30 00:55:32,877 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9f34c147-ba88-46be-b862-83f30f97fa78/bin/uautomizer/data/f7e972816/8b44b0e6880a4d25b92a4fd5615b5f5d/FLAGd2891bf1e [2020-11-30 00:55:33,136 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9f34c147-ba88-46be-b862-83f30f97fa78/bin/uautomizer/data/f7e972816/8b44b0e6880a4d25b92a4fd5615b5f5d [2020-11-30 00:55:33,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:55:33,140 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:55:33,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:55:33,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:55:33,146 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:55:33,147 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:55:33" (1/1) ... [2020-11-30 00:55:33,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3568a9a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:55:33, skipping insertion in model container [2020-11-30 00:55:33,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:55:33" (1/1) ... [2020-11-30 00:55:33,158 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:55:33,206 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:55:33,680 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:55:33,690 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:55:33,757 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:55:33,849 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:55:33,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:55:33 WrapperNode [2020-11-30 00:55:33,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:55:33,851 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:55:33,851 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:55:33,851 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:55:33,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:55:33" (1/1) ... [2020-11-30 00:55:33,878 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:55:33" (1/1) ... [2020-11-30 00:55:33,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:55:33,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:55:33,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:55:33,914 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:55:33,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:55:33" (1/1) ... [2020-11-30 00:55:33,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:55:33" (1/1) ... [2020-11-30 00:55:33,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:55:33" (1/1) ... [2020-11-30 00:55:33,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:55:33" (1/1) ... [2020-11-30 00:55:33,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:55:33" (1/1) ... [2020-11-30 00:55:33,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:55:33" (1/1) ... [2020-11-30 00:55:33,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:55:33" (1/1) ... [2020-11-30 00:55:33,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:55:33,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:55:33,957 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:55:33,957 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:55:33,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:55:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9f34c147-ba88-46be-b862-83f30f97fa78/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-30 00:55:34,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-30 00:55:34,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-30 00:55:34,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:55:34,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-30 00:55:34,056 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-30 00:55:34,056 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-30 00:55:34,056 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-30 00:55:34,056 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-30 00:55:34,057 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-30 00:55:34,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-30 00:55:34,057 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-30 00:55:34,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-30 00:55:34,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 00:55:34,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-30 00:55:34,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:55:34,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:55:34,060 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-30 00:55:37,034 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:55:37,034 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-30 00:55:37,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:55:37 BoogieIcfgContainer [2020-11-30 00:55:37,036 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:55:37,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 00:55:37,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 00:55:37,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 00:55:37,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:55:33" (1/3) ... [2020-11-30 00:55:37,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b7544b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:55:37, skipping insertion in model container [2020-11-30 00:55:37,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:55:33" (2/3) ... [2020-11-30 00:55:37,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b7544b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:55:37, skipping insertion in model container [2020-11-30 00:55:37,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:55:37" (3/3) ... [2020-11-30 00:55:37,049 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_tso.opt.i [2020-11-30 00:55:37,062 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-30 00:55:37,062 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 00:55:37,067 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-30 00:55:37,068 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-30 00:55:37,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,102 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,103 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,103 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,104 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,104 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,104 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,104 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,105 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,106 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,106 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,108 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,109 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,109 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,109 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,111 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,116 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,117 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,118 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,125 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,125 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,127 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,128 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,130 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,130 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,131 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-30 00:55:37,137 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-30 00:55:37,151 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-30 00:55:37,179 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 00:55:37,179 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 00:55:37,179 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 00:55:37,180 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:55:37,180 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:55:37,180 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 00:55:37,181 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:55:37,182 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 00:55:37,205 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-30 00:55:37,210 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 116 transitions, 252 flow [2020-11-30 00:55:37,214 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 116 transitions, 252 flow [2020-11-30 00:55:37,217 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 126 places, 116 transitions, 252 flow [2020-11-30 00:55:37,298 INFO L129 PetriNetUnfolder]: 3/112 cut-off events. [2020-11-30 00:55:37,298 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-30 00:55:37,304 INFO L80 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 3/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2020-11-30 00:55:37,312 INFO L116 LiptonReduction]: Number of co-enabled transitions 2622 [2020-11-30 00:55:37,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 00:55:37,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:55:37,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 00:55:37,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:55:37,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:55:37,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:37,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:55:37,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:37,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:55:37,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:37,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:55:37,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:38,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 00:55:38,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:55:38,632 WARN L193 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-30 00:55:38,759 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-30 00:55:39,016 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-30 00:55:39,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:55:39,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:39,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:55:39,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:39,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:55:39,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:39,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:55:39,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:39,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:55:39,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:55:39,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:55:39,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:55:39,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:55:39,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:55:39,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:55:39,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:55:39,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:55:39,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:55:39,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:55:39,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:55:39,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:55:39,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:55:39,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:55:39,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:55:39,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:55:39,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:55:39,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:55:39,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:55:39,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:55:39,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:55:39,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:55:39,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:55:39,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:55:39,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:55:39,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:55:39,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:55:39,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-30 00:55:39,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:55:39,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-30 00:55:39,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 00:55:39,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:55:39,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:39,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:55:39,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:39,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:55:39,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:39,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:55:39,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:39,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:55:39,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:39,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:55:39,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:39,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:55:39,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:39,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:55:39,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:40,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:55:40,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:40,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:55:40,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:40,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:55:40,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:40,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:55:40,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:40,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-30 00:55:40,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:55:40,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:55:40,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:40,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:55:40,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:40,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-30 00:55:40,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:40,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:55:40,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:41,965 WARN L193 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-11-30 00:55:41,992 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-11-30 00:55:41,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:41,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-30 00:55:41,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:55:43,362 WARN L193 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2020-11-30 00:55:43,980 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-11-30 00:55:44,386 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-30 00:55:44,492 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-30 00:55:44,981 WARN L193 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-11-30 00:55:45,180 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-11-30 00:55:45,204 INFO L131 LiptonReduction]: Checked pairs total: 6442 [2020-11-30 00:55:45,205 INFO L133 LiptonReduction]: Total number of compositions: 98 [2020-11-30 00:55:45,211 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2020-11-30 00:55:45,490 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3082 states. [2020-11-30 00:55:45,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states. [2020-11-30 00:55:45,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 00:55:45,506 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:55:45,506 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:55:45,507 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-30 00:55:45,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:55:45,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1604801105, now seen corresponding path program 1 times [2020-11-30 00:55:45,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:55:45,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961091283] [2020-11-30 00:55:45,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:55:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:45,920 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-30 00:55:45,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961091283] [2020-11-30 00:55:45,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:55:45,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-30 00:55:45,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739048506] [2020-11-30 00:55:45,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:55:45,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:55:45,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:55:45,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:55:45,953 INFO L87 Difference]: Start difference. First operand 3082 states. Second operand 3 states. [2020-11-30 00:55:46,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:55:46,118 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-11-30 00:55:46,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:55:46,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-30 00:55:46,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:55:46,163 INFO L225 Difference]: With dead ends: 2602 [2020-11-30 00:55:46,163 INFO L226 Difference]: Without dead ends: 2202 [2020-11-30 00:55:46,164 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-30 00:55:46,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2020-11-30 00:55:46,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 2202. [2020-11-30 00:55:46,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2020-11-30 00:55:46,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 8424 transitions. [2020-11-30 00:55:46,346 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 8424 transitions. Word has length 9 [2020-11-30 00:55:46,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:55:46,347 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 8424 transitions. [2020-11-30 00:55:46,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:55:46,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 8424 transitions. [2020-11-30 00:55:46,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-30 00:55:46,351 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:55:46,351 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:55:46,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 00:55:46,352 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-30 00:55:46,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:55:46,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1351042416, now seen corresponding path program 1 times [2020-11-30 00:55:46,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:55:46,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954805839] [2020-11-30 00:55:46,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:55:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:46,475 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-30 00:55:46,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954805839] [2020-11-30 00:55:46,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:55:46,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 00:55:46,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098917775] [2020-11-30 00:55:46,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:55:46,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:55:46,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:55:46,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:55:46,478 INFO L87 Difference]: Start difference. First operand 2202 states and 8424 transitions. Second operand 4 states. [2020-11-30 00:55:46,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:55:46,611 INFO L93 Difference]: Finished difference Result 2586 states and 9596 transitions. [2020-11-30 00:55:46,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:55:46,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-30 00:55:46,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:55:46,639 INFO L225 Difference]: With dead ends: 2586 [2020-11-30 00:55:46,639 INFO L226 Difference]: Without dead ends: 2186 [2020-11-30 00:55:46,640 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-30 00:55:46,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2186 states. [2020-11-30 00:55:46,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2186 to 2186. [2020-11-30 00:55:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2186 states. [2020-11-30 00:55:46,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2186 states to 2186 states and 8348 transitions. [2020-11-30 00:55:46,842 INFO L78 Accepts]: Start accepts. Automaton has 2186 states and 8348 transitions. Word has length 12 [2020-11-30 00:55:46,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:55:46,843 INFO L481 AbstractCegarLoop]: Abstraction has 2186 states and 8348 transitions. [2020-11-30 00:55:46,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:55:46,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2186 states and 8348 transitions. [2020-11-30 00:55:46,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-30 00:55:46,850 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:55:46,850 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:55:46,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 00:55:46,850 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-30 00:55:46,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:55:46,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1067393042, now seen corresponding path program 1 times [2020-11-30 00:55:46,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:55:46,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839264346] [2020-11-30 00:55:46,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:55:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:47,048 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-30 00:55:47,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839264346] [2020-11-30 00:55:47,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:55:47,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 00:55:47,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462638577] [2020-11-30 00:55:47,049 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:55:47,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:55:47,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:55:47,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:55:47,050 INFO L87 Difference]: Start difference. First operand 2186 states and 8348 transitions. Second operand 4 states. [2020-11-30 00:55:47,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:55:47,140 INFO L93 Difference]: Finished difference Result 2442 states and 9068 transitions. [2020-11-30 00:55:47,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:55:47,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-30 00:55:47,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:55:47,166 INFO L225 Difference]: With dead ends: 2442 [2020-11-30 00:55:47,166 INFO L226 Difference]: Without dead ends: 2122 [2020-11-30 00:55:47,167 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-30 00:55:47,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-11-30 00:55:47,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2020-11-30 00:55:47,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2020-11-30 00:55:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8060 transitions. [2020-11-30 00:55:47,281 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 8060 transitions. Word has length 13 [2020-11-30 00:55:47,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:55:47,282 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 8060 transitions. [2020-11-30 00:55:47,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:55:47,282 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 8060 transitions. [2020-11-30 00:55:47,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-30 00:55:47,285 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:55:47,285 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:55:47,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 00:55:47,285 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-30 00:55:47,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:55:47,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1067398808, now seen corresponding path program 1 times [2020-11-30 00:55:47,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:55:47,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467278872] [2020-11-30 00:55:47,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:55:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:47,439 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-30 00:55:47,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467278872] [2020-11-30 00:55:47,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:55:47,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-30 00:55:47,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719235760] [2020-11-30 00:55:47,440 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:55:47,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:55:47,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:55:47,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:55:47,441 INFO L87 Difference]: Start difference. First operand 2122 states and 8060 transitions. Second operand 4 states. [2020-11-30 00:55:47,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:55:47,600 INFO L93 Difference]: Finished difference Result 2426 states and 8968 transitions. [2020-11-30 00:55:47,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:55:47,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-30 00:55:47,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:55:47,681 INFO L225 Difference]: With dead ends: 2426 [2020-11-30 00:55:47,683 INFO L226 Difference]: Without dead ends: 2106 [2020-11-30 00:55:47,688 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-30 00:55:47,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2020-11-30 00:55:47,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 2106. [2020-11-30 00:55:47,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2106 states. [2020-11-30 00:55:47,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2106 states to 2106 states and 7984 transitions. [2020-11-30 00:55:47,795 INFO L78 Accepts]: Start accepts. Automaton has 2106 states and 7984 transitions. Word has length 13 [2020-11-30 00:55:47,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:55:47,796 INFO L481 AbstractCegarLoop]: Abstraction has 2106 states and 7984 transitions. [2020-11-30 00:55:47,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:55:47,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2106 states and 7984 transitions. [2020-11-30 00:55:47,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 00:55:47,799 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:55:47,799 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:55:47,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 00:55:47,804 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-30 00:55:47,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:55:47,805 INFO L82 PathProgramCache]: Analyzing trace with hash 984029452, now seen corresponding path program 1 times [2020-11-30 00:55:47,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:55:47,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237309738] [2020-11-30 00:55:47,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:55:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:48,015 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-30 00:55:48,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237309738] [2020-11-30 00:55:48,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:55:48,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:55:48,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929543784] [2020-11-30 00:55:48,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:55:48,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:55:48,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:55:48,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:55:48,017 INFO L87 Difference]: Start difference. First operand 2106 states and 7984 transitions. Second operand 5 states. [2020-11-30 00:55:48,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:55:48,183 INFO L93 Difference]: Finished difference Result 2382 states and 8770 transitions. [2020-11-30 00:55:48,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:55:48,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-30 00:55:48,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:55:48,209 INFO L225 Difference]: With dead ends: 2382 [2020-11-30 00:55:48,210 INFO L226 Difference]: Without dead ends: 2062 [2020-11-30 00:55:48,210 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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-30 00:55:48,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2020-11-30 00:55:48,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 2062. [2020-11-30 00:55:48,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2062 states. [2020-11-30 00:55:48,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 7792 transitions. [2020-11-30 00:55:48,298 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 7792 transitions. Word has length 14 [2020-11-30 00:55:48,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:55:48,298 INFO L481 AbstractCegarLoop]: Abstraction has 2062 states and 7792 transitions. [2020-11-30 00:55:48,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:55:48,299 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 7792 transitions. [2020-11-30 00:55:48,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 00:55:48,301 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:55:48,302 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:55:48,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 00:55:48,302 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-30 00:55:48,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:55:48,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1270513322, now seen corresponding path program 1 times [2020-11-30 00:55:48,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:55:48,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468832] [2020-11-30 00:55:48,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:55:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:48,470 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-30 00:55:48,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468832] [2020-11-30 00:55:48,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:55:48,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:55:48,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141663302] [2020-11-30 00:55:48,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:55:48,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:55:48,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:55:48,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:55:48,473 INFO L87 Difference]: Start difference. First operand 2062 states and 7792 transitions. Second operand 5 states. [2020-11-30 00:55:48,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:55:48,689 INFO L93 Difference]: Finished difference Result 2254 states and 8304 transitions. [2020-11-30 00:55:48,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:55:48,690 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-30 00:55:48,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:55:48,736 INFO L225 Difference]: With dead ends: 2254 [2020-11-30 00:55:48,736 INFO L226 Difference]: Without dead ends: 1998 [2020-11-30 00:55:48,737 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-30 00:55:48,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2020-11-30 00:55:48,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1998. [2020-11-30 00:55:48,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2020-11-30 00:55:48,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7504 transitions. [2020-11-30 00:55:48,833 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7504 transitions. Word has length 14 [2020-11-30 00:55:48,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:55:48,833 INFO L481 AbstractCegarLoop]: Abstraction has 1998 states and 7504 transitions. [2020-11-30 00:55:48,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:55:48,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7504 transitions. [2020-11-30 00:55:48,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-30 00:55:48,837 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:55:48,837 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:55:48,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 00:55:48,837 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-30 00:55:48,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:55:48,838 INFO L82 PathProgramCache]: Analyzing trace with hash 440106962, now seen corresponding path program 1 times [2020-11-30 00:55:48,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:55:48,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045258779] [2020-11-30 00:55:48,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:55:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:48,929 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-30 00:55:48,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045258779] [2020-11-30 00:55:48,929 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:55:48,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:55:48,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194122308] [2020-11-30 00:55:48,930 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:55:48,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:55:48,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:55:48,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:55:48,931 INFO L87 Difference]: Start difference. First operand 1998 states and 7504 transitions. Second operand 4 states. [2020-11-30 00:55:49,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:55:49,036 INFO L93 Difference]: Finished difference Result 3094 states and 11154 transitions. [2020-11-30 00:55:49,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:55:49,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-30 00:55:49,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:55:49,049 INFO L225 Difference]: With dead ends: 3094 [2020-11-30 00:55:49,049 INFO L226 Difference]: Without dead ends: 2238 [2020-11-30 00:55:49,050 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-30 00:55:49,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2238 states. [2020-11-30 00:55:49,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2238 to 1934. [2020-11-30 00:55:49,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1934 states. [2020-11-30 00:55:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 6976 transitions. [2020-11-30 00:55:49,211 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 6976 transitions. Word has length 15 [2020-11-30 00:55:49,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:55:49,212 INFO L481 AbstractCegarLoop]: Abstraction has 1934 states and 6976 transitions. [2020-11-30 00:55:49,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:55:49,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 6976 transitions. [2020-11-30 00:55:49,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-30 00:55:49,217 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:55:49,217 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:55:49,217 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 00:55:49,217 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-30 00:55:49,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:55:49,218 INFO L82 PathProgramCache]: Analyzing trace with hash -498625880, now seen corresponding path program 1 times [2020-11-30 00:55:49,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:55:49,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291796299] [2020-11-30 00:55:49,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:55:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:49,387 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-30 00:55:49,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291796299] [2020-11-30 00:55:49,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:55:49,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:55:49,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290222803] [2020-11-30 00:55:49,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:55:49,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:55:49,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:55:49,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:55:49,389 INFO L87 Difference]: Start difference. First operand 1934 states and 6976 transitions. Second operand 6 states. [2020-11-30 00:55:49,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:55:49,580 INFO L93 Difference]: Finished difference Result 2102 states and 7412 transitions. [2020-11-30 00:55:49,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:55:49,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-30 00:55:49,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:55:49,593 INFO L225 Difference]: With dead ends: 2102 [2020-11-30 00:55:49,593 INFO L226 Difference]: Without dead ends: 1878 [2020-11-30 00:55:49,599 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:55:49,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2020-11-30 00:55:49,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1878. [2020-11-30 00:55:49,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1878 states. [2020-11-30 00:55:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1878 states to 1878 states and 6728 transitions. [2020-11-30 00:55:49,702 INFO L78 Accepts]: Start accepts. Automaton has 1878 states and 6728 transitions. Word has length 15 [2020-11-30 00:55:49,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:55:49,703 INFO L481 AbstractCegarLoop]: Abstraction has 1878 states and 6728 transitions. [2020-11-30 00:55:49,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:55:49,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1878 states and 6728 transitions. [2020-11-30 00:55:49,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-30 00:55:49,709 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:55:49,709 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:55:49,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 00:55:49,710 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-30 00:55:49,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:55:49,711 INFO L82 PathProgramCache]: Analyzing trace with hash -498850754, now seen corresponding path program 1 times [2020-11-30 00:55:49,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:55:49,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222664584] [2020-11-30 00:55:49,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:55:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:49,843 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-30 00:55:49,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222664584] [2020-11-30 00:55:49,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:55:49,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:55:49,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369062968] [2020-11-30 00:55:49,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:55:49,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:55:49,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:55:49,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:55:49,845 INFO L87 Difference]: Start difference. First operand 1878 states and 6728 transitions. Second operand 5 states. [2020-11-30 00:55:50,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:55:50,015 INFO L93 Difference]: Finished difference Result 2060 states and 7226 transitions. [2020-11-30 00:55:50,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:55:50,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-30 00:55:50,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:55:50,027 INFO L225 Difference]: With dead ends: 2060 [2020-11-30 00:55:50,027 INFO L226 Difference]: Without dead ends: 1850 [2020-11-30 00:55:50,028 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:55:50,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2020-11-30 00:55:50,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1850. [2020-11-30 00:55:50,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1850 states. [2020-11-30 00:55:50,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 6604 transitions. [2020-11-30 00:55:50,104 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 6604 transitions. Word has length 15 [2020-11-30 00:55:50,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:55:50,104 INFO L481 AbstractCegarLoop]: Abstraction has 1850 states and 6604 transitions. [2020-11-30 00:55:50,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:55:50,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 6604 transitions. [2020-11-30 00:55:50,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-30 00:55:50,109 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:55:50,109 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:55:50,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 00:55:50,109 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-30 00:55:50,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:55:50,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1722380032, now seen corresponding path program 1 times [2020-11-30 00:55:50,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:55:50,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970134103] [2020-11-30 00:55:50,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:55:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:50,275 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-30 00:55:50,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970134103] [2020-11-30 00:55:50,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:55:50,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:55:50,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819842130] [2020-11-30 00:55:50,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:55:50,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:55:50,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:55:50,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:55:50,277 INFO L87 Difference]: Start difference. First operand 1850 states and 6604 transitions. Second operand 6 states. [2020-11-30 00:55:50,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:55:50,478 INFO L93 Difference]: Finished difference Result 2142 states and 7492 transitions. [2020-11-30 00:55:50,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:55:50,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-30 00:55:50,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:55:50,491 INFO L225 Difference]: With dead ends: 2142 [2020-11-30 00:55:50,491 INFO L226 Difference]: Without dead ends: 1946 [2020-11-30 00:55:50,492 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:55:50,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2020-11-30 00:55:50,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1890. [2020-11-30 00:55:50,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1890 states. [2020-11-30 00:55:50,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 6684 transitions. [2020-11-30 00:55:50,572 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 6684 transitions. Word has length 16 [2020-11-30 00:55:50,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:55:50,572 INFO L481 AbstractCegarLoop]: Abstraction has 1890 states and 6684 transitions. [2020-11-30 00:55:50,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:55:50,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 6684 transitions. [2020-11-30 00:55:50,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-30 00:55:50,576 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:55:50,576 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:55:50,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 00:55:50,577 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-30 00:55:50,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:55:50,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1715409899, now seen corresponding path program 1 times [2020-11-30 00:55:50,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:55:50,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774261548] [2020-11-30 00:55:50,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:55:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:50,720 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-30 00:55:50,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774261548] [2020-11-30 00:55:50,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:55:50,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:55:50,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854589566] [2020-11-30 00:55:50,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:55:50,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:55:50,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:55:50,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:55:50,722 INFO L87 Difference]: Start difference. First operand 1890 states and 6684 transitions. Second operand 6 states. [2020-11-30 00:55:50,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:55:50,838 INFO L93 Difference]: Finished difference Result 2078 states and 7234 transitions. [2020-11-30 00:55:50,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:55:50,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-30 00:55:50,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:55:50,848 INFO L225 Difference]: With dead ends: 2078 [2020-11-30 00:55:50,848 INFO L226 Difference]: Without dead ends: 1938 [2020-11-30 00:55:50,849 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:55:50,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2020-11-30 00:55:50,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1938. [2020-11-30 00:55:50,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1938 states. [2020-11-30 00:55:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1938 states to 1938 states and 6824 transitions. [2020-11-30 00:55:50,927 INFO L78 Accepts]: Start accepts. Automaton has 1938 states and 6824 transitions. Word has length 16 [2020-11-30 00:55:50,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:55:50,927 INFO L481 AbstractCegarLoop]: Abstraction has 1938 states and 6824 transitions. [2020-11-30 00:55:50,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:55:50,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1938 states and 6824 transitions. [2020-11-30 00:55:50,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-30 00:55:50,931 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:55:50,931 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:55:50,932 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 00:55:50,932 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-30 00:55:50,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:55:50,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1558113419, now seen corresponding path program 2 times [2020-11-30 00:55:50,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:55:50,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895336041] [2020-11-30 00:55:50,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:55:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:51,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-30 00:55:51,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895336041] [2020-11-30 00:55:51,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:55:51,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:55:51,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994253706] [2020-11-30 00:55:51,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:55:51,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:55:51,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:55:51,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:55:51,118 INFO L87 Difference]: Start difference. First operand 1938 states and 6824 transitions. Second operand 7 states. [2020-11-30 00:55:51,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:55:51,271 INFO L93 Difference]: Finished difference Result 2022 states and 7014 transitions. [2020-11-30 00:55:51,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:55:51,273 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-11-30 00:55:51,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:55:51,281 INFO L225 Difference]: With dead ends: 2022 [2020-11-30 00:55:51,281 INFO L226 Difference]: Without dead ends: 1882 [2020-11-30 00:55:51,282 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:55:51,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2020-11-30 00:55:51,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1834. [2020-11-30 00:55:51,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1834 states. [2020-11-30 00:55:51,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 6464 transitions. [2020-11-30 00:55:51,359 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 6464 transitions. Word has length 16 [2020-11-30 00:55:51,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:55:51,359 INFO L481 AbstractCegarLoop]: Abstraction has 1834 states and 6464 transitions. [2020-11-30 00:55:51,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:55:51,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 6464 transitions. [2020-11-30 00:55:51,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-30 00:55:51,364 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:55:51,364 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:55:51,365 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 00:55:51,365 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-30 00:55:51,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:55:51,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1817459975, now seen corresponding path program 1 times [2020-11-30 00:55:51,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:55:51,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666209829] [2020-11-30 00:55:51,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:55:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:51,441 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-30 00:55:51,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666209829] [2020-11-30 00:55:51,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:55:51,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:55:51,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173740180] [2020-11-30 00:55:51,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:55:51,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:55:51,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:55:51,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:55:51,443 INFO L87 Difference]: Start difference. First operand 1834 states and 6464 transitions. Second operand 4 states. [2020-11-30 00:55:51,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:55:51,509 INFO L93 Difference]: Finished difference Result 1890 states and 6063 transitions. [2020-11-30 00:55:51,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:55:51,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-11-30 00:55:51,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:55:51,516 INFO L225 Difference]: With dead ends: 1890 [2020-11-30 00:55:51,516 INFO L226 Difference]: Without dead ends: 1458 [2020-11-30 00:55:51,517 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-30 00:55:51,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2020-11-30 00:55:51,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1458. [2020-11-30 00:55:51,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2020-11-30 00:55:51,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 4662 transitions. [2020-11-30 00:55:51,573 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 4662 transitions. Word has length 17 [2020-11-30 00:55:51,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:55:51,574 INFO L481 AbstractCegarLoop]: Abstraction has 1458 states and 4662 transitions. [2020-11-30 00:55:51,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:55:51,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 4662 transitions. [2020-11-30 00:55:51,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-30 00:55:51,578 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:55:51,578 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-30 00:55:51,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-30 00:55:51,579 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-30 00:55:51,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:55:51,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1047833445, now seen corresponding path program 1 times [2020-11-30 00:55:51,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:55:51,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375004723] [2020-11-30 00:55:51,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:55:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:51,659 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-30 00:55:51,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375004723] [2020-11-30 00:55:51,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:55:51,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:55:51,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678877251] [2020-11-30 00:55:51,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:55:51,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:55:51,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:55:51,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:55:51,661 INFO L87 Difference]: Start difference. First operand 1458 states and 4662 transitions. Second operand 5 states. [2020-11-30 00:55:51,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:55:51,733 INFO L93 Difference]: Finished difference Result 1227 states and 3554 transitions. [2020-11-30 00:55:51,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:55:51,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-11-30 00:55:51,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:55:51,737 INFO L225 Difference]: With dead ends: 1227 [2020-11-30 00:55:51,737 INFO L226 Difference]: Without dead ends: 948 [2020-11-30 00:55:51,738 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-30 00:55:51,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2020-11-30 00:55:51,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 948. [2020-11-30 00:55:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2020-11-30 00:55:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 2696 transitions. [2020-11-30 00:55:51,783 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 2696 transitions. Word has length 18 [2020-11-30 00:55:51,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:55:51,783 INFO L481 AbstractCegarLoop]: Abstraction has 948 states and 2696 transitions. [2020-11-30 00:55:51,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:55:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 2696 transitions. [2020-11-30 00:55:51,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-30 00:55:51,786 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:55:51,786 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-30 00:55:51,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-30 00:55:51,787 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-30 00:55:51,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:55:51,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1687389071, now seen corresponding path program 1 times [2020-11-30 00:55:51,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:55:51,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057752318] [2020-11-30 00:55:51,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:55:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:51,891 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-30 00:55:51,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057752318] [2020-11-30 00:55:51,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:55:51,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:55:51,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331258077] [2020-11-30 00:55:51,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:55:51,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:55:51,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:55:51,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:55:51,893 INFO L87 Difference]: Start difference. First operand 948 states and 2696 transitions. Second operand 7 states. [2020-11-30 00:55:52,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:55:52,012 INFO L93 Difference]: Finished difference Result 1459 states and 4060 transitions. [2020-11-30 00:55:52,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:55:52,013 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-11-30 00:55:52,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:55:52,016 INFO L225 Difference]: With dead ends: 1459 [2020-11-30 00:55:52,016 INFO L226 Difference]: Without dead ends: 1084 [2020-11-30 00:55:52,018 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-30 00:55:52,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2020-11-30 00:55:52,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1028. [2020-11-30 00:55:52,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2020-11-30 00:55:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 2860 transitions. [2020-11-30 00:55:52,050 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 2860 transitions. Word has length 20 [2020-11-30 00:55:52,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:55:52,051 INFO L481 AbstractCegarLoop]: Abstraction has 1028 states and 2860 transitions. [2020-11-30 00:55:52,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:55:52,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 2860 transitions. [2020-11-30 00:55:52,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-30 00:55:52,053 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:55:52,054 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-30 00:55:52,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 00:55:52,054 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-30 00:55:52,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:55:52,056 INFO L82 PathProgramCache]: Analyzing trace with hash -2081728408, now seen corresponding path program 1 times [2020-11-30 00:55:52,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:55:52,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000820143] [2020-11-30 00:55:52,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:55:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:52,136 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-30 00:55:52,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000820143] [2020-11-30 00:55:52,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:55:52,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:55:52,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605436115] [2020-11-30 00:55:52,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:55:52,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:55:52,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:55:52,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:55:52,138 INFO L87 Difference]: Start difference. First operand 1028 states and 2860 transitions. Second operand 4 states. [2020-11-30 00:55:52,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:55:52,181 INFO L93 Difference]: Finished difference Result 1513 states and 4017 transitions. [2020-11-30 00:55:52,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:55:52,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-11-30 00:55:52,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:55:52,185 INFO L225 Difference]: With dead ends: 1513 [2020-11-30 00:55:52,185 INFO L226 Difference]: Without dead ends: 1032 [2020-11-30 00:55:52,185 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-30 00:55:52,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2020-11-30 00:55:52,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 992. [2020-11-30 00:55:52,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2020-11-30 00:55:52,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 2591 transitions. [2020-11-30 00:55:52,222 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 2591 transitions. Word has length 20 [2020-11-30 00:55:52,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:55:52,222 INFO L481 AbstractCegarLoop]: Abstraction has 992 states and 2591 transitions. [2020-11-30 00:55:52,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:55:52,222 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 2591 transitions. [2020-11-30 00:55:52,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-30 00:55:52,228 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:55:52,229 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-30 00:55:52,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-30 00:55:52,229 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-30 00:55:52,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:55:52,229 INFO L82 PathProgramCache]: Analyzing trace with hash 219006172, now seen corresponding path program 1 times [2020-11-30 00:55:52,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:55:52,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929667119] [2020-11-30 00:55:52,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:55:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:52,319 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-30 00:55:52,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929667119] [2020-11-30 00:55:52,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:55:52,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:55:52,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324195364] [2020-11-30 00:55:52,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:55:52,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:55:52,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:55:52,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:55:52,321 INFO L87 Difference]: Start difference. First operand 992 states and 2591 transitions. Second operand 6 states. [2020-11-30 00:55:52,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:55:52,417 INFO L93 Difference]: Finished difference Result 838 states and 2119 transitions. [2020-11-30 00:55:52,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:55:52,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-11-30 00:55:52,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:55:52,421 INFO L225 Difference]: With dead ends: 838 [2020-11-30 00:55:52,421 INFO L226 Difference]: Without dead ends: 558 [2020-11-30 00:55:52,421 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-30 00:55:52,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-11-30 00:55:52,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 538. [2020-11-30 00:55:52,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2020-11-30 00:55:52,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 1302 transitions. [2020-11-30 00:55:52,443 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 1302 transitions. Word has length 20 [2020-11-30 00:55:52,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:55:52,443 INFO L481 AbstractCegarLoop]: Abstraction has 538 states and 1302 transitions. [2020-11-30 00:55:52,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:55:52,444 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 1302 transitions. [2020-11-30 00:55:52,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 00:55:52,446 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:55:52,446 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-30 00:55:52,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-30 00:55:52,447 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-30 00:55:52,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:55:52,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1284568559, now seen corresponding path program 1 times [2020-11-30 00:55:52,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:55:52,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956141356] [2020-11-30 00:55:52,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:55:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:52,747 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-30 00:55:52,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956141356] [2020-11-30 00:55:52,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:55:52,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 00:55:52,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089260520] [2020-11-30 00:55:52,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 00:55:52,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:55:52,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 00:55:52,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-30 00:55:52,749 INFO L87 Difference]: Start difference. First operand 538 states and 1302 transitions. Second operand 8 states. [2020-11-30 00:55:52,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:55:52,956 INFO L93 Difference]: Finished difference Result 646 states and 1513 transitions. [2020-11-30 00:55:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:55:52,957 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-11-30 00:55:52,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:55:52,959 INFO L225 Difference]: With dead ends: 646 [2020-11-30 00:55:52,959 INFO L226 Difference]: Without dead ends: 370 [2020-11-30 00:55:52,959 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-30 00:55:52,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2020-11-30 00:55:52,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 364. [2020-11-30 00:55:52,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2020-11-30 00:55:52,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 839 transitions. [2020-11-30 00:55:52,972 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 839 transitions. Word has length 23 [2020-11-30 00:55:52,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:55:52,972 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 839 transitions. [2020-11-30 00:55:52,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 00:55:52,972 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 839 transitions. [2020-11-30 00:55:52,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-30 00:55:52,974 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:55:52,974 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:55:52,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-30 00:55:52,974 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-30 00:55:52,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:55:52,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1492688256, now seen corresponding path program 1 times [2020-11-30 00:55:52,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:55:52,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114109534] [2020-11-30 00:55:52,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:55:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:55:53,081 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-30 00:55:53,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114109534] [2020-11-30 00:55:53,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:55:53,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 00:55:53,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91677945] [2020-11-30 00:55:53,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-30 00:55:53,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:55:53,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-30 00:55:53,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:55:53,083 INFO L87 Difference]: Start difference. First operand 364 states and 839 transitions. Second operand 7 states. [2020-11-30 00:55:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:55:53,192 INFO L93 Difference]: Finished difference Result 334 states and 780 transitions. [2020-11-30 00:55:53,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:55:53,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-11-30 00:55:53,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:55:53,193 INFO L225 Difference]: With dead ends: 334 [2020-11-30 00:55:53,194 INFO L226 Difference]: Without dead ends: 89 [2020-11-30 00:55:53,194 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-30 00:55:53,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-30 00:55:53,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2020-11-30 00:55:53,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-11-30 00:55:53,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 191 transitions. [2020-11-30 00:55:53,198 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 191 transitions. Word has length 23 [2020-11-30 00:55:53,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:55:53,199 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 191 transitions. [2020-11-30 00:55:53,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-30 00:55:53,199 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 191 transitions. [2020-11-30 00:55:53,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-30 00:55:53,200 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:55:53,200 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] [2020-11-30 00:55:53,200 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-30 00:55:53,201 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-30 00:55:53,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:55:53,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1849601120, now seen corresponding path program 1 times [2020-11-30 00:55:53,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:55:53,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038247775] [2020-11-30 00:55:53,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:55:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:55:53,278 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:55:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:55:53,333 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:55:53,399 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:55:53,400 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 00:55:53,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-30 00:55:53,432 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-30 00:55:53,433 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [795] [2020-11-30 00:55:53,435 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-30 00:55:53,435 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,436 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-30 00:55:53,436 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,436 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-30 00:55:53,436 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,436 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-30 00:55:53,436 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,437 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-30 00:55:53,437 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,437 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-30 00:55:53,437 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,438 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-30 00:55:53,438 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,438 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-30 00:55:53,438 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,438 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-30 00:55:53,438 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,439 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-30 00:55:53,439 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,440 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-30 00:55:53,440 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,440 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-30 00:55:53,440 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,440 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-30 00:55:53,440 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,441 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-30 00:55:53,441 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,441 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-30 00:55:53,441 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,441 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-30 00:55:53,441 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,442 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-30 00:55:53,442 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,442 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-30 00:55:53,442 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,442 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-30 00:55:53,443 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,443 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-30 00:55:53,443 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,443 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-30 00:55:53,443 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,443 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-30 00:55:53,443 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,444 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-30 00:55:53,444 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,444 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-30 00:55:53,444 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,444 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-30 00:55:53,444 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,445 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-30 00:55:53,445 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,445 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-30 00:55:53,445 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,445 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-30 00:55:53,445 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,445 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-30 00:55:53,446 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 12:55:53 BasicIcfg [2020-11-30 00:55:53,539 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 00:55:53,539 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:55:53,539 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:55:53,540 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:55:53,541 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:55:37" (3/4) ... [2020-11-30 00:55:53,548 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 00:55:53,578 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-30 00:55:53,579 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [795] [2020-11-30 00:55:53,583 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-30 00:55:53,584 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,584 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-30 00:55:53,584 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,584 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-30 00:55:53,584 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,584 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-30 00:55:53,584 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,585 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-30 00:55:53,585 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,585 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-30 00:55:53,585 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,585 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-30 00:55:53,586 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,586 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-30 00:55:53,586 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,586 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-30 00:55:53,586 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,586 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-30 00:55:53,586 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,588 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-30 00:55:53,588 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,588 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-30 00:55:53,588 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,588 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-30 00:55:53,589 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,589 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-30 00:55:53,589 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,589 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-30 00:55:53,589 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,589 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-30 00:55:53,589 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,590 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-30 00:55:53,590 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,590 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-30 00:55:53,590 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,590 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-30 00:55:53,590 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,591 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-30 00:55:53,591 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,591 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-30 00:55:53,591 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,591 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-30 00:55:53,591 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,592 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-30 00:55:53,592 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,592 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-30 00:55:53,592 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,592 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-30 00:55:53,592 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,592 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-30 00:55:53,593 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,593 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-30 00:55:53,593 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,593 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-30 00:55:53,593 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,593 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-30 00:55:53,593 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-30 00:55:53,717 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9f34c147-ba88-46be-b862-83f30f97fa78/bin/uautomizer/witness.graphml [2020-11-30 00:55:53,718 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:55:53,719 INFO L168 Benchmark]: Toolchain (without parser) took 20578.92 ms. Allocated memory was 79.7 MB in the beginning and 446.7 MB in the end (delta: 367.0 MB). Free memory was 48.1 MB in the beginning and 237.5 MB in the end (delta: -189.4 MB). Peak memory consumption was 177.8 MB. Max. memory is 16.1 GB. [2020-11-30 00:55:53,720 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 79.7 MB. Free memory was 39.3 MB in the beginning and 39.3 MB in the end (delta: 75.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:55:53,720 INFO L168 Benchmark]: CACSL2BoogieTranslator took 707.76 ms. Allocated memory was 79.7 MB in the beginning and 98.6 MB in the end (delta: 18.9 MB). Free memory was 47.7 MB in the beginning and 51.9 MB in the end (delta: -4.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-30 00:55:53,721 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.79 ms. Allocated memory is still 98.6 MB. Free memory was 51.9 MB in the beginning and 48.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 00:55:53,721 INFO L168 Benchmark]: Boogie Preprocessor took 41.97 ms. Allocated memory is still 98.6 MB. Free memory was 48.6 MB in the beginning and 46.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:55:53,722 INFO L168 Benchmark]: RCFGBuilder took 3079.68 ms. Allocated memory was 98.6 MB in the beginning and 123.7 MB in the end (delta: 25.2 MB). Free memory was 46.5 MB in the beginning and 92.7 MB in the end (delta: -46.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 16.1 GB. [2020-11-30 00:55:53,722 INFO L168 Benchmark]: TraceAbstraction took 16500.58 ms. Allocated memory was 123.7 MB in the beginning and 446.7 MB in the end (delta: 323.0 MB). Free memory was 92.7 MB in the beginning and 257.4 MB in the end (delta: -164.7 MB). Peak memory consumption was 158.2 MB. Max. memory is 16.1 GB. [2020-11-30 00:55:53,723 INFO L168 Benchmark]: Witness Printer took 178.52 ms. Allocated memory is still 446.7 MB. Free memory was 257.4 MB in the beginning and 237.5 MB in the end (delta: 19.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-30 00:55:53,725 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 79.7 MB. Free memory was 39.3 MB in the beginning and 39.3 MB in the end (delta: 75.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 707.76 ms. Allocated memory was 79.7 MB in the beginning and 98.6 MB in the end (delta: 18.9 MB). Free memory was 47.7 MB in the beginning and 51.9 MB in the end (delta: -4.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 62.79 ms. Allocated memory is still 98.6 MB. Free memory was 51.9 MB in the beginning and 48.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 41.97 ms. Allocated memory is still 98.6 MB. Free memory was 48.6 MB in the beginning and 46.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3079.68 ms. Allocated memory was 98.6 MB in the beginning and 123.7 MB in the end (delta: 25.2 MB). Free memory was 46.5 MB in the beginning and 92.7 MB in the end (delta: -46.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 16500.58 ms. Allocated memory was 123.7 MB in the beginning and 446.7 MB in the end (delta: 323.0 MB). Free memory was 92.7 MB in the beginning and 257.4 MB in the end (delta: -164.7 MB). Peak memory consumption was 158.2 MB. Max. memory is 16.1 GB. * Witness Printer took 178.52 ms. Allocated memory is still 446.7 MB. Free memory was 257.4 MB in the beginning and 237.5 MB in the end (delta: 19.9 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 1738 VarBasedMoverChecksPositive, 78 VarBasedMoverChecksNegative, 31 SemBasedMoverChecksPositive, 47 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 196 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.9s, 126 PlacesBefore, 45 PlacesAfterwards, 116 TransitionsBefore, 33 TransitionsAfterwards, 2622 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 98 TotalNumberOfCompositions, 6442 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_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1541; [L835] FCALL, FORK 0 pthread_create(&t1541, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0: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] [L836] 0 pthread_t t1542; [L837] FCALL, FORK 0 pthread_create(&t1542, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L838] 0 pthread_t t1543; [L839] FCALL, FORK 0 pthread_create(&t1543, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L840] 0 pthread_t t1544; [L841] FCALL, FORK 0 pthread_create(&t1544, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, 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] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L761] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L764] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L776] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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] [L779] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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] [L812] 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) [L812] 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) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 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 [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 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 [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L782] 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) [L782] 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) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 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 [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 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 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L847] 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) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] 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) [L847] 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) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 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 [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 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 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] 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) [L858] 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) [L859] 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)) [L859] EXPR 0 !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) [L859] 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)) [L859] 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)) [L860] 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)) [L860] 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)) [L861] 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)) [L861] 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)) [L862] 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)) [L862] 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)) [L863] 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)) [L863] EXPR 0 !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) [L863] EXPR 0 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_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L863] 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)) [L863] 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)) [L864] 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)) [L864] 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) [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L864] 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) [L864] 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)) [L864] 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)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix057_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, 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, 114 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.2s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.3s, HoareTripleCheckerStatistics: 737 SDtfs, 884 SDslu, 1406 SDs, 0 SdLazy, 524 SolverSat, 143 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3082occurred 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.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 530 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 335 NumberOfCodeBlocks, 335 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 31628 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...