./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix052_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6d5ea3e6-060b-4473-8fa3-87435ebee93a/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_6d5ea3e6-060b-4473-8fa3-87435ebee93a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6d5ea3e6-060b-4473-8fa3-87435ebee93a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6d5ea3e6-060b-4473-8fa3-87435ebee93a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix052_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6d5ea3e6-060b-4473-8fa3-87435ebee93a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6d5ea3e6-060b-4473-8fa3-87435ebee93a/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 ee4beea982df7b76d65a9f7e76885ded8db7d259 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 21:09:56,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 21:09:56,892 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 21:09:56,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 21:09:56,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 21:09:56,964 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 21:09:56,966 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 21:09:56,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 21:09:56,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 21:09:56,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 21:09:56,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 21:09:56,994 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 21:09:56,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 21:09:56,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 21:09:57,001 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 21:09:57,003 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 21:09:57,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 21:09:57,013 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 21:09:57,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 21:09:57,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 21:09:57,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 21:09:57,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 21:09:57,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 21:09:57,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 21:09:57,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 21:09:57,033 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 21:09:57,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 21:09:57,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 21:09:57,035 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 21:09:57,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 21:09:57,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 21:09:57,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 21:09:57,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 21:09:57,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 21:09:57,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 21:09:57,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 21:09:57,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 21:09:57,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 21:09:57,043 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 21:09:57,044 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 21:09:57,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 21:09:57,047 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6d5ea3e6-060b-4473-8fa3-87435ebee93a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 21:09:57,089 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 21:09:57,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 21:09:57,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 21:09:57,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 21:09:57,095 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 21:09:57,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 21:09:57,096 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 21:09:57,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 21:09:57,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 21:09:57,096 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 21:09:57,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 21:09:57,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 21:09:57,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 21:09:57,098 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 21:09:57,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 21:09:57,099 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 21:09:57,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 21:09:57,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 21:09:57,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 21:09:57,100 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 21:09:57,100 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 21:09:57,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 21:09:57,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 21:09:57,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 21:09:57,101 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 21:09:57,101 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 21:09:57,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 21:09:57,101 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 21:09:57,102 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 21:09:57,102 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_6d5ea3e6-060b-4473-8fa3-87435ebee93a/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_6d5ea3e6-060b-4473-8fa3-87435ebee93a/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 -> ee4beea982df7b76d65a9f7e76885ded8db7d259 [2020-11-29 21:09:57,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 21:09:57,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 21:09:57,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 21:09:57,411 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 21:09:57,412 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 21:09:57,413 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6d5ea3e6-060b-4473-8fa3-87435ebee93a/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix052_pso.opt.i [2020-11-29 21:09:57,489 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6d5ea3e6-060b-4473-8fa3-87435ebee93a/bin/uautomizer/data/ca1361be3/aa9cfc2076b6474a8f17c208c25f8775/FLAG394ce13db [2020-11-29 21:09:58,023 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 21:09:58,024 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6d5ea3e6-060b-4473-8fa3-87435ebee93a/sv-benchmarks/c/pthread-wmm/mix052_pso.opt.i [2020-11-29 21:09:58,040 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6d5ea3e6-060b-4473-8fa3-87435ebee93a/bin/uautomizer/data/ca1361be3/aa9cfc2076b6474a8f17c208c25f8775/FLAG394ce13db [2020-11-29 21:09:58,305 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6d5ea3e6-060b-4473-8fa3-87435ebee93a/bin/uautomizer/data/ca1361be3/aa9cfc2076b6474a8f17c208c25f8775 [2020-11-29 21:09:58,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 21:09:58,309 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 21:09:58,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 21:09:58,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 21:09:58,316 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 21:09:58,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 09:09:58" (1/1) ... [2020-11-29 21:09:58,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@757291f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:09:58, skipping insertion in model container [2020-11-29 21:09:58,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 09:09:58" (1/1) ... [2020-11-29 21:09:58,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 21:09:58,407 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 21:09:58,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 21:09:58,777 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 21:09:58,831 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 21:09:58,927 INFO L208 MainTranslator]: Completed translation [2020-11-29 21:09:58,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:09:58 WrapperNode [2020-11-29 21:09:58,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 21:09:58,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 21:09:58,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 21:09:58,930 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 21:09:58,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:09:58" (1/1) ... [2020-11-29 21:09:58,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:09:58" (1/1) ... [2020-11-29 21:09:59,027 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 21:09:59,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 21:09:59,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 21:09:59,028 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 21:09:59,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:09:58" (1/1) ... [2020-11-29 21:09:59,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:09:58" (1/1) ... [2020-11-29 21:09:59,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:09:58" (1/1) ... [2020-11-29 21:09:59,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:09:58" (1/1) ... [2020-11-29 21:09:59,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:09:58" (1/1) ... [2020-11-29 21:09:59,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:09:58" (1/1) ... [2020-11-29 21:09:59,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:09:58" (1/1) ... [2020-11-29 21:09:59,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 21:09:59,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 21:09:59,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 21:09:59,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 21:09:59,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:09:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d5ea3e6-060b-4473-8fa3-87435ebee93a/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 21:09:59,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 21:09:59,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-29 21:09:59,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 21:09:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 21:09:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-29 21:09:59,201 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-29 21:09:59,202 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-29 21:09:59,202 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-29 21:09:59,202 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-29 21:09:59,203 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-29 21:09:59,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 21:09:59,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-29 21:09:59,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 21:09:59,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 21:09:59,205 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-29 21:10:01,519 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 21:10:01,519 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-29 21:10:01,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 09:10:01 BoogieIcfgContainer [2020-11-29 21:10:01,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 21:10:01,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 21:10:01,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 21:10:01,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 21:10:01,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 09:09:58" (1/3) ... [2020-11-29 21:10:01,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@122f9ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 09:10:01, skipping insertion in model container [2020-11-29 21:10:01,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:09:58" (2/3) ... [2020-11-29 21:10:01,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@122f9ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 09:10:01, skipping insertion in model container [2020-11-29 21:10:01,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 09:10:01" (3/3) ... [2020-11-29 21:10:01,530 INFO L111 eAbstractionObserver]: Analyzing ICFG mix052_pso.opt.i [2020-11-29 21:10:01,544 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-29 21:10:01,544 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 21:10:01,548 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-29 21:10:01,549 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-29 21:10:01,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,589 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,589 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,590 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,590 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,618 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,619 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,620 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,620 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,621 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,622 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,624 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,624 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,624 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,628 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,629 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,629 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,629 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,631 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,631 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,632 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,632 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,635 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,635 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,636 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,637 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,637 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,638 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,640 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,641 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,642 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,646 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,646 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,646 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,646 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 21:10:01,649 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-29 21:10:01,661 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-29 21:10:01,693 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 21:10:01,694 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 21:10:01,694 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 21:10:01,694 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 21:10:01,694 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 21:10:01,694 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 21:10:01,694 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 21:10:01,694 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 21:10:01,712 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-29 21:10:01,714 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 100 transitions, 215 flow [2020-11-29 21:10:01,717 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 100 transitions, 215 flow [2020-11-29 21:10:01,719 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 107 places, 100 transitions, 215 flow [2020-11-29 21:10:01,782 INFO L129 PetriNetUnfolder]: 3/97 cut-off events. [2020-11-29 21:10:01,782 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-29 21:10:01,789 INFO L80 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2020-11-29 21:10:01,794 INFO L116 LiptonReduction]: Number of co-enabled transitions 1648 [2020-11-29 21:10:02,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 21:10:02,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:10:02,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-29 21:10:02,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:10:02,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-29 21:10:02,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:10:02,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 21:10:02,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 21:10:02,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 21:10:02,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:10:02,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 21:10:02,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 21:10:02,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 21:10:02,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 21:10:02,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 21:10:02,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 21:10:02,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 21:10:02,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 21:10:02,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 21:10:02,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:10:02,405 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-29 21:10:02,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:10:02,407 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-29 21:10:02,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:10:02,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 21:10:02,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:10:02,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 21:10:02,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:10:02,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 21:10:02,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:10:02,982 WARN L193 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-29 21:10:03,105 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-29 21:10:03,426 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-11-29 21:10:03,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 21:10:03,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 21:10:03,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 21:10:03,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 21:10:03,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 21:10:03,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 21:10:03,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 21:10:03,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 21:10:03,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 21:10:03,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:10:03,533 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-29 21:10:03,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:10:03,536 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-29 21:10:03,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:10:03,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 21:10:03,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 21:10:03,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 21:10:03,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:10:03,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 21:10:03,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:10:03,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-29 21:10:03,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:10:03,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-29 21:10:03,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:10:04,027 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-29 21:10:04,152 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-29 21:10:04,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 21:10:04,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 21:10:04,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 21:10:04,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 21:10:04,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 21:10:04,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 21:10:04,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 21:10:04,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 21:10:04,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 21:10:04,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:10:04,726 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-29 21:10:04,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:10:04,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 21:10:04,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:10:04,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 21:10:04,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 21:10:04,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 21:10:04,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 21:10:04,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 21:10:04,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 21:10:04,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 21:10:04,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 21:10:04,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 21:10:04,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 21:10:04,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 21:10:04,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 21:10:04,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 21:10:04,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 21:10:04,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 21:10:04,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 21:10:04,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 21:10:04,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:10:04,917 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-29 21:10:04,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:10:04,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 21:10:04,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 21:10:05,611 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2020-11-29 21:10:06,270 WARN L193 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-11-29 21:10:06,473 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-11-29 21:10:06,479 INFO L131 LiptonReduction]: Checked pairs total: 4223 [2020-11-29 21:10:06,479 INFO L133 LiptonReduction]: Total number of compositions: 91 [2020-11-29 21:10:06,491 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 67 flow [2020-11-29 21:10:06,551 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 618 states. [2020-11-29 21:10:06,553 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states. [2020-11-29 21:10:06,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-29 21:10:06,560 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:10:06,561 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:10:06,561 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 21:10:06,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:10:06,567 INFO L82 PathProgramCache]: Analyzing trace with hash -110011762, now seen corresponding path program 1 times [2020-11-29 21:10:06,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:10:06,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392287854] [2020-11-29 21:10:06,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:10:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:10:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 21:10:06,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392287854] [2020-11-29 21:10:06,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:10:06,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-29 21:10:06,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450899925] [2020-11-29 21:10:06,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 21:10:06,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:10:06,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 21:10:06,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 21:10:06,898 INFO L87 Difference]: Start difference. First operand 618 states. Second operand 3 states. [2020-11-29 21:10:07,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:10:07,014 INFO L93 Difference]: Finished difference Result 522 states and 1600 transitions. [2020-11-29 21:10:07,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 21:10:07,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-29 21:10:07,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:10:07,037 INFO L225 Difference]: With dead ends: 522 [2020-11-29 21:10:07,037 INFO L226 Difference]: Without dead ends: 442 [2020-11-29 21:10:07,038 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 21:10:07,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-11-29 21:10:07,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2020-11-29 21:10:07,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-11-29 21:10:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1336 transitions. [2020-11-29 21:10:07,131 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1336 transitions. Word has length 7 [2020-11-29 21:10:07,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:10:07,132 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 1336 transitions. [2020-11-29 21:10:07,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 21:10:07,143 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1336 transitions. [2020-11-29 21:10:07,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-29 21:10:07,145 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:10:07,145 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:10:07,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 21:10:07,146 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 21:10:07,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:10:07,146 INFO L82 PathProgramCache]: Analyzing trace with hash -298537635, now seen corresponding path program 1 times [2020-11-29 21:10:07,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:10:07,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318506649] [2020-11-29 21:10:07,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:10:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:10:07,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 21:10:07,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318506649] [2020-11-29 21:10:07,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:10:07,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 21:10:07,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220841703] [2020-11-29 21:10:07,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 21:10:07,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:10:07,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 21:10:07,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 21:10:07,296 INFO L87 Difference]: Start difference. First operand 442 states and 1336 transitions. Second operand 4 states. [2020-11-29 21:10:07,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:10:07,343 INFO L93 Difference]: Finished difference Result 502 states and 1454 transitions. [2020-11-29 21:10:07,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 21:10:07,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-29 21:10:07,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:10:07,349 INFO L225 Difference]: With dead ends: 502 [2020-11-29 21:10:07,349 INFO L226 Difference]: Without dead ends: 422 [2020-11-29 21:10:07,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 21:10:07,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2020-11-29 21:10:07,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2020-11-29 21:10:07,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2020-11-29 21:10:07,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1260 transitions. [2020-11-29 21:10:07,386 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1260 transitions. Word has length 10 [2020-11-29 21:10:07,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:10:07,387 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 1260 transitions. [2020-11-29 21:10:07,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 21:10:07,388 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1260 transitions. [2020-11-29 21:10:07,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-29 21:10:07,391 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:10:07,391 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:10:07,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 21:10:07,392 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 21:10:07,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:10:07,397 INFO L82 PathProgramCache]: Analyzing trace with hash -664654492, now seen corresponding path program 1 times [2020-11-29 21:10:07,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:10:07,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071169818] [2020-11-29 21:10:07,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:10:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:10:07,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 21:10:07,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071169818] [2020-11-29 21:10:07,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:10:07,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 21:10:07,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156030068] [2020-11-29 21:10:07,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 21:10:07,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:10:07,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 21:10:07,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 21:10:07,515 INFO L87 Difference]: Start difference. First operand 422 states and 1260 transitions. Second operand 4 states. [2020-11-29 21:10:07,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:10:07,566 INFO L93 Difference]: Finished difference Result 374 states and 968 transitions. [2020-11-29 21:10:07,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 21:10:07,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-29 21:10:07,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:10:07,570 INFO L225 Difference]: With dead ends: 374 [2020-11-29 21:10:07,570 INFO L226 Difference]: Without dead ends: 294 [2020-11-29 21:10:07,570 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 21:10:07,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-11-29 21:10:07,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2020-11-29 21:10:07,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2020-11-29 21:10:07,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 748 transitions. [2020-11-29 21:10:07,604 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 748 transitions. Word has length 11 [2020-11-29 21:10:07,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:10:07,606 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 748 transitions. [2020-11-29 21:10:07,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 21:10:07,607 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 748 transitions. [2020-11-29 21:10:07,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-29 21:10:07,612 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:10:07,612 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:10:07,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 21:10:07,613 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 21:10:07,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:10:07,613 INFO L82 PathProgramCache]: Analyzing trace with hash 920296798, now seen corresponding path program 1 times [2020-11-29 21:10:07,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:10:07,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301070263] [2020-11-29 21:10:07,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:10:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:10:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 21:10:07,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301070263] [2020-11-29 21:10:07,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:10:07,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 21:10:07,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791668690] [2020-11-29 21:10:07,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 21:10:07,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:10:07,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 21:10:07,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 21:10:07,722 INFO L87 Difference]: Start difference. First operand 294 states and 748 transitions. Second operand 4 states. [2020-11-29 21:10:07,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:10:07,749 INFO L93 Difference]: Finished difference Result 442 states and 1066 transitions. [2020-11-29 21:10:07,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 21:10:07,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-29 21:10:07,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:10:07,752 INFO L225 Difference]: With dead ends: 442 [2020-11-29 21:10:07,753 INFO L226 Difference]: Without dead ends: 310 [2020-11-29 21:10:07,753 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 21:10:07,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2020-11-29 21:10:07,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 282. [2020-11-29 21:10:07,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-11-29 21:10:07,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 679 transitions. [2020-11-29 21:10:07,764 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 679 transitions. Word has length 13 [2020-11-29 21:10:07,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:10:07,764 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 679 transitions. [2020-11-29 21:10:07,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 21:10:07,764 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 679 transitions. [2020-11-29 21:10:07,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-29 21:10:07,765 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:10:07,766 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:10:07,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 21:10:07,766 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 21:10:07,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:10:07,766 INFO L82 PathProgramCache]: Analyzing trace with hash 296841996, now seen corresponding path program 1 times [2020-11-29 21:10:07,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:10:07,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445734695] [2020-11-29 21:10:07,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:10:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:10:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 21:10:07,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445734695] [2020-11-29 21:10:07,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:10:07,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 21:10:07,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990636569] [2020-11-29 21:10:07,925 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 21:10:07,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:10:07,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 21:10:07,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 21:10:07,926 INFO L87 Difference]: Start difference. First operand 282 states and 679 transitions. Second operand 5 states. [2020-11-29 21:10:08,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:10:08,006 INFO L93 Difference]: Finished difference Result 208 states and 439 transitions. [2020-11-29 21:10:08,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 21:10:08,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-29 21:10:08,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:10:08,011 INFO L225 Difference]: With dead ends: 208 [2020-11-29 21:10:08,011 INFO L226 Difference]: Without dead ends: 164 [2020-11-29 21:10:08,011 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 21:10:08,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-11-29 21:10:08,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2020-11-29 21:10:08,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-11-29 21:10:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 337 transitions. [2020-11-29 21:10:08,016 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 337 transitions. Word has length 13 [2020-11-29 21:10:08,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:10:08,017 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 337 transitions. [2020-11-29 21:10:08,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 21:10:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 337 transitions. [2020-11-29 21:10:08,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-29 21:10:08,017 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:10:08,018 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 21:10:08,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 21:10:08,018 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 21:10:08,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:10:08,018 INFO L82 PathProgramCache]: Analyzing trace with hash 939915115, now seen corresponding path program 1 times [2020-11-29 21:10:08,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:10:08,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232001969] [2020-11-29 21:10:08,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:10:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:10:08,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 21:10:08,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232001969] [2020-11-29 21:10:08,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:10:08,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 21:10:08,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349385906] [2020-11-29 21:10:08,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 21:10:08,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:10:08,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 21:10:08,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 21:10:08,222 INFO L87 Difference]: Start difference. First operand 164 states and 337 transitions. Second operand 6 states. [2020-11-29 21:10:08,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:10:08,307 INFO L93 Difference]: Finished difference Result 137 states and 282 transitions. [2020-11-29 21:10:08,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 21:10:08,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-29 21:10:08,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:10:08,308 INFO L225 Difference]: With dead ends: 137 [2020-11-29 21:10:08,308 INFO L226 Difference]: Without dead ends: 84 [2020-11-29 21:10:08,308 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-29 21:10:08,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-11-29 21:10:08,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-11-29 21:10:08,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-29 21:10:08,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 164 transitions. [2020-11-29 21:10:08,312 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 164 transitions. Word has length 16 [2020-11-29 21:10:08,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:10:08,312 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 164 transitions. [2020-11-29 21:10:08,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 21:10:08,312 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 164 transitions. [2020-11-29 21:10:08,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-29 21:10:08,313 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:10:08,313 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-29 21:10:08,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-29 21:10:08,314 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 21:10:08,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:10:08,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1339725488, now seen corresponding path program 1 times [2020-11-29 21:10:08,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:10:08,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460200593] [2020-11-29 21:10:08,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:10:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:10:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 21:10:08,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460200593] [2020-11-29 21:10:08,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:10:08,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-29 21:10:08,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354854311] [2020-11-29 21:10:08,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-29 21:10:08,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:10:08,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-29 21:10:08,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-11-29 21:10:08,562 INFO L87 Difference]: Start difference. First operand 84 states and 164 transitions. Second operand 10 states. [2020-11-29 21:10:08,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:10:08,796 INFO L93 Difference]: Finished difference Result 136 states and 250 transitions. [2020-11-29 21:10:08,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-29 21:10:08,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-11-29 21:10:08,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:10:08,800 INFO L225 Difference]: With dead ends: 136 [2020-11-29 21:10:08,800 INFO L226 Difference]: Without dead ends: 88 [2020-11-29 21:10:08,801 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-11-29 21:10:08,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-11-29 21:10:08,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2020-11-29 21:10:08,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-11-29 21:10:08,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 156 transitions. [2020-11-29 21:10:08,804 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 156 transitions. Word has length 20 [2020-11-29 21:10:08,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:10:08,804 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 156 transitions. [2020-11-29 21:10:08,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-29 21:10:08,804 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 156 transitions. [2020-11-29 21:10:08,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-29 21:10:08,804 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:10:08,805 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-29 21:10:08,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-29 21:10:08,805 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 21:10:08,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:10:08,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2019359054, now seen corresponding path program 2 times [2020-11-29 21:10:08,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:10:08,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566951044] [2020-11-29 21:10:08,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:10:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:10:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 21:10:08,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566951044] [2020-11-29 21:10:08,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:10:08,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 21:10:08,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793431905] [2020-11-29 21:10:08,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 21:10:08,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:10:08,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 21:10:08,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 21:10:08,904 INFO L87 Difference]: Start difference. First operand 84 states and 156 transitions. Second operand 5 states. [2020-11-29 21:10:08,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:10:08,944 INFO L93 Difference]: Finished difference Result 90 states and 161 transitions. [2020-11-29 21:10:08,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 21:10:08,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-11-29 21:10:08,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:10:08,945 INFO L225 Difference]: With dead ends: 90 [2020-11-29 21:10:08,945 INFO L226 Difference]: Without dead ends: 42 [2020-11-29 21:10:08,945 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-29 21:10:08,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-29 21:10:08,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-29 21:10:08,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-29 21:10:08,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 68 transitions. [2020-11-29 21:10:08,947 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 68 transitions. Word has length 20 [2020-11-29 21:10:08,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:10:08,947 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 68 transitions. [2020-11-29 21:10:08,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 21:10:08,948 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 68 transitions. [2020-11-29 21:10:08,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-29 21:10:08,948 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:10:08,948 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-29 21:10:08,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 21:10:08,948 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 21:10:08,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:10:08,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1489291194, now seen corresponding path program 3 times [2020-11-29 21:10:08,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:10:08,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572189241] [2020-11-29 21:10:08,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:10:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:10:09,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 21:10:09,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572189241] [2020-11-29 21:10:09,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:10:09,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-29 21:10:09,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008233375] [2020-11-29 21:10:09,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-29 21:10:09,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:10:09,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-29 21:10:09,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-11-29 21:10:09,322 INFO L87 Difference]: Start difference. First operand 42 states and 68 transitions. Second operand 11 states. [2020-11-29 21:10:09,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:10:09,709 INFO L93 Difference]: Finished difference Result 62 states and 93 transitions. [2020-11-29 21:10:09,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-29 21:10:09,710 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2020-11-29 21:10:09,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:10:09,711 INFO L225 Difference]: With dead ends: 62 [2020-11-29 21:10:09,711 INFO L226 Difference]: Without dead ends: 34 [2020-11-29 21:10:09,711 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2020-11-29 21:10:09,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-11-29 21:10:09,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-11-29 21:10:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-11-29 21:10:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2020-11-29 21:10:09,713 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 20 [2020-11-29 21:10:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:10:09,713 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2020-11-29 21:10:09,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-29 21:10:09,713 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2020-11-29 21:10:09,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-29 21:10:09,713 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:10:09,713 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-29 21:10:09,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 21:10:09,714 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 21:10:09,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:10:09,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1283422144, now seen corresponding path program 4 times [2020-11-29 21:10:09,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:10:09,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315403366] [2020-11-29 21:10:09,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:10:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 21:10:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 21:10:09,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315403366] [2020-11-29 21:10:09,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 21:10:09,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 21:10:09,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838247752] [2020-11-29 21:10:09,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 21:10:09,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 21:10:09,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 21:10:09,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-29 21:10:09,891 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 6 states. [2020-11-29 21:10:09,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 21:10:09,971 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-11-29 21:10:09,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 21:10:09,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-11-29 21:10:09,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 21:10:09,972 INFO L225 Difference]: With dead ends: 41 [2020-11-29 21:10:09,973 INFO L226 Difference]: Without dead ends: 30 [2020-11-29 21:10:09,973 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-29 21:10:09,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-11-29 21:10:09,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-11-29 21:10:09,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-11-29 21:10:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2020-11-29 21:10:09,974 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 20 [2020-11-29 21:10:09,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 21:10:09,974 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2020-11-29 21:10:09,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 21:10:09,975 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2020-11-29 21:10:09,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-29 21:10:09,975 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 21:10:09,975 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-29 21:10:09,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-29 21:10:09,975 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 21:10:09,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 21:10:09,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1282896810, now seen corresponding path program 5 times [2020-11-29 21:10:09,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 21:10:09,976 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821474133] [2020-11-29 21:10:09,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 21:10:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:10:10,028 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:10:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 21:10:10,093 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 21:10:10,138 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 21:10:10,139 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 21:10:10,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 21:10:10,179 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,180 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [785] [2020-11-29 21:10:10,182 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,183 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,183 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,183 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,184 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,184 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,185 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,185 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,185 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,185 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,185 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,186 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,186 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,186 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,187 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,187 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,187 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,187 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,187 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,187 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,188 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,193 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,193 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,193 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,194 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,194 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,194 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,194 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,194 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,194 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,194 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,195 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,195 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 09:10:10 BasicIcfg [2020-11-29 21:10:10,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 21:10:10,272 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 21:10:10,272 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 21:10:10,272 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 21:10:10,273 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 09:10:01" (3/4) ... [2020-11-29 21:10:10,274 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 21:10:10,289 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,289 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [785] [2020-11-29 21:10:10,290 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,290 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,290 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,290 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,290 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,290 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,290 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,290 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,291 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,291 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,291 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,291 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,291 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,291 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,291 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,292 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,292 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,292 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,292 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,292 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,292 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,292 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,292 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,293 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,293 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,293 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,293 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,293 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,293 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,293 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,294 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,294 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,294 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,294 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,294 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,294 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,294 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,295 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,295 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,295 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,295 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 21:10:10,295 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 21:10:10,386 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6d5ea3e6-060b-4473-8fa3-87435ebee93a/bin/uautomizer/witness.graphml [2020-11-29 21:10:10,386 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 21:10:10,387 INFO L168 Benchmark]: Toolchain (without parser) took 12078.13 ms. Allocated memory was 86.0 MB in the beginning and 197.1 MB in the end (delta: 111.1 MB). Free memory was 49.3 MB in the beginning and 139.2 MB in the end (delta: -89.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 16.1 GB. [2020-11-29 21:10:10,387 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 86.0 MB. Free memory was 67.0 MB in the beginning and 67.0 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 21:10:10,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 617.12 ms. Allocated memory is still 86.0 MB. Free memory was 49.1 MB in the beginning and 40.3 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.5 MB. Max. memory is 16.1 GB. [2020-11-29 21:10:10,388 INFO L168 Benchmark]: Boogie Procedure Inliner took 97.19 ms. Allocated memory is still 86.0 MB. Free memory was 40.3 MB in the beginning and 37.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 21:10:10,389 INFO L168 Benchmark]: Boogie Preprocessor took 53.60 ms. Allocated memory is still 86.0 MB. Free memory was 37.8 MB in the beginning and 35.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 21:10:10,389 INFO L168 Benchmark]: RCFGBuilder took 2426.03 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 35.8 MB in the beginning and 39.2 MB in the end (delta: -3.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 16.1 GB. [2020-11-29 21:10:10,390 INFO L168 Benchmark]: TraceAbstraction took 8749.28 ms. Allocated memory was 104.9 MB in the beginning and 197.1 MB in the end (delta: 92.3 MB). Free memory was 38.4 MB in the beginning and 156.0 MB in the end (delta: -117.6 MB). Peak memory consumption was 76.9 MB. Max. memory is 16.1 GB. [2020-11-29 21:10:10,390 INFO L168 Benchmark]: Witness Printer took 114.25 ms. Allocated memory is still 197.1 MB. Free memory was 156.0 MB in the beginning and 139.2 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-29 21:10:10,392 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.27 ms. Allocated memory is still 86.0 MB. Free memory was 67.0 MB in the beginning and 67.0 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 617.12 ms. Allocated memory is still 86.0 MB. Free memory was 49.1 MB in the beginning and 40.3 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 97.19 ms. Allocated memory is still 86.0 MB. Free memory was 40.3 MB in the beginning and 37.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 53.60 ms. Allocated memory is still 86.0 MB. Free memory was 37.8 MB in the beginning and 35.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2426.03 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 35.8 MB in the beginning and 39.2 MB in the end (delta: -3.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 8749.28 ms. Allocated memory was 104.9 MB in the beginning and 197.1 MB in the end (delta: 92.3 MB). Free memory was 38.4 MB in the beginning and 156.0 MB in the end (delta: -117.6 MB). Peak memory consumption was 76.9 MB. Max. memory is 16.1 GB. * Witness Printer took 114.25 ms. Allocated memory is still 197.1 MB. Free memory was 156.0 MB in the beginning and 139.2 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1072 VarBasedMoverChecksPositive, 45 VarBasedMoverChecksNegative, 15 SemBasedMoverChecksPositive, 30 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 113 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.7s, 107 PlacesBefore, 35 PlacesAfterwards, 100 TransitionsBefore, 26 TransitionsAfterwards, 1648 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 91 TotalNumberOfCompositions, 4223 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_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1394; [L824] FCALL, FORK 0 pthread_create(&t1394, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1395; [L826] FCALL, FORK 0 pthread_create(&t1395, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1396; [L828] FCALL, FORK 0 pthread_create(&t1396, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 y$w_buff1 = y$w_buff0 [L787] 3 y$w_buff0 = 1 [L788] 3 y$w_buff1_used = y$w_buff0_used [L789] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L758] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y [L765] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L766] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L768] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L768] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EAX = y [L773] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L773] 2 y = y$flush_delayed ? y$mem_tmp : y [L774] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 2 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L841] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix052_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.4s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 261 SDtfs, 249 SDslu, 717 SDs, 0 SdLazy, 456 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=618occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 32 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 12264 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...