./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix033_rmo.oepc.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_8efdf956-e477-424b-a74e-88716ffb9369/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_8efdf956-e477-424b-a74e-88716ffb9369/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8efdf956-e477-424b-a74e-88716ffb9369/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8efdf956-e477-424b-a74e-88716ffb9369/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_8efdf956-e477-424b-a74e-88716ffb9369/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8efdf956-e477-424b-a74e-88716ffb9369/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 955287d7843af804bba9e1dc002f9eefd7701e25 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-28 02:56:20,652 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 02:56:20,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 02:56:20,732 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 02:56:20,733 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 02:56:20,734 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 02:56:20,737 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 02:56:20,739 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 02:56:20,742 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 02:56:20,743 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 02:56:20,744 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 02:56:20,746 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 02:56:20,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 02:56:20,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 02:56:20,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 02:56:20,751 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 02:56:20,752 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 02:56:20,753 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 02:56:20,755 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 02:56:20,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 02:56:20,760 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 02:56:20,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 02:56:20,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 02:56:20,765 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 02:56:20,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 02:56:20,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 02:56:20,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 02:56:20,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 02:56:20,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 02:56:20,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 02:56:20,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 02:56:20,775 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 02:56:20,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 02:56:20,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 02:56:20,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 02:56:20,779 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 02:56:20,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 02:56:20,781 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 02:56:20,781 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 02:56:20,783 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 02:56:20,784 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 02:56:20,785 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8efdf956-e477-424b-a74e-88716ffb9369/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 02:56:20,807 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 02:56:20,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 02:56:20,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 02:56:20,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 02:56:20,809 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 02:56:20,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 02:56:20,810 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 02:56:20,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 02:56:20,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 02:56:20,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 02:56:20,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 02:56:20,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 02:56:20,812 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 02:56:20,812 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 02:56:20,813 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 02:56:20,813 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 02:56:20,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 02:56:20,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 02:56:20,814 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 02:56:20,814 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 02:56:20,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 02:56:20,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 02:56:20,815 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 02:56:20,815 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 02:56:20,815 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 02:56:20,815 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 02:56:20,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 02:56:20,816 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 02:56:20,816 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 02:56:20,816 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_8efdf956-e477-424b-a74e-88716ffb9369/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_8efdf956-e477-424b-a74e-88716ffb9369/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 -> 955287d7843af804bba9e1dc002f9eefd7701e25 [2020-11-28 02:56:21,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 02:56:21,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 02:56:21,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 02:56:21,097 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 02:56:21,102 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 02:56:21,103 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8efdf956-e477-424b-a74e-88716ffb9369/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix033_rmo.oepc.i [2020-11-28 02:56:21,184 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8efdf956-e477-424b-a74e-88716ffb9369/bin/uautomizer/data/1d4f64072/2d14d0cb5baa4d4fbf634e663d8f7cc7/FLAG8dc537b22 [2020-11-28 02:56:21,717 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 02:56:21,718 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8efdf956-e477-424b-a74e-88716ffb9369/sv-benchmarks/c/pthread-wmm/mix033_rmo.oepc.i [2020-11-28 02:56:21,735 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8efdf956-e477-424b-a74e-88716ffb9369/bin/uautomizer/data/1d4f64072/2d14d0cb5baa4d4fbf634e663d8f7cc7/FLAG8dc537b22 [2020-11-28 02:56:22,026 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8efdf956-e477-424b-a74e-88716ffb9369/bin/uautomizer/data/1d4f64072/2d14d0cb5baa4d4fbf634e663d8f7cc7 [2020-11-28 02:56:22,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 02:56:22,029 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 02:56:22,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 02:56:22,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 02:56:22,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 02:56:22,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:56:22" (1/1) ... [2020-11-28 02:56:22,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@584c2645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22, skipping insertion in model container [2020-11-28 02:56:22,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:56:22" (1/1) ... [2020-11-28 02:56:22,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 02:56:22,089 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 02:56:22,504 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 02:56:22,514 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 02:56:22,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 02:56:22,662 INFO L208 MainTranslator]: Completed translation [2020-11-28 02:56:22,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22 WrapperNode [2020-11-28 02:56:22,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 02:56:22,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 02:56:22,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 02:56:22,664 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 02:56:22,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22" (1/1) ... [2020-11-28 02:56:22,689 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22" (1/1) ... [2020-11-28 02:56:22,717 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 02:56:22,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 02:56:22,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 02:56:22,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 02:56:22,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22" (1/1) ... [2020-11-28 02:56:22,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22" (1/1) ... [2020-11-28 02:56:22,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22" (1/1) ... [2020-11-28 02:56:22,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22" (1/1) ... [2020-11-28 02:56:22,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22" (1/1) ... [2020-11-28 02:56:22,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22" (1/1) ... [2020-11-28 02:56:22,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22" (1/1) ... [2020-11-28 02:56:22,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 02:56:22,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 02:56:22,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 02:56:22,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 02:56:22,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8efdf956-e477-424b-a74e-88716ffb9369/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 02:56:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 02:56:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-28 02:56:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 02:56:22,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 02:56:22,864 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-28 02:56:22,865 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-28 02:56:22,866 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-28 02:56:22,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-28 02:56:22,866 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-28 02:56:22,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-28 02:56:22,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 02:56:22,867 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-28 02:56:22,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 02:56:22,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 02:56:22,869 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-28 02:56:25,644 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 02:56:25,644 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-28 02:56:25,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:56:25 BoogieIcfgContainer [2020-11-28 02:56:25,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 02:56:25,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 02:56:25,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 02:56:25,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 02:56:25,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:56:22" (1/3) ... [2020-11-28 02:56:25,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166bce24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:56:25, skipping insertion in model container [2020-11-28 02:56:25,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:56:22" (2/3) ... [2020-11-28 02:56:25,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166bce24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:56:25, skipping insertion in model container [2020-11-28 02:56:25,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:56:25" (3/3) ... [2020-11-28 02:56:25,657 INFO L111 eAbstractionObserver]: Analyzing ICFG mix033_rmo.oepc.i [2020-11-28 02:56:25,671 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-28 02:56:25,672 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 02:56:25,677 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-28 02:56:25,678 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-28 02:56:25,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,729 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,730 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,730 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,731 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,735 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,736 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,739 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,740 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,740 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,743 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,749 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,750 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,750 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,750 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,750 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,759 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,770 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,770 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,774 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,775 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,776 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,779 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,780 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,780 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,781 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,783 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,783 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 02:56:25,788 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-28 02:56:25,801 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-28 02:56:25,833 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 02:56:25,834 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 02:56:25,834 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 02:56:25,834 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 02:56:25,834 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 02:56:25,834 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 02:56:25,834 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 02:56:25,834 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 02:56:25,851 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-28 02:56:25,853 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 110 transitions, 235 flow [2020-11-28 02:56:25,856 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 110 transitions, 235 flow [2020-11-28 02:56:25,858 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 117 places, 110 transitions, 235 flow [2020-11-28 02:56:25,928 INFO L129 PetriNetUnfolder]: 3/107 cut-off events. [2020-11-28 02:56:25,929 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-28 02:56:25,934 INFO L80 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 3/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 87 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2020-11-28 02:56:25,940 INFO L116 LiptonReduction]: Number of co-enabled transitions 2262 [2020-11-28 02:56:26,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:26,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:26,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:26,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:26,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:26,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:26,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:26,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:26,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:26,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:26,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:26,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:26,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:26,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:26,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:26,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:26,690 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-11-28 02:56:26,710 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:26,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:26,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:26,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:26,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:26,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:26,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:26,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:26,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:26,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:26,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:26,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:26,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:26,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:26,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:26,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:26,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:26,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 02:56:26,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 02:56:26,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:27,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:27,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:27,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:56:27,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:27,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:27,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:27,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:56:27,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:27,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 02:56:27,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:27,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:27,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:27,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:27,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:27,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:27,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:27,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:27,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:27,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:27,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:27,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:27,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:27,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:27,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:27,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:27,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:27,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:27,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:27,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:27,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:27,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:27,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:27,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:56:27,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:27,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:27,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:27,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 02:56:27,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 02:56:27,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 02:56:27,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:27,478 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:27,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:27,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:27,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:27,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 02:56:27,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 02:56:27,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 02:56:27,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:27,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:27,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:27,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:27,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:27,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:27,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:27,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:27,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:27,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:27,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:27,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:27,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:27,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:27,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:27,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:27,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:27,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:27,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:27,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:27,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:27,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:27,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:27,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:27,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:27,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:27,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:27,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:27,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:27,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:27,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:27,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:27,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:28,684 WARN L193 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-28 02:56:28,823 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-28 02:56:28,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 02:56:28,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:28,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:28,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:28,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:28,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:28,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:28,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:28,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:28,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:28,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:28,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:28,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:28,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:28,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:28,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:28,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:28,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:29,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:29,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:29,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:29,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:29,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:29,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:29,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:29,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:29,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:29,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:29,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:29,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:29,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:29,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:29,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:29,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:29,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:29,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:29,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:29,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:29,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:29,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:29,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:29,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:29,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:29,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:29,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:29,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:29,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:29,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:29,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:29,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:29,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:29,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:29,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:29,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:29,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:29,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:29,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:29,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:29,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:29,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:29,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:29,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:29,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:29,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:29,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:29,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 02:56:29,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:29,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:29,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 02:56:29,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 02:56:29,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:29,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 02:56:29,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 02:56:29,884 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2020-11-28 02:56:31,238 WARN L193 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-11-28 02:56:31,439 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-11-28 02:56:31,445 INFO L131 LiptonReduction]: Checked pairs total: 6348 [2020-11-28 02:56:31,445 INFO L133 LiptonReduction]: Total number of compositions: 92 [2020-11-28 02:56:31,458 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 30 transitions, 75 flow [2020-11-28 02:56:31,561 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1382 states. [2020-11-28 02:56:31,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states. [2020-11-28 02:56:31,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-28 02:56:31,570 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:31,571 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-28 02:56:31,572 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:31,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:31,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1116122, now seen corresponding path program 1 times [2020-11-28 02:56:31,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:31,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734956043] [2020-11-28 02:56:31,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:31,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:31,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734956043] [2020-11-28 02:56:31,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:31,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 02:56:31,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606066280] [2020-11-28 02:56:31,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 02:56:31,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:31,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 02:56:31,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:56:31,916 INFO L87 Difference]: Start difference. First operand 1382 states. Second operand 3 states. [2020-11-28 02:56:32,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:32,035 INFO L93 Difference]: Finished difference Result 1152 states and 3742 transitions. [2020-11-28 02:56:32,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 02:56:32,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-11-28 02:56:32,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:32,069 INFO L225 Difference]: With dead ends: 1152 [2020-11-28 02:56:32,069 INFO L226 Difference]: Without dead ends: 972 [2020-11-28 02:56:32,071 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 02:56:32,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2020-11-28 02:56:32,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 972. [2020-11-28 02:56:32,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2020-11-28 02:56:32,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 3118 transitions. [2020-11-28 02:56:32,225 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 3118 transitions. Word has length 3 [2020-11-28 02:56:32,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:32,226 INFO L481 AbstractCegarLoop]: Abstraction has 972 states and 3118 transitions. [2020-11-28 02:56:32,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 02:56:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 3118 transitions. [2020-11-28 02:56:32,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-28 02:56:32,228 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:32,228 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:32,228 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 02:56:32,228 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:32,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:32,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1210671058, now seen corresponding path program 1 times [2020-11-28 02:56:32,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:32,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102429238] [2020-11-28 02:56:32,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:32,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102429238] [2020-11-28 02:56:32,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:32,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:56:32,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931502273] [2020-11-28 02:56:32,405 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 02:56:32,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:32,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 02:56:32,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:56:32,406 INFO L87 Difference]: Start difference. First operand 972 states and 3118 transitions. Second operand 5 states. [2020-11-28 02:56:32,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:32,533 INFO L93 Difference]: Finished difference Result 1032 states and 3186 transitions. [2020-11-28 02:56:32,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 02:56:32,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-11-28 02:56:32,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:32,548 INFO L225 Difference]: With dead ends: 1032 [2020-11-28 02:56:32,550 INFO L226 Difference]: Without dead ends: 852 [2020-11-28 02:56:32,551 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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-28 02:56:32,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2020-11-28 02:56:32,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 852. [2020-11-28 02:56:32,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2020-11-28 02:56:32,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 2682 transitions. [2020-11-28 02:56:32,608 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 2682 transitions. Word has length 10 [2020-11-28 02:56:32,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:32,613 INFO L481 AbstractCegarLoop]: Abstraction has 852 states and 2682 transitions. [2020-11-28 02:56:32,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 02:56:32,618 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 2682 transitions. [2020-11-28 02:56:32,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-28 02:56:32,628 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:32,629 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:32,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 02:56:32,629 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:32,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:32,635 INFO L82 PathProgramCache]: Analyzing trace with hash -480739296, now seen corresponding path program 1 times [2020-11-28 02:56:32,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:32,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256650573] [2020-11-28 02:56:32,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:32,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:32,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256650573] [2020-11-28 02:56:32,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:32,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:56:32,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457630805] [2020-11-28 02:56:32,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 02:56:32,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:32,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 02:56:32,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:56:32,771 INFO L87 Difference]: Start difference. First operand 852 states and 2682 transitions. Second operand 5 states. [2020-11-28 02:56:32,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:32,905 INFO L93 Difference]: Finished difference Result 892 states and 2724 transitions. [2020-11-28 02:56:32,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 02:56:32,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-28 02:56:32,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:32,913 INFO L225 Difference]: With dead ends: 892 [2020-11-28 02:56:32,913 INFO L226 Difference]: Without dead ends: 772 [2020-11-28 02:56:32,914 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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-28 02:56:32,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2020-11-28 02:56:32,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2020-11-28 02:56:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-11-28 02:56:32,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 2398 transitions. [2020-11-28 02:56:32,944 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 2398 transitions. Word has length 12 [2020-11-28 02:56:32,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:32,944 INFO L481 AbstractCegarLoop]: Abstraction has 772 states and 2398 transitions. [2020-11-28 02:56:32,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 02:56:32,944 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 2398 transitions. [2020-11-28 02:56:32,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-28 02:56:32,947 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:32,948 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:32,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 02:56:32,948 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:32,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:32,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1923614490, now seen corresponding path program 1 times [2020-11-28 02:56:32,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:32,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127343169] [2020-11-28 02:56:32,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:33,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:33,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127343169] [2020-11-28 02:56:33,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:33,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:56:33,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313135697] [2020-11-28 02:56:33,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:56:33,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:33,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:56:33,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:56:33,104 INFO L87 Difference]: Start difference. First operand 772 states and 2398 transitions. Second operand 4 states. [2020-11-28 02:56:33,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:33,152 INFO L93 Difference]: Finished difference Result 680 states and 1854 transitions. [2020-11-28 02:56:33,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:56:33,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-28 02:56:33,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:33,157 INFO L225 Difference]: With dead ends: 680 [2020-11-28 02:56:33,157 INFO L226 Difference]: Without dead ends: 500 [2020-11-28 02:56:33,158 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:56:33,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2020-11-28 02:56:33,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2020-11-28 02:56:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2020-11-28 02:56:33,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1310 transitions. [2020-11-28 02:56:33,175 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1310 transitions. Word has length 14 [2020-11-28 02:56:33,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:33,176 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 1310 transitions. [2020-11-28 02:56:33,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:56:33,176 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1310 transitions. [2020-11-28 02:56:33,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-28 02:56:33,177 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:33,178 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:33,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 02:56:33,178 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:33,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:33,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1933338747, now seen corresponding path program 1 times [2020-11-28 02:56:33,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:33,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248739499] [2020-11-28 02:56:33,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:33,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-28 02:56:33,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248739499] [2020-11-28 02:56:33,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:33,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 02:56:33,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030633348] [2020-11-28 02:56:33,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 02:56:33,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:33,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 02:56:33,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:56:33,389 INFO L87 Difference]: Start difference. First operand 500 states and 1310 transitions. Second operand 5 states. [2020-11-28 02:56:33,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:33,448 INFO L93 Difference]: Finished difference Result 384 states and 931 transitions. [2020-11-28 02:56:33,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 02:56:33,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-11-28 02:56:33,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:33,452 INFO L225 Difference]: With dead ends: 384 [2020-11-28 02:56:33,452 INFO L226 Difference]: Without dead ends: 304 [2020-11-28 02:56:33,452 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 02:56:33,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-11-28 02:56:33,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2020-11-28 02:56:33,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-11-28 02:56:33,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 722 transitions. [2020-11-28 02:56:33,462 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 722 transitions. Word has length 17 [2020-11-28 02:56:33,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:33,462 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 722 transitions. [2020-11-28 02:56:33,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 02:56:33,463 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 722 transitions. [2020-11-28 02:56:33,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-28 02:56:33,464 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:33,464 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:33,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 02:56:33,464 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:33,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:33,465 INFO L82 PathProgramCache]: Analyzing trace with hash -610165569, now seen corresponding path program 1 times [2020-11-28 02:56:33,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:33,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707138129] [2020-11-28 02:56:33,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:33,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:33,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707138129] [2020-11-28 02:56:33,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:33,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 02:56:33,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791455735] [2020-11-28 02:56:33,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 02:56:33,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:33,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 02:56:33,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:56:33,634 INFO L87 Difference]: Start difference. First operand 304 states and 722 transitions. Second operand 5 states. [2020-11-28 02:56:33,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:33,685 INFO L93 Difference]: Finished difference Result 417 states and 960 transitions. [2020-11-28 02:56:33,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 02:56:33,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-11-28 02:56:33,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:33,688 INFO L225 Difference]: With dead ends: 417 [2020-11-28 02:56:33,688 INFO L226 Difference]: Without dead ends: 310 [2020-11-28 02:56:33,688 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 02:56:33,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2020-11-28 02:56:33,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 304. [2020-11-28 02:56:33,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-11-28 02:56:33,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 695 transitions. [2020-11-28 02:56:33,700 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 695 transitions. Word has length 20 [2020-11-28 02:56:33,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:33,700 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 695 transitions. [2020-11-28 02:56:33,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 02:56:33,701 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 695 transitions. [2020-11-28 02:56:33,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-28 02:56:33,702 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:33,702 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:33,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 02:56:33,702 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:33,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:33,703 INFO L82 PathProgramCache]: Analyzing trace with hash 2032932377, now seen corresponding path program 2 times [2020-11-28 02:56:33,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:33,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304563434] [2020-11-28 02:56:33,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:33,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:33,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304563434] [2020-11-28 02:56:33,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:33,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 02:56:33,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640327097] [2020-11-28 02:56:33,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 02:56:33,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:33,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 02:56:33,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 02:56:33,876 INFO L87 Difference]: Start difference. First operand 304 states and 695 transitions. Second operand 6 states. [2020-11-28 02:56:33,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:33,942 INFO L93 Difference]: Finished difference Result 271 states and 628 transitions. [2020-11-28 02:56:33,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 02:56:33,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-11-28 02:56:33,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:33,944 INFO L225 Difference]: With dead ends: 271 [2020-11-28 02:56:33,944 INFO L226 Difference]: Without dead ends: 181 [2020-11-28 02:56:33,945 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-28 02:56:33,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-11-28 02:56:33,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2020-11-28 02:56:33,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-11-28 02:56:33,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 416 transitions. [2020-11-28 02:56:33,951 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 416 transitions. Word has length 20 [2020-11-28 02:56:33,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:33,951 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 416 transitions. [2020-11-28 02:56:33,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 02:56:33,951 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 416 transitions. [2020-11-28 02:56:33,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-28 02:56:33,952 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:33,953 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 02:56:33,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 02:56:33,953 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:33,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:33,953 INFO L82 PathProgramCache]: Analyzing trace with hash 999392263, now seen corresponding path program 1 times [2020-11-28 02:56:33,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:33,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951437320] [2020-11-28 02:56:33,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:34,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:34,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951437320] [2020-11-28 02:56:34,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:34,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 02:56:34,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013322982] [2020-11-28 02:56:34,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 02:56:34,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:34,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 02:56:34,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 02:56:34,095 INFO L87 Difference]: Start difference. First operand 181 states and 416 transitions. Second operand 4 states. [2020-11-28 02:56:34,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:34,121 INFO L93 Difference]: Finished difference Result 274 states and 620 transitions. [2020-11-28 02:56:34,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 02:56:34,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-11-28 02:56:34,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:34,123 INFO L225 Difference]: With dead ends: 274 [2020-11-28 02:56:34,123 INFO L226 Difference]: Without dead ends: 121 [2020-11-28 02:56:34,123 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 02:56:34,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-11-28 02:56:34,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2020-11-28 02:56:34,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-11-28 02:56:34,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 256 transitions. [2020-11-28 02:56:34,127 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 256 transitions. Word has length 24 [2020-11-28 02:56:34,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:34,129 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 256 transitions. [2020-11-28 02:56:34,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 02:56:34,129 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 256 transitions. [2020-11-28 02:56:34,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-28 02:56:34,130 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:34,130 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] [2020-11-28 02:56:34,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 02:56:34,130 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:34,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:34,131 INFO L82 PathProgramCache]: Analyzing trace with hash -2056504935, now seen corresponding path program 2 times [2020-11-28 02:56:34,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:34,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625593701] [2020-11-28 02:56:34,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:34,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625593701] [2020-11-28 02:56:34,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:34,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-28 02:56:34,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839215268] [2020-11-28 02:56:34,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-28 02:56:34,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:34,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-28 02:56:34,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-11-28 02:56:34,454 INFO L87 Difference]: Start difference. First operand 121 states and 256 transitions. Second operand 11 states. [2020-11-28 02:56:34,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:34,731 INFO L93 Difference]: Finished difference Result 142 states and 292 transitions. [2020-11-28 02:56:34,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-28 02:56:34,732 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-11-28 02:56:34,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:34,733 INFO L225 Difference]: With dead ends: 142 [2020-11-28 02:56:34,733 INFO L226 Difference]: Without dead ends: 121 [2020-11-28 02:56:34,734 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2020-11-28 02:56:34,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-11-28 02:56:34,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2020-11-28 02:56:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-11-28 02:56:34,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 255 transitions. [2020-11-28 02:56:34,738 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 255 transitions. Word has length 24 [2020-11-28 02:56:34,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:34,738 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 255 transitions. [2020-11-28 02:56:34,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-28 02:56:34,738 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 255 transitions. [2020-11-28 02:56:34,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-28 02:56:34,739 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:34,739 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] [2020-11-28 02:56:34,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 02:56:34,739 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:34,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:34,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1815605097, now seen corresponding path program 3 times [2020-11-28 02:56:34,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:34,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058149440] [2020-11-28 02:56:34,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 02:56:34,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 02:56:34,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058149440] [2020-11-28 02:56:34,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 02:56:34,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 02:56:34,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842167981] [2020-11-28 02:56:34,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-28 02:56:34,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 02:56:34,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-28 02:56:34,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-28 02:56:34,968 INFO L87 Difference]: Start difference. First operand 121 states and 255 transitions. Second operand 8 states. [2020-11-28 02:56:35,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 02:56:35,143 INFO L93 Difference]: Finished difference Result 139 states and 283 transitions. [2020-11-28 02:56:35,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-28 02:56:35,144 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-11-28 02:56:35,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 02:56:35,145 INFO L225 Difference]: With dead ends: 139 [2020-11-28 02:56:35,145 INFO L226 Difference]: Without dead ends: 69 [2020-11-28 02:56:35,145 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-28 02:56:35,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-11-28 02:56:35,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-11-28 02:56:35,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-11-28 02:56:35,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 120 transitions. [2020-11-28 02:56:35,147 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 120 transitions. Word has length 24 [2020-11-28 02:56:35,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 02:56:35,148 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 120 transitions. [2020-11-28 02:56:35,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-28 02:56:35,148 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 120 transitions. [2020-11-28 02:56:35,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-28 02:56:35,148 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 02:56:35,148 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] [2020-11-28 02:56:35,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 02:56:35,149 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 02:56:35,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 02:56:35,149 INFO L82 PathProgramCache]: Analyzing trace with hash -132837389, now seen corresponding path program 4 times [2020-11-28 02:56:35,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 02:56:35,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787397605] [2020-11-28 02:56:35,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 02:56:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:56:35,208 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:56:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 02:56:35,303 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 02:56:35,355 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 02:56:35,356 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 02:56:35,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 02:56:35,387 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,388 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [750] [2020-11-28 02:56:35,388 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,389 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,389 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,389 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,389 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,389 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,390 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,390 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,390 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,391 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,391 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,391 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,391 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,391 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,392 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,392 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,392 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,392 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,392 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,392 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,393 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,393 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,393 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,394 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,394 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,399 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,399 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,399 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,400 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,400 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,400 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,400 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,400 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,400 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,401 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,401 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,402 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,402 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,402 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,402 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,402 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,402 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,403 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,403 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,403 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,404 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,404 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,405 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,405 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,405 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,405 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,406 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,406 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,406 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:56:35 BasicIcfg [2020-11-28 02:56:35,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 02:56:35,504 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 02:56:35,504 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 02:56:35,505 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 02:56:35,505 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:56:25" (3/4) ... [2020-11-28 02:56:35,507 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 02:56:35,526 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,526 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [750] [2020-11-28 02:56:35,527 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,527 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,527 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,528 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,528 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,528 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,528 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,529 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,529 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,529 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,530 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,530 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,530 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,530 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,530 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,530 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,530 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,531 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,531 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,531 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,531 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,531 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,531 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,531 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,532 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,532 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,532 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,532 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,532 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,532 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,532 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,533 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,533 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,533 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,533 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,533 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,533 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,534 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,534 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,535 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,535 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,535 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,535 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,535 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,535 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,535 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,536 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,536 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 02:56:35,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 02:56:35,620 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8efdf956-e477-424b-a74e-88716ffb9369/bin/uautomizer/witness.graphml [2020-11-28 02:56:35,620 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 02:56:35,621 INFO L168 Benchmark]: Toolchain (without parser) took 13591.41 ms. Allocated memory was 104.9 MB in the beginning and 230.7 MB in the end (delta: 125.8 MB). Free memory was 76.4 MB in the beginning and 147.6 MB in the end (delta: -71.2 MB). Peak memory consumption was 54.6 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:35,621 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 104.9 MB. Free memory was 64.8 MB in the beginning and 64.7 MB in the end (delta: 76.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 02:56:35,622 INFO L168 Benchmark]: CACSL2BoogieTranslator took 631.82 ms. Allocated memory was 104.9 MB in the beginning and 125.8 MB in the end (delta: 21.0 MB). Free memory was 75.9 MB in the beginning and 78.3 MB in the end (delta: -2.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:35,622 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.88 ms. Allocated memory is still 125.8 MB. Free memory was 78.3 MB in the beginning and 75.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:35,623 INFO L168 Benchmark]: Boogie Preprocessor took 43.34 ms. Allocated memory is still 125.8 MB. Free memory was 75.6 MB in the beginning and 73.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:35,623 INFO L168 Benchmark]: RCFGBuilder took 2884.98 ms. Allocated memory was 125.8 MB in the beginning and 157.3 MB in the end (delta: 31.5 MB). Free memory was 73.0 MB in the beginning and 113.8 MB in the end (delta: -40.8 MB). Peak memory consumption was 41.0 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:35,623 INFO L168 Benchmark]: TraceAbstraction took 9855.42 ms. Allocated memory was 157.3 MB in the beginning and 230.7 MB in the end (delta: 73.4 MB). Free memory was 113.8 MB in the beginning and 169.7 MB in the end (delta: -55.9 MB). Peak memory consumption was 123.8 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:35,624 INFO L168 Benchmark]: Witness Printer took 115.79 ms. Allocated memory is still 230.7 MB. Free memory was 169.7 MB in the beginning and 147.6 MB in the end (delta: 22.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2020-11-28 02:56:35,626 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.24 ms. Allocated memory is still 104.9 MB. Free memory was 64.8 MB in the beginning and 64.7 MB in the end (delta: 76.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 631.82 ms. Allocated memory was 104.9 MB in the beginning and 125.8 MB in the end (delta: 21.0 MB). Free memory was 75.9 MB in the beginning and 78.3 MB in the end (delta: -2.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 53.88 ms. Allocated memory is still 125.8 MB. Free memory was 78.3 MB in the beginning and 75.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 43.34 ms. Allocated memory is still 125.8 MB. Free memory was 75.6 MB in the beginning and 73.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2884.98 ms. Allocated memory was 125.8 MB in the beginning and 157.3 MB in the end (delta: 31.5 MB). Free memory was 73.0 MB in the beginning and 113.8 MB in the end (delta: -40.8 MB). Peak memory consumption was 41.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9855.42 ms. Allocated memory was 157.3 MB in the beginning and 230.7 MB in the end (delta: 73.4 MB). Free memory was 113.8 MB in the beginning and 169.7 MB in the end (delta: -55.9 MB). Peak memory consumption was 123.8 MB. Max. memory is 16.1 GB. * Witness Printer took 115.79 ms. Allocated memory is still 230.7 MB. Free memory was 169.7 MB in the beginning and 147.6 MB in the end (delta: 22.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1512 VarBasedMoverChecksPositive, 61 VarBasedMoverChecksNegative, 11 SemBasedMoverChecksPositive, 50 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 134 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.5s, 117 PlacesBefore, 39 PlacesAfterwards, 110 TransitionsBefore, 30 TransitionsAfterwards, 2262 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 92 TotalNumberOfCompositions, 6348 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool b$flush_delayed; [L723] 0 int b$mem_tmp; [L724] 0 _Bool b$r_buff0_thd0; [L725] 0 _Bool b$r_buff0_thd1; [L726] 0 _Bool b$r_buff0_thd2; [L727] 0 _Bool b$r_buff0_thd3; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$read_delayed; [L733] 0 int *b$read_delayed_var; [L734] 0 int b$w_buff0; [L735] 0 _Bool b$w_buff0_used; [L736] 0 int b$w_buff1; [L737] 0 _Bool b$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t885; [L854] FCALL, FORK 0 pthread_create(&t885, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L855] 0 pthread_t t886; [L856] FCALL, FORK 0 pthread_create(&t886, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t887; [L858] FCALL, FORK 0 pthread_create(&t887, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 b$w_buff1 = b$w_buff0 [L752] 1 b$w_buff0 = 1 [L753] 1 b$w_buff1_used = b$w_buff0_used [L754] 1 b$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L756] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L757] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L758] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L759] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L760] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L780] 2 x = 2 [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L806] 3 z = 1 [L809] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 b$flush_delayed = weak$$choice2 [L818] 3 b$mem_tmp = b [L819] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L819] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L820] EXPR 3 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L820] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L821] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L821] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L822] EXPR 3 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L822] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L823] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 3 weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L824] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3) [L824] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L824] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3) [L824] EXPR 3 weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L824] 3 b$r_buff0_thd3 = weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L825] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 __unbuffered_p2_EBX = b [L827] EXPR 3 b$flush_delayed ? b$mem_tmp : b [L827] 3 b = b$flush_delayed ? b$mem_tmp : b [L828] 3 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L766] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L766] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L767] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L767] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L768] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L768] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L769] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L769] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L770] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L770] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L831] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L831] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b [L831] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L831] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L832] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L832] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L833] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L833] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L834] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L834] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L835] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L835] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L864] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L864] EXPR 0 b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b [L864] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L864] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L865] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L865] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L866] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L866] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L867] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L867] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L868] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L868] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L871] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix033_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 108 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.5s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 328 SDtfs, 427 SDslu, 760 SDs, 0 SdLazy, 346 SolverSat, 89 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1382occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 16233 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...